Computational methods for rough classification and discovery
Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining
Rough computational methods for information systems
Artificial Intelligence
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Mining Ontology for Automatically Acquiring Web User Information Needs
IEEE Transactions on Knowledge and Data Engineering
Learning quantifiable associations via principal sparse non-negative matrix factorization
Intelligent Data Analysis
SMARViz: Soft Maximal Association Rules Visualization
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
Mining rough association from text documents for web information gathering
Transactions on rough sets VII
Ontology based web mining for information gathering
WImBI'06 Proceedings of the 1st WICI international conference on Web intelligence meets brain informatics
International Journal of Intelligent Information and Database Systems
A soft set approach for association rules mining
Knowledge-Based Systems
Mining quantitative associations in large database
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Mining rough association from text documents
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
A fast host-based intrusion detection system using rough set theory
Transactions on Rough Sets IV
Usage of Fuzzy, Rough, and Soft Set Approach in Association Rule Mining
International Journal of Artificial Life Research
Hi-index | 0.00 |
In transaction processing, an association is said to existbetween two sets of items when a transaction containingone set is likely to also contain the other. In informationretrieval, an association between two sets of keywords occurswhen they co-occur in a document. Similarly, in datamining, an association occurs when one attribute set occurstogether with another. As the number of such associationsmay be large, maximal association rules are sought, e.g.,Feldman et al (1997, 1998).Rough set theory is a successful tool for data mining. Byusing this theory, rules similar to maximal associations canbe found. However, we show that the rough set approach todiscovering knowledge is much simpler than the maximalassociation method.