gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm
Abstract & Details
Research Area
Computer Engineering
Keywords
Iterative MapReduce
Graph mining
Frequent subgraph mining
gSpan-H
Abstract
In data mining applications, mining frequent subgraph from a large number of small graphs is an important operation. For extracting frequent subgraphs many algorithms have been proposed. But now a days, graph data grows both in size and quantity, therefore existing methods cannot extract frequent subgraph on a centralized machine. To overcome this some distributed solution using MapReduce is becoming important paradigm for computation on massive data. In experimented work, we investigate how to efficiently perform extraction of frequent subgraph over a large datasets using MapReduce. We propose a frequent subgraph algorithm called as gSpan-H which is iterative MapReduce based framework. This algorithm uses breadth first search strategy. This algorithm is isomorphism testing free approach for efficiently mine frequent subgraph. Our experiments with real life and large synthetic datasets validate the effectiveness of gSpan-H for mining frequent subgraphs from large distributed datasets.
License
This work is licensed under a Creative
Commons
Attribution-ShareAlike 4.0 International License.
Author Information
| # | Name | Institute / Affiliation |
|---|---|---|
| 1 | Mrs. M.H.Sangle | M.C.O.E.R.C |
| 2 | Prof.S.A.Bhavsar | M.C.O.E.R.C |
How to Cite
Use the following formats to cite this article in your research.
APA Style
M.H.Sangle, Mrs. & Prof.S.A.Bhavsar (2016). gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm. International Journal of Advance Research and Innovative Ideas In Education, 2(5), 169-177.
MLA Style
M.H.Sangle, Mrs., and Prof.S.A.Bhavsar. "gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm." International Journal of Advance Research and Innovative Ideas In Education, vol. 2, no. 5, 2016, pp. 169-177.
IEEE Style
Mrs. M.H.Sangle and Prof.S.A.Bhavsar, "gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm," International Journal of Advance Research and Innovative Ideas In Education, vol. 2, no. 5, pp. 169-177, 2016.
Vancouver Style
M.H.Sangle Mrs., Prof.S.A.Bhavsar. gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm. International Journal of Advance Research and Innovative Ideas In Education. 2016;2(5):169-177.
Harvard Style
M.H.Sangle, Mrs. & Prof.S.A.Bhavsar (2016) 'gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm', International Journal of Advance Research and Innovative Ideas In Education, 2(5), pp. 169-177.
Chicago Style
M.H.Sangle, Mrs. and Prof.S.A.Bhavsar. "gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm." International Journal of Advance Research and Innovative Ideas In Education 2, no. 5 (2016): 169-177.
Turabian Style
M.H.Sangle, Mrs. and Prof.S.A.Bhavsar. "gSpan-H: An Iterative MapReduce Based Frequent Subgraph Mining Algorithm." International Journal of Advance Research and Innovative Ideas In Education 2, no. 5 (2016): 169-177.
Related Research
A Brief Review of Performance Evaluation of Global and Local Image Thresholding Based on Computational Efficiency
Download PDF
Performance Evaluation of Global and Local Image Thresholding Based on Computational Efficiency
Download PDF
Enhancing Handwritten Alpha-Numeral Recognition Using GAN-Based Synthetic Data Generation
Download PDF
Comprehensive Review of Existing Chatbot Systems for Career Assistance, Resume Support, and ATS-Aware Guidance
Download PDF
Development of an AI-Powered Multimodal Web Assistant with Intelligent Resume Building and ATS Enhancement
Download PDF
A Deep Learning-Based Framework for Mood-Oriented Music Recommendation Using Facial Expression Analysis
Download PDF