On mining closed sets in multi-relational data

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 804-809

  Garriga, Gemma C ^a   Khardon, Roni ^b   De Raedt, Luc ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b Tufts University   (United States)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; CLOSED SET; RUNTIMES;

ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; SEMANTICS;

ALGORITHMS;

EID: 38149114804     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, pages 307-328, 1996.
2. H. Arimura and T. Uno. An output-polynomial time algorithm for mining frequent closed attribute trees. In Proc. 15th Conference on Inductive Logic Programming, volume 3625 of LNCS, pages 1-19, 2005.
3. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proc. of 1st Conference on Computational Logic, volume 1861 of LNCS, pages 972-986, 2000.
4. L. De Raedt and L. Dehaspe. Clausal discovery. Mach. Learn., 26(2-3), 1997.
5. L. De Raedt and J. Ramon. Condensed representations for Inductive Logic Programming. In Proc. of the 9th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pages 438-446, 2004.
6. L. Dehaspe and H. Toivonen. Discovery of relational association rules. Relational Data Mining, pages 189-208, 2000.
7. B. Ganter and R. Wille. Formal Concept Analysis. Mathematical Foundations. Springer, 1998.
8. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations: report on FIMI'03. SIGKDD Explor. Newsl., 6(1):109-117, 2004.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 1-12. ACM Press, 2000.
10. J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.
11. D. Malerba and F.A. Lisi. Discovering associations between spatial objects: An ILP application. In Proc. 15th Conference on Inductive Logic Programming, volume 2157 of LNCS, pages 156-163, 2001.
12. J. Maloberti and E. Suzuki. Improving efficiency of frequent query discovery by eliminating non-relevant candidates. In Discovery Science, volume 2843 of LNCS, pages 220-232, 2003.
13. A. McCallum, K. Nigam, J. Rennie, and K. Seymore. A machine learning approach to building domain-specific search engines. In The 16th Int. Joint Conf. on Artificial Intelligence, 1999.
14. S. Nijssen and J.N. Kok. Efficient frequent query discovery in FARMER. In Proc. of the 7th PKDD, volume 2838 of LNCS, pages 350-362, 2003.
15. G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, pages 153-163. American Elsevier, 1970.
16. T. Uno, T. Asai, Y. Uchida, and H. Arimura. An efficient algorithmfor enumerating closed patterns in transaction databases. In Discovery Science, pages 16-31, 2004.
17. X. Yan and J. Han. CloseGraph: mining closed frequent graph patterns. In Proc. of the 9th ACM SIGKDD, pages 286-295. ACM Press, 2003.
18. M. Zaki. Mining non-redundant association rules. Data Mining and Knowledge Discovery, 4(3):223-248, 2004. (Pubitemid 39193158)