Fast discovery of association rules
Advances in knowledge discovery and data mining
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Principles of data mining
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Database System Implementation
Database System Implementation
Discovery of relational association rules
Relational Data Mining
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Discovery of frequent DATALOG patterns
Data Mining and Knowledge Discovery
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining the space of graph properties
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
ACM Transactions on Database Systems (TODS)
Mining all frequent projection-selection queries from a relational table
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Mining frequent conjunctive queries in star schemas
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies
Fundamenta Informaticae
Discovery and application of functional dependencies in conjunctive query mining
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
An efficient computation of frequent queries in a star schema
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Relational association mining based on structural analysis of saturation clauses
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Towards mining frequent queries in star schemes
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Mining frequent conjunctive queries using functional and inclusion dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Discovering interesting information with advances in web technology
ACM SIGKDD Explorations Newsletter
AMIE: association rule mining under incomplete evidence in ontological knowledge bases
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
In recent years, the problem of association rule mining in transactional data has been well studied. We propose to extend the discovery of classical association rules to the discovery of association rules of conjunctive queries in arbitrary relational data, inspired by the WARMR algorithm, developed by Dehaspe and Toivonen, that discovers association rules over a limited set of conjunctive queries. Conjunctive query evaluation in relational databases is well understood, but still poses some great challenges when approached from a discovery viewpoint in which patterns are generated and evaluated with respect to some well defined search space and pruning operators.