Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
Fast discovery of association rules
Advances in knowledge discovery and data mining
Efficient mining of association rules using closed itemset lattices
Information Systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Rough Set Analysis of Preference-Ordered Data
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Descriptors and templates in relational information systems
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
| Hi-index | 0.00 |
We discuss generalizations of the basic notion of a template defined over information systems using indiscernibility relation. Generalizations refer to the practical need of operating with more compound descriptors, over both symbolic and numeric attributes, as well as to a more entire extension from equivalence to tolerance relations between objects. We briefly show that the heuristic algorithms known from literature to search for templates in their classical indiscernibility-based form, can be easily adapted to the case of tolerance relations.