Scribd
Upload
16 views

Graph Relational Data

This document discusses association rule mining of relational data. It lists several key papers on mining sequential patterns, scale-free networks, edge-disjoint patterns in graph-relational data, differential association rule mining for protein-protein interaction networks, mining frequent approximate patterns from massive networks, mining association rules in entity-relationship modeled databases, discovery of frequent DATALOG patterns, and discovery of relational association rules. The document provides an overview of the literature on mining patterns and rules from relational and graph-structured data.

Uploaded by

Srinivas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Graph Relational Data

This document discusses association rule mining of relational data. It lists several key papers on mining sequential patterns, scale-free networks, edge-disjoint patterns in graph-relational data, differential association rule mining for protein-protein interaction networks, mining frequent approximate patterns from massive networks, mining association rules in entity-relationship modeled databases, discovery of frequent DATALOG patterns, and discovery of relational association rules. The document provides an overview of the literature on mining patterns and rules from relational and graph-structured data.

Uploaded by

Srinivas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Association Rule Mining of Relational Data

Agrawal, R. & Srikant, R. (1995). Mining sequential Dietterich, T. (2003). Sequential Supervised Learning:
patterns. In Proceedings 11th International Conference Methods for Sequence Labeling and Segmentation.
on Data Engineering, IEEE Computer Society Press, Invited Talk, 3rd IEEE International Conference on
Taipei, Taiwan, 3-14. Data Mining, Melbourne, FL, USA.
Barabasi, A.L. & Bonabeau, E. (2003). Scale-free Džeroski, S. & Lavrač, N. (2001). Relational Data
Networks, Scientific American, 288(5), 60-69. Mining, Berlin: Springer.
Besemann, C. & Denton, A. (Apr. 2007). Mining edge- Getoor, L. & Diehl, C. (2005). Link mining: a survey.
disjoint patterns in graph-relational data. Workshop on SIGKDD Explorer Newsletter 7(2) 3-12.
Data Mining for Biomedical Informatics in conjunction
Goethals, B., Hoekx, E., & Van den Bussche, J. (2005).
with the 6th SIAM International Conference on Data
Mining tree queries in a graph. In Proceeding 11th
Mining, Minneapolis, MN.
International Conference on Knowledge Discovery in
Besemann, C., Denton, A., Carr, N.J., & Prüß, B.M. Data Mining, Chicago, Illinois, USA. 61-69.
(2006). BISON: A Bio- Interface for the Semi-global
Hasan, M., Chaoji, V., Salem, S., Besson, J., & Zaki,
analysis Of Network patterns, Source Code for Biology
M.J. (2007). ORIGAMI: Mining Representative Or-
and Medicine, 1:8.
thogonal Graph Patterns. In Proceedings International
Besemann, C., Denton, A., Yekkirala, A., Hutchison, R., Conference on Data Mining, Omaha, NE.
& Anderson, M. (Aug. 2004). Differential Association
Inokuchi, A., Washio, T. & Motoda, H. (2000). An
Rule Mining for the Study of Protein-Protein Interaction
Apriori-Based Algorithm for Mining Frequent Sub-
Networks. In Proceedings ACM SIGKDD Workshop
structures from Graph Data. In Proceedings 4th Eu-
on Data Mining in Bioinformatics, Seattle, WA.
ropean Conference on Principles of Data Mining and
Brin, S., Motwani, R., Ullman, J.D., & Tsur, S. (1997). Knowledge Discovery. Lyon, France”, 13-23.
Dynamic itemset counting and implication rules for
Jensen, D. & Neville, J. (2002). Linkage and autocor-
market basket data. In Proceedings ACM SIGMOD
relation cause feature selection bias in relational learn-
International Conference on Management of Data,
ing. In Proceedings 19th International Conference on
Tucson, AZ.
Machine Learning, Sydney, Australia, 259-266.
Chen, C., Yan, X., Zhu, F., & Han, J. (2007). gApprox:
Kramer, S., Lavrač, N. & Flach, P. Propositionalization
Mining Frequent Approximate Patterns from a Massive
Approaches to Relational Data Mining. In Relational
Network. In Proceedings International Conference on
Data Mining. Eds. Džeroski, S. & Lavrač, N. Berlin:
Data Mining, Omaha, NE.
Springer.
Cristofor, L. & Simovici, D. (2001). Mining Association
Kuramochi, M. & Karypis, G. (2004). An Efficient
Rules in Entity-Relationship Modeled Databases, Tech-
Algorithm for Discovering Frequent Subgraphs. IEEE
nical Report, University of Massachusetts Boston.
Transactions on Knowledge and Data Engineering.
Dehaspe, L. & De Raedt, L. (Dec. 1997). Mining As- 16(9).
sociation Rules in Multiple Relations. In Proceedings
Kuramochi, M. and Karypis, G. (2005). Finding Fre-
7th International Workshop on Inductive Logic Pro-
quent Patterns in a Large Sparse Graph, Data Mining
gramming”, Prague, Czech Republic”, 125-132.
and Knowledge Discovery. 11(3).
Dehaspe, L. & Toivonen, H. (1999). Discovery of fre-
Macskassy, S. & Provost, F. (2003). A Simple Relational
quent DATALOG patterns. Data Mining and Knowledge
Classifier. In Proceedings 2nd Workshop on Multi-Rela-
Discovery 3(1).
tional Data Mining at KDD’03, Washington, D.C.
Dehaspe, L. & Toivonen, H. (2001). Discovery of Re-
Neville, J. and Jensen, D. (2007). Relational Dependen-
lational Association Rules. In Relational Data Mining.
cy Networks. Journal of Machine Learning Research.
Eds. Džeroski, S. & Lavrač, N. Berlin: Springer.
8(Mar) 653-692.



You might also like