Abstract
We present the UFC (Unconnected From Connected) algorithm which discovers both connected and disconnected frequent graphs. It discovers connected frequent graphs by means of any existing graph mining algorithm and then joins these graphs with each other creating unconnected frequent graphs with increasing number of connected components. We compare our method with previously proposed UGM algorithm and a gSpan variation.
This work is supported by the National Centre for Research and Development (NCBiR) under Grant No. SP/I/1/77065/10 by the Strategic scientific research and experimental development program: Interdisciplinary System for Interactive Scientific and Scientific-Technical Information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, pp. 207–216 (1993)
Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: ICDM, vol. 00:51 (2002)
Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomophism (2003)
Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: KDD 2004, pp. 581–586 (2004)
Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data (2000)
Inokuchi, A., Washio, T., Nishimura, K., Motoda, H.: A fast algorithm for mining frequent connected subgraphs. Research Report RT0448 (2002)
Kuramochi, G., Karypis, M.: Frequent subgraph discovery. In: Proceedings IEEE International Conference on Data Mining, 2001, ICDM 2001, pp. 313–320 (2001)
Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD 2004, pp. 647–652 (2004)
Skonieczny, L.: Mining of Unconnected Frequent Graphs with Direct Subgraph Isomorphism Tests. In: ICMMI 2009 (2009)
Ting, R., Bailey, J.: Mining minimal contrast subgraph patterns. In: Jonker, W., Petković, M. (eds.) SDM 2006. LNCS, vol. 4165, pp. 639–643. Springer, Heidelberg (2006)
Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICMD, vol. 00:721 (2002)
Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: KDD 2003, pp. 286–295. ACM , New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skonieczny, Ł. (2011). From Connected Frequent Graphs to Unconnected Frequent Graphs. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2011. Lecture Notes in Computer Science(), vol 6804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21916-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-21916-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21915-3
Online ISBN: 978-3-642-21916-0
eBook Packages: Computer ScienceComputer Science (R0)