Interesting multi-relational patterns

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 675-684

  Spyropoulou, Eirini ^a   De Bie, Tijl ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED SUBGRAPHS; DATA MINERS; DATA MINING COMMUNITY; EFFICIENT ALGORITHM; INTERESTINGNESS; K-PARTITE GRAPH; PRIOR INFORMATION; RESEARCH PROBLEMS; SYNTHETIC DATABASE;

ALGORITHMS; DATABASE SYSTEMS; SYNTACTICS;

DATA MINING;

EID: 84857164628     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.82     Document Type: Conference Paper

References (23)

1. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 2005.
2. T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery, 2011.
3. T. De Bie, K.-N. Kontonasios, and E. Spyropoulou. A framework for mining interesting pattern sets. SIGKDD Explorations, 2010.
4. L. De Raedt and A. Zimmermann. Constraint-based pattern set mining. In Proc of the 2007 SIAM International Conference on Data Mining (SDM), pages 237-248, 2007.
5. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Mining and Knowledge discovery, 3:7-36, March 1999.
6. R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Addison Wesley, 2006.
7. F. Geerts, B. Goethals, and T. Mielikainen. Tiling databases. In Proc of Discovery Science, pages 278-289, 2004.
8. L. Geng and H. J. Hamilton. Interestingness measures for data mining: A survey. ACM Computing Surveys., 38, 2006.
9. A. Gionis, H. Mannila, T. Mielikinen, and P. Tsaparas. Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3), 2007.
10. B. Goethals, W. L. Page, and M. Mampaey. Mining interesting sets and rules in relational databases. In Proc of the ACM Symposium on Applied Computing (SAC), pages 997-1001, 2010.
11. S. Hanhijarvi, M. Ojala, N. Vuokko, K. Puolamaki, N. Tatti, and H. Mannila. Tell me something i don't know: randomization strategies for iterative data mining. In Proc of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 379-388. ACM, 2009.
12. H. C. Johnston. Cliques of a graph-variations on the Bron- Kerbosch algorithm. International Journal of Parallel Programming, 5:209-238, 1976.
13. A. Koopman and A. Siebes. Discovering relational item sets efficiently. In Proc of the SIAM Conference on Data Mining (SDM), pages 108-119, 2008.
14. A. Koopman and A. Siebes. Characteristic relational patterns. In Proc of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 437- 446, 2009.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc of the ICDM'01, pages 313-320, 2001.
16. E. K. K. Ng, K. Ng, A. W.-C. Fu, and K. Wang. Mining association rules from stars. In Proc of the 2002 IEEE International Conference on Data Mining (ICDM), pages 322-329, 2002.
17. S. Nijssen and J. Kok. Efficient frequent query discovery in FARMER. In Proc of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), pages 350-362, 2003.
18. M. Ojala, G. C. Garriga, A. Gionis, and H. Mannila. Evaluating query result significance in databases via randomizations. In Proc of the SIAM Conference on Data Mining (SDM), pages 906-917, 2010.
19. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In Proc of the SIAM Conference on Data Mining (SDM), 2006.
20. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc of the ICDM'02, pages 721-730, 2002.
21. M. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In Proc of the 2002 SIAM International Conference on Data Mining (SDM), pages 457- 473, 2002.
22. M. Zaki and M. Ogihara. Theoretical foundations of association rules. In 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1998.
23. M. Zaki, M. Peters, I. Assent, and T. Seidl. Clicks: An effective algorithm for mining subspace clusters in categorical datasets. Data and Knowledge Engineering, 60(1):51-70, 2007.