|
|
|
|
LEADER |
07370nam a22006375i 4500 |
001 |
978-3-540-72458-2 |
003 |
DE-He213 |
005 |
20151123191758.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540724582
|9 978-3-540-72458-2
|
024 |
7 |
|
|a 10.1007/978-3-540-72458-2
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TJ210.2-211.495
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TJFM1
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Rough Sets and Knowledge Technology
|h [electronic resource] :
|b Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007. Proceedings /
|c edited by JingTao Yao, Pawan Lingras, Wei-Zhi Wu, Marcin Szczuka, Nick J. Cercone, Dominik Ślȩzak.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
300 |
|
|
|a XIV, 578 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4481
|
505 |
0 |
|
|a Invited Papers -- Decision-Theoretic Rough Set Models -- Efficient Attribute Reduction Based on Discernibility Matrix -- Near Sets. Toward Approximation Space-Based Object Recognition -- Rough Set Foundations -- On Covering Rough Sets -- On Transitive Uncertainty Mappings -- A Complete Method to Incomplete Information Systems -- Information Concept Lattice and Its Reductions -- Homomorphisms Between Relation Information Systems -- Dynamic Reduction Based on Rough Sets in Incomplete Decision Systems -- Entropies and Co–entropies for Incomplete Information Systems -- Granular Computing Based on a Generalized Approximation Space -- A General Definition of an Attribute Reduct -- Multiple Criteria Decision Analysis -- Mining Associations for Interface Design -- Optimized Generalized Decision in Dominance-Based Rough Set Approach -- Monotonic Variable Consistency Rough Set Approaches -- Bayesian Decision Theory for Dominance-Based Rough Set Approach -- Ranking by Rough Approximation of Preferences for Decision Engineering Applications -- Applying a Decision Making Model in the Early Diagnosis of Alzheimer’s Disease -- Biometrics -- Singular and Principal Subspace of Signal Information System by BROM Algorithm -- Biometric Verification by Projections in Error Subspaces -- Absolute Contrasts in Face Detection with AdaBoost Cascade -- Voice Activity Detection for Speaker Verification Systems -- Face Detection by Discrete Gabor Jets and Reference Graph of Fiducial Points -- Iris Recognition with Adaptive Coding -- Kansei Engineering -- Overview of Kansei System and Related Problems -- Reduction of Categorical and Numerical Attribute Values for Understandability of Data and Rules -- Semi-structured Decision Rules in Object-Oriented Rough Set Models for Kansei Engineering -- Functional Data Analysis and Its Application -- Evaluation of Pictogram Using Rough Sets -- A Logical Representation of Images by Means of Multi-rough Sets for Kansei Image Retrieval -- Autonomy-Oriented Computing -- A Batch Rival Penalized EM Algorithm for Gaussian Mixture Clustering with Automatic Model Selection -- A Memetic-Clustering-Based Evolution Strategy for Traveling Salesman Problems -- An Efficient Probabilistic Approach to Network Community Mining -- A New Approach to Underdetermined Blind Source Separation Using Sparse Representation -- Soft Computing in Bioinformatics -- Evolutionary Fuzzy Biclustering of Gene Expression Data -- Rough Clustering and Regression Analysis -- Rule Induction for Prediction of MHC II-Binding Peptides -- Efficient Local Protein Structure Prediction -- Roughfication of Numeric Decision Tables: The Case Study of Gene Expression Data -- Ubiquitous Computing and Networking -- Ubiquitous Customer Relationship Management (uCRM) -- Towards the Optimal Design of an RFID-Based Positioning System for the Ubiquitous Computing Environment -- Wave Dissemination for Wireless Sensor Networks -- Two Types of a Zone-Based Clustering Method for Wireless Sensor Networks -- Rough Set Algorithms -- Set Approximations in Multi-level Conceptual Data -- Knowledge Reduction in Generalized Consistent Decision Formal Contexts -- Graphical Representation of Information on the Set of Reducts -- Minimal Attribute Space Bias for Attribute Reduction -- Two-Phase ?-Certain Reducts Generation -- Formal Concept Analysis and Set-Valued Information Systems -- Descriptors and Templates in Relational Information Systems -- ROSA: An Algebra for Rough Spatial Objects in Databases -- Knowledge Representation and Reasoning -- Learning Models Based on Formal Concept -- Granulation Based Approximate Ontologies Capture -- Fuzzy-Valued Transitive Inclusion Measure, Similarity Measure and Application to Approximate Reasoning -- Model Composition in Multi-dimensional Data Spaces -- An Incremental Approach for Attribute Reduction in Concept Lattice -- Topological Space for Attributes Set of a Formal Context -- Flow Graphs as a Tool for Mining Prediction Rules of Changes of Components in Temporal Information Systems -- Approximation Space-Based Socio-Technical Conflict Model -- Genetic Algorithms -- Improved Quantum-Inspired Genetic Algorithm Based Time-Frequency Analysis of Radar Emitter Signals -- Parameter Setting of Quantum-Inspired Genetic Algorithm Based on Real Observation -- A Rough Set Penalty Function for Marriage Selection in Multiple-Evaluation Genetic Algorithms -- Multiple Solutions by Means of Genetic Programming: A Collision Avoidance Example -- Rough Set Applications -- An Approach for Selective Ensemble Feature Selection Based on Rough Set Theory -- Using Rough Reducts to Analyze the Independency of Earthquake Precursory Items -- Examination of the Parameter Space of a Computational Model of Acute Ischaemic Stroke Using Rough Sets -- Using Rough Set Theory to Induce Pavement Maintenance and Rehabilitation Strategy -- Descent Rules for Championships -- Rough Neuro Voting System for Data Mining: Application to Stock Price Prediction -- Counting All Common Subsequences to Order Alternatives.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Database management.
|
650 |
|
0 |
|a Data mining.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Pattern recognition.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Data Mining and Knowledge Discovery.
|
650 |
2 |
4 |
|a Database Management.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Pattern Recognition.
|
700 |
1 |
|
|a Yao, JingTao.
|e editor.
|
700 |
1 |
|
|a Lingras, Pawan.
|e editor.
|
700 |
1 |
|
|a Wu, Wei-Zhi.
|e editor.
|
700 |
1 |
|
|a Szczuka, Marcin.
|e editor.
|
700 |
1 |
|
|a Cercone, Nick J.
|e editor.
|
700 |
1 |
|
|a Ślȩzak, Dominik.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540724575
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4481
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-72458-2
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|