Characteristic relational patterns

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 437-445

  Koopman, Arne ^a   Siebes, Arno ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Frequent patterns; MDL; Relational data mining

Indexed keywords

ATTRIBUTE VALUES; DATA ANALYSIS; DATABASE SIZE; FREQUENT PATTERNS; GLOBAL MODELS; MDL; NEW APPROACHES; ORDERS OF MAGNITUDE; PATTERN LANGUAGES; RELATIONAL DATA MINING; RELATIONAL DATABASE;

DATABASE SYSTEMS;

EID: 70350660923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557071     Document Type: Conference Paper

References (16)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993, pages 207-216. ACM Press, 1993.
2. J. De Knijf. Fat-miner: mining frequent attribute trees. In SAC '07: Proceedings of the 2007 ACM symposium on Applied computing, pages 417-422, New York, NY, USA, 2007. ACM.
3. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Min. Knowl. Discov., 3(1):7-36, 1999.
4. P. A. Flach and I. Savnik. Database dependency discovery: a machine learning approach. AI Commun., 12(3):139-160, 1999.
5. L. Getoor, N. Friedman, D. Koller, A. Pfeffer, and B. Taskar. Probabilistic relational models. In L. Getoor and B. Taskar, editors, An Introduction to Statistical Relational Learning. MIT Press, 2007.
6. B. Goethals, W. Le Page, and H. Mannila. Mining association rules of simple conjunctive queries. In M. Zaki and K. Wang, editors, SDM, pages 96-107. SIAM, 2008.
7. P. D. Grünwald. Minimum description length tutorial. In P. Grünwald and I. Myung, editors, Advances in Minimum Description Length. MIT Press, 2005.
8. A. Knobbe. Multi-Relational Data Mining. PhD thesis, Universiteit Utrecht, Utrecht, the Netherlands, 2004.
9. D. Koller and A. Pfeffer. Probabilistic frame-based systems. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pages 580-587, 1998.
10. A. Koopman and A. Siebes. Discovering relational items sets efficiently. In M. Zaki and K. Wang, editors, SDM, pages 108-119. SIAM, 2008.
11. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1993.
12. H. Mannila and K.-J. Räihä. Algorithms for inferring functional dependencies from relations. Data Knowl. Eng., 12(1):83-99, 1994.
13. S. Nijssen and J. N. Kok. Efficient frequent query discovery in farmer. In In Proc. of the 7th PKDD, volume 2838 of LNCS, pages 350-362. Springer, 2003.
14. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In J. Ghosh, D. Lambert, D. B. Skillicorn, J. Srivastava, J. Ghosh, D. Lambert, D. B. Skillicorn, and J. Srivastava, editors, SDM, pages 393-404. SIAM, 2006.
15. M. S. Tsechansky, N. Pliskin, G. Rabinowitz, and A. Porath. Mining relational patterns from multiple relational tables. Decis. Support Syst., 27(1-2):177-195, 1999.
16. X. Yin, J. Han, J. Yang, J. Yang, and P. S. Yu. Crossmine: Efficient classification across multiple database relations. In ICDE '04: Proceedings of the 20th International Conference on Data Engineering, pages 399-411, Washington, DC, USA, 2004. IEEE Computer Society.