A Comparative Study of Discovering Frequent Subgraphs – Approaches and Techniques
Main Article Content
Abstract
Graph mining is an important research vertical, and recently, graphs have become increasingly imperative in modeling problematic complex structures such as electrical circuits, chemical compounds, protein structures, bioinformatics, social networks, workflow diagrams, and XML documents. A Plethora of graph mining algorithms has been developed, and the primary objective of this
paper is to present a detailed survey regarding the approaches and techniques employed to find the issues and complexities involved.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
Chen, M. S., Han, J., & Yu, P. S. (1996). Data mining – An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering, 8, 866-883.
Alm, E., & Arkin, A. P. (2003). Biological Networks. Current Opinion in Structural Biology, 13(2), 193-202.
Nijssen, S., & Kok, J. (2001). Faster association rules for multiple relations. In IJCAI’01: Seventeenth International Joint Conference on Artificial Intelligence (Vol. 2, pp. 891-896).
Chuntao Jiang, Frans Coenen, & Michele Zito (2004). A Frequent Sub-graph Mining of Survey Algorithms: The Knowledge Engineering Review, Vol. 00:0, 1–31.c 2004.
Inokuchi, A., Washio, T., & Motoda, H. (2000). An apriori-based algorithm for mining frequent substructures from graph data. In PKDD’00.
Huan, J., Wang, W., & Prins, J. (2003). Efficient mining of frequent subgraphs in the presence of isomorphism. UNC computer science technique report TR03-021.
Huan, J., Wang, W., Prins, J., & Yang, J. (2004). Spin: Mining maximal frequent sub-graphs from graph databases. UNC Technical Report TR04-018.
Kuramochi, M., & Karypis, G. (2004). Grew-a scalable frequent subgraph discovery algorithm. In ICDM, pages 439–442.
Zou, Z., Li, J., Gao, H., & Zhang, S. (2010). Frequent Subgraph Patterns from Uncertain Graph Data. IEEE Transactions On Knowledge And Data Engineering, 22(9), September 2010.
Thomas, L. T., Valluri, S. R., & Karlapalem, K. (2006). Margin: Maximal frequent subgraph mining. Proc. 6th IEEE Int’l Conf. Data mining (ICDM ’06), pp. 1097-1101.
Inokuchi, A., Washio, T., Nishimura, K., & Motoda, H. (2002). A Fast Algorithm for Mining Frequent Connected Subgraphs. Technical Report RT0448, IBM Research, Tokyo Research Laboratory, Japan.
Huan, J., Wang, W., & Prins, J. (2003). Efficient Mining of Frequent Subgraph in the Presence of Isomorphism. In Proceedings of the 2003 International Conference on Data Mining, 549-552.