Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Algorithms for association rule mining — a general survey and comparison
ACM SIGKDD Explorations Newsletter
Relational Data Mining
Discovery of frequent DATALOG patterns
Data Mining and Knowledge Discovery
Multi-Relational Data Mining, Using UML for ILP
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining Association Rules in Multiple Relations
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Inducing Multi-Level Association Rules from Multiple Relations
Machine Learning
Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)
Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Handbook of Granular Computing
Handbook of Granular Computing
Editorial: Introduction to special issues on data mining and granular computing
International Journal of Approximate Reasoning
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
Rough - Granular Computing in Knowledge Discovery and Data Mining
Rough - Granular Computing in Knowledge Discovery and Data Mining
Classification of dynamics in rough sets
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Similarity-Based Classification in Relational Databases
Fundamenta Informaticae
A Summary and Update of "Fuzzy Logic
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
Information Sciences: an International Journal
Modeling rough granular computing based on approximation spaces
Information Sciences: an International Journal
Toward a Theory of Granular Computing for Human-Centered Information Processing
IEEE Transactions on Fuzzy Systems
Granular computing for relational data classification
Journal of Intelligent Information Systems
Derivation digraphs for dependencies in ordinal and similarity-based data
Information Sciences: an International Journal
Hi-index | 0.07 |
We propose a novel framework for association discovery from relational data. The framework is a specialized version of the general framework intended for mining relational data and is defined in granular computing theory. In the framework proposed in this paper we define a method for deriving information granules from relational data. Such granules are the basis for association discovery. Our framework, unlike others, unifies not only the way the data and patterns to be derived are expressed and specified, but also partially the process of discovering patterns from the data. Namely, the patterns can be directly obtained from the information granules or constructed based on them. Moreover, the information granule-based relational data representation, defined in the framework, can be treated as the search space for association discovery. Thanks to this the size of the search space may significantly be limited. Furthermore, we apply in our approach the granular computing idea of switching between different levels of granularity of the universe. Thanks to this relational data representation can easily be replaced by another one and thereby adjusted to a given data mining task, e.g., association discovery. The results of preliminary experiments show that granular representation of relational data can be powerful enough to generate essential patterns.