2008, Volume 10, Issue 9
Strategic Study of CAE >> 2008, Volume 10, Issue 9
Semantically condensed multi-relational frequent pattern discovery based on conjunctive query containment
School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China
Next Previous
Abstract
Multi-relational data mining is one of rapidly developing subfields of data mining. Multi-relational frequent pattern discovery approaches directly look for frequent patterns that involve multiple relations from a relational database. While the state-of-the-art of multi-relational frequent pattern discovery approaches is based on the inductive logical programming techniques, we propose an approach to semantically condensed multi-relational frequent pattern discovery based on conjunctive query containment in terms of the theory and technique of relational database. With the novelty of the groundwork, the proposed approach deals with two kinds of semantically redundant problems. In theory and experiments, it shows that our approach improve the understandability, function, efficiency and scalability of the state-of-the-art of multi-relational frequent pattern discovery approaches.
Keywords
multi-relational data mining ; frequent pattern discovery ; conjunctive query ; condensed pattern
Figures
图1
References
[ 1 ] Agrawal R, Srikant R.Fast algorithms for mining association rules in large databases [ A] .Proceedings of the 20th International Con- ference on Very Large Data Bases [ C] .Morgan Kaufmann Pub- lishers, Inc, San Francisco, CA, USA, 1994.487 -499 link1
[ 2 ] Hipp J, Guntzer U, Nakaeizadeh G.Algorithms for association rule mining - a general survey and comparison [ J] .ACM SIGK- DD Explorations, 2000 , 2 ( 1 ) : 58 -64 link1
[ 3 ] Dzeroski S, Lavrac N.Relational Data Mining [M].Springer, Berlin, 2001
[ 4 ] Dehaspe L, Toivonen H.Discovery of frequent datalog patterns [ J] .Data Mining and Knowledge Discovery, 1999 , 3 ( 1 ) : 7 -36 link1
[ 5 ] Nijssen S, Kok J N.Faster association rules for multiple relations [ A] .Proceedings of the 17th International Joint Conference on Artificial Intelligence [ C ] .Morgan Kaufmann Publishers, Inc, Seattle, USA, 2001.891 -896 link1
[ 6 ] De Raedt L, Ramon J.Condensed representations for inductive logic programming [ A ] .Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning [ C] .AAAI Press, USA, 2004.438 -446 link1
[ 7 ] Ullman J.Principles of Database and Knowledge -base Systems, Volume 1 [ M] .Computer Science Press, USA, 1988
[ 8 ] Miguel R, Nieves R.A general procedure to check conjunctive query containment [J].Artificial Intelligence, 2002, 38(7) : 489 -529 link1
[ 9 ] Mannila H, Toivonen H.Levelwise search and borders of theories in knowledge discovery [ J] .Data Mining and Knowledge Discov- ery, 1997 , 1 ( 3 ) : 241 -258 link1
[10] Wrobel S.An algorithm for multi -relational discovery of sub- groups [ A] .Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery [ C] . Springer, Berlin, Germany, 1997.78 -87 link1
[11] Blockeel H, Raedt L D.Top -down induction of first -order logical de- cision trees [J].Artificial Intelligence, 1998, 101(1 ― 2): 285 -297 link1
[12] King R, Muggleton S, Srinivasan A, et al.Structure -activity relationships derived by machine learning: the use of atoms and bonds and their connectivities to predict mutagenicity in inductive learning programming [ A] .Proceedings of the National Acade- my of Sciences [ C] .USA, 1996 :93 ( 1 ) 438 -442 link1
[13] ILP 2005 Challenge, Bonn, Germany [ EB /OL] .http: //www. protein -logic.com /data.html, 2005
京公网安备 11010502051620号
