Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Discovery of concurrent data models from experimental tables: a rough set approach
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Theoretical foundations of order-based genetic algorithms
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Uncertainly measures of rough set prediction
Artificial Intelligence
Rough sets and association rule generation
Fundamenta Informaticae
Rough set algorithms in classification problem
Rough set methods and applications
Various approaches to reasoning with frequency based decision reducts: a survey
Rough set methods and applications
Rough set methods for the synthesis and analysis of concurrent processes
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Database Systems: The Complete Book
Database Systems: The Complete Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Rough set methods in feature selection and recognition
Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Handbook of data mining and knowledge discovery
Handbook of data mining and knowledge discovery
Fundamenta Informaticae
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
Interactive Gene Clustering--A Case Study of Breast Cancer Microarray Data
Information Systems Frontiers
ACM Computing Surveys (CSUR)
Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series)
Ensembles of Classifiers Based on Approximate Reducts
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
On Construction of Partial Reducts and Irreducible Partial Decision Rules
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
FBIT '07 Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies
Brighthouse: an analytic data warehouse for ad-hoc queries
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
Fundamental study: The multiple facets of the canonical direct unit implicational basis
Theoretical Computer Science
On reduct construction algorithms
Transactions on computational science II
Association reducts: boolean representation
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Association reducts: complexity and heuristics
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Association reducts: a framework for mining multi-attribute dependencies
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Sequential covering rule induction algorithm for variable consistency rough set approaches
Information Sciences: an International Journal
Projected Gustafson-Kessel clustering algorithm and its convergence
Transactions on rough sets XIV
Applications of approximate reducts to the feature selection problem
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Rough-set-inspired feature subset selection, classifier construction, and rule aggregation
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Ensembles of bireducts: towards robust classification and simple representation
FGIT'11 Proceedings of the Third international conference on Future Generation Information Technology
A measurement theory view on the granularity of partitions
Information Sciences: an International Journal
Dynamic rule-based similarity model for DNA microarray data
Transactions on Rough Sets XV
The problem of finding the sparsest bayesian network for an input data set is NP-Hard
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
| Hi-index | 0.00 |
We investigate the notion of an association reduct. Association reducts represent data-based functional dependencies between the sets of attributes, where it is preferred that possibly smallest sets determine possibly largest sets. We compare the notions of an association reduct to other types of reducts previously studied within the theory of rough sets. We focus particularly on modeling inexactness of dependencies, which is crucial for many real-life data applications. We also study the optimization problems and algorithms that aim at searching for the most interesting approximate association reducts in data.