Mining association rules of simple conjunctive queries

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 1, Issue , 2008, Pages 96-107

  Goethals, Bart ^a   Le Page, Wim ^a   Mannila, Heikki ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES;

CONJUNCTIVE QUERIES; MINING ASSOCIATIONS; RELATIONAL DATABASE;

DATA MINING;

EID: 52649127348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.9     Document Type: Conference Paper

References (20)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. R. Agrawal, T. Imielinski, and A.N. Swami. Mining association rules between sets of items in large databases. In Buneman and Jajodia [6], pages 207-216.
3. R. Agrawal, T. Imielinski, and A.N. Swami. Mining association rules between sets of items in large databases. In Buneman and Jajodia [6], pages 207-216.
4. R. Bocklandt. http://www.persecondewijzer.net.
5. P. Bohannon, W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for data cleaning. In Proceedings of the International Conference on Data Engineering, 2007.
6. P. Buneman and S. Jajodia, editors. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, volume 22:2 of SIGMOD Record. ACM Press, 1993.
7. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings 9th ACM Symposium on the Theory of Computing, pages 77-90. ACM Press, 1977.
8. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery, 3(1):7-36, 1999.
9. B. Goethals, E. Hoekx, and J. Van den Bussche. Mining tree queries in a graph. Conference on Knowledge Discovery in Data, pages 61-69, 2005.
10. B. Goethals and J. Van den Bussche. Relational Association Rules: Getting WARMeR. Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery, pages 125-139, 2002.
11. E. Hoekx and J. Van den Bussche. Mining for Tree-Query Associations in a Graph. In Proceedings IEEE International Conference on Data Mining, 2006.
12. IMDB. http://imdb.com.
13. A. Inokuchi, T. Washio, and H. Motoda. An Apriori-based algorithm for mining frequent substructures from graph data. In D.A. Zighed, HJ. Komorowski, and J.M. Zytkow, editors, PKDD, volume 1910 of Lecture Notes in Computer Science, pages 13-23. Springer, 2000.
14. J. Kivinen and H. Mannila, Approximate inference of functional dependencies from relations. Theoretical Computer Science, 149(1):129-149, 1995.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In N. Cercone, T.Y. Lin, and X. Wu, editors, Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM2001), pages 313-320. IEEE Computer Society Press, 2001.
16. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
17. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In Proceedings AAAI Workshop on Knowledge Discovery in Databases, pages 181-192. AAAI Press, 1994.
18. E. W. Weisstein. Restricted growth string. From MathWorld-A Wolfram Web Resource, http://mathworld.wolfram.com/RestrictedGrowthString.html.
19. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pages 721-724. IEEE Computer Society Press, 2002.
20. MJ. Zaki. Efficiently mining frequent trees in a forest. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 71-80. ACM Press, 2002.