International Journal of Computer Engineering in Research Trends

Back to Current Issues

A Comparative Study of Discovering Frequent Subgraphs â€“ Approaches and Techniques

B.Senthilkumaran, Dr.K.Thangadurai, , ,

Affiliations
P.G. and Research,Department of Computer Science, Government Arts College (Autonomous), Karur-05.

:-NA-

Abstract

Graph mining is an important research vertical and recently the usage of graphs has become increasingly imperative in modeling problematic complex structures such as electrical circuits, chemical compounds, protein structures, bioinformatics, social networks, workflow diagrams, and XML documents. 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.

Citation

B.Senthilkumaran, Dr.K.Thangadurai, â€œA Comparative Study of Discovering Frequent Subgraphs â€“ Approaches and Techniquesâ€, International Journal Of Computer Engineering In Research Trends, 4(1):41-45, January-2017. [InnoSpace-2017:Special Edition]

Keywords : Graph, Mining, complex structure, techniques, modelling

References

1] Chen, M.S., Han,J.and Yu,P.S. 1996 Data mining â€“ An overview from database perspective, IEEE Transaction on knowledge and data engineering 8 , 866-883
[2] Alm, E. and Arkin, A.P. 2003. Biological Networks, Current Opinion in Structural Biology 13(2), 193â€“ 202.
[3] Nijssen, S. and Kok, J., Faster association rules for multiple relations. In IJCAIâ€™01:  Seventeenth International Joint Conference on Artificial Intelligence, 2001, vol. 2, pp. 891â€“896.
[4] Chuntao Jiang, Frans Coenen and Michele Zito, A Survey of Frequent Sub-graph Mining Algorithms:The Knowledge Engineering Review, Vol. 00:0, 1â€“31.c 2004.
[5] A. Inokuchi, T.Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDDâ€™00.
[6] J. Huan, W.Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. UNC computer science technique report TR03-021, 2003.  
[7] J. Huan, W. Wang, J. Prins, and J. Yang. Spin: Mining maximal frequent sub-graphs from graph databases. UNC Technical Report TR04-018, 2004.  
[8] M. Kuramochi and G. Karypis. Grew-a scalable frequent subgraph discovery algorithm. In ICDM, pages 439â€“442,2004.
[9] ZhaonianZou, Jianzhong Li, Hong Gao, and Shuo Zhang : Frequent Subgraph Patterns from Uncertain Graph Data. IEEE Transactions On Knowledge And Data Engineering, Vol. 22, No. 9, September 2010.
[10] L. T. Thomas, S. R. Valluri, and K. Karlapalem. Margin:Maximal frequent subgraph mining. Proc. 6th IEEE Intâ€™l Conf. Data mining (ICDM â€™06), pp. 1097-1101, 2006.
[11] Inokuchi, A., Washio, T., Nishimura, K. and Motoda, H. 2002. A Fast Algorithm for Mining Frequent Connected Subgraphs, Technical Report RT0448, IBM Research, Tokyo Research Laboratory, Japan.
[12] Huan, J., Wang, W. and Prins, J. 2003. Eï¬ƒcient Mining of Frequent Subgraph in the Presence of Isomorphism, In Proceedings of the 2003 International Conference on Data Mining, 549-552.

DOI Link : NA

Download :

20170109.pdf

Refbacks : There are currently no refbacks

Announcements

Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :

☞ LAST DATE OF SUBMISSION : 31st March 2023

☞ SUBMISSION TO FIRST DECISION : In 7 Days

☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices	All
Citations	1026
h-index	14
i10-index	20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year	Rate
2021	10.8%
2020	13.6%
2019	15.9%
2018	14.5%
2017	16.6%
2016	15.8%
2015	18.2%
2014	20.6%

 Conference Proposal

 Peer Review

 Digital Library

 Register here

 Conference Proposal

 Special Issue Proposal

 Conference Proposal Guidelines

 Upcoming Conference

DOI:10.22362/ijcert

Welcome to IJCERT