| Decision-theoretic rough set models | p. 1 |
| Efficient attribute reduction based on discernibility matrix | |
| Near sets. Toward approximation space-based object recognition | p. 22 |
| On covering rough sets | p. 34 |
| On transitive uncertainty mappings | p. 42 |
| A complete method to incomplete information systems | p. 50 |
| Information concept lattice and its reductions | p. 60 |
| Homomorphisms between relation information systems | p. 68 |
| Dynamic reduction based on rough sets in incomplete decision systems | p. 76 |
| Entropies and co-entropies for incomplete information systems | p. 84 |
| Granular computing based on a generalized approximation space | p. 93 |
| A general definition of an attribute reduct | p. 101 |
| Mining associations for interface design | p. 109 |
| Optimized generalized decision in dominance-based rough set approach | p. 118 |
| Monotonic variable consistency rough set approaches | p. 126 |
| Bayesian decision theory for dominance-based rough set approach | p. 134 |
| Ranking by rough approximation of preferences for decision engineering applications | p. 142 |
| Applying a decision making model in the early diagnosis of Alzheimer's disease | p. 149 |
| Singular and principal subspace of signal information system by BROM algorithm | p. 157 |
| Biometric verification by projections in error subspaces | p. 166 |
| Absolute contrasts in face detection with AdaBoost cascade | p. 174 |
| Voice activity detection for speaker verification systems | p. 181 |
| Face detection by discrete gabor jets and reference graph of fiducial points | p. 187 |
| Iris recognition with adaptive coding | p. 195 |
| Overview of Kansei system and related problems | p. 203 |
| Reduction of categorical and numerical attribute values for understandability of data and rules | p. 211 |
| Semi-structured decision rules in object-oriented rough set models for Kansei engineering | p. 219 |
| Functional data analysis and its application | p. 228 |
| Evaluation of pictogram using rough sets | p. 236 |
| A logical representation of images by means of multi-rough sets for Kansei image retrieval | p. 244 |
| A batch rival penalized EM algorithm for Gaussian mixture clustering with automatic model selection | p. 252 |
| A memetic-clustering-based evolution strategy for traveling salesman problems | p. 260 |
| An efficient probabilistic approach to network community mining | p. 267 |
| A new approach to underdetermined blind source separation using sparse representation | p. 276 |
| Evolutionary fuzzy biclustering of gene expression data | p. 284 |
| Rough clustering and regression analysis | p. 292 |
| Rule induction for prediction of MHC II-binding peptides | p. 300 |
| Efficient local protein structure prediction | p. 308 |
| Roughfication of numeric decision tables : the case study of gene expression data | p. 316 |
| Ubiquitous customer relationship management (uCRM) | p. 324 |
| Towards the optimal design of an RFID-based positioning system for the ubiquitous computing environment | p. 331 |
| Wave dissemination for wireless sensor networks | p. 339 |
| Two types of a zone-based clustering method for wireless sensor networks | p. 347 |
| Set approximations in multi-level conceptual data | p. 355 |
| Knowledge reduction in generalized consistent decision formal contexts | p. 364 |
| Graphical representation of information on the set of reducts | p. 372 |
| Minimal attribute space bias for attribute reduction | p. 379 |
| Two-phase [beta]-certain reducts generation | p. 387 |
| Formal concept analysis and set-valued information systems | p. 395 |
| Descriptors and templates in relational information systems | p. 403 |
| ROSA : an algebra for rough spatial objects in databases | p. 411 |
| Learning models based on formal concept | p. 419 |
| Granulation based approximate ontologies capture | p. 427 |
| Fuzzy-valued transitive inclusion measure, similarity measure and application to approximate reasoning | p. 435 |
| Model composition in multi-dimensional data spaces | p. 443 |
| An incremental approach for attribute reduction in concept lattice | p. 451 |
| Topological space for attributes set of a formal context | p. 460 |
| Flow graphs as a tool for mining prediction rules of changes of components in temporal information systems | p. 468 |
| Approximation space-based socio-technical conflict model | p. 476 |
| Improved quantum-inspired genetic algorithm based time-frequency analysis of radar emitter signals | p. 484 |
| Parameter setting of quantum-inspired genetic algorithm based on real observation | p. 492 |
| A rough set penalty function for marriage selection in multiple-evaluation genetic algorithms | p. 500 |
| Multiple solutions by means of genetic programming : a collision avoidance example | p. 508 |
| An approach for selective ensemble feature selection based on rough set theory | p. 518 |
| Using rough reducts to analyze the independency of earthquake precursory items | p. 526 |
| Examination of the parameter space of a computational model of acute ischaemic stroke using rough sets | p. 534 |
| Using rough set theory to induce pavement maintenance and rehabilitation strategy | p. 542 |
| Descent rules for championships | p. 550 |
| Rough neuro voting system for data mining : application to stock price prediction | p. 558 |
| Counting all common subsequences to order alternatives | p. 566 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
