CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on Assorted Approaches to Graph Data Mining

by D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 14 - Number 1
Year of Publication: 2011
Authors: D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu
10.5120/1806-2294

D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu . A Survey on Assorted Approaches to Graph Data Mining. International Journal of Computer Applications. 14, 1 ( January 2011), 43-46. DOI=10.5120/1806-2294

@article{ 10.5120/1806-2294,
author = { D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu },
title = { A Survey on Assorted Approaches to Graph Data Mining },
journal = { International Journal of Computer Applications },
issue_date = { January 2011 },
volume = { 14 },
number = { 1 },
month = { January },
year = { 2011 },
issn = { 0975-8887 },
pages = { 43-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume14/number1/1806-2294/ },
doi = { 10.5120/1806-2294 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:02:19.255194+05:30
%A D. Kavitha
%A B.V. Manikyala Rao
%A V.Kishore Babu
%T A Survey on Assorted Approaches to Graph Data Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 14
%N 1
%P 43-46
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Graph mining has become a popular area of research in recent years because of its numerous applications in a wide variety of practical fields, including computational biology, sociology, software bug localization, keyword search, and computer networking. Different applications result in graphs of different sizes and complexities. Graph mining is an important tool to transform the graphical data into graphical information. We investigate recurring patterns in real-world graphs, to gain a deeper understanding of their structure. We can extract normal and abnormal subgraphs thereby detecting suspicious nodes and outliers in the existing graphs. In this paper we present a survey of various approaches to mine the graphs. These are used to extract patterns, trends, classes, and clusters from graphs.

References
  1. Mining Graph Data – Diane J Cook, Lawrence B Holder – 2007 pages.
  2. Subdue -- D. J. Cook and L. B. Holder. Substructure discovery using minimum escription length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231–255, 1994.
  3. Gbi -- T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. In PAKDD, pages 420–431, 2000.
  4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of 1994 International Conference Very Large Data Bases (VLDB’94), pp. 487–499, Santiago, Chile, Sept. 1994
  5. B-Gbi--T. Matsuda, H. Motoda, T. Yoshida, and T. Washio. Mining patterns from structured data by beam-wise graph-based induction. In Proceedings of the 5th International Conference on Discovery ScienceDiscoveery (DS 2002), Vol. 2534 of Lecture Notes in Computer Science, pp. 422–429. Springer, 2002
  6. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD’00), pp. 1–12, Dallas, TX, May 2000.
  7. S. Muggleton, ed. Inductive Logic Programming. Academic, London, 1992. S. Muggleton. Stochastic logic programs. In L. de Raedt, ed. Advances in Inductive Logic Programming. IOS Press, Amsterdam, 1996.
  8. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of 2000 European Symposium Principle of Data Mining and Knowledge Discovery (PKDD’00), pp. 13–23, Lyon, France, Sept 2000
  9. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of 2001 International Conference on Data Mining (ICDM’01), pp. 313–320, San Jose, CA, Nov. 2001.
  10. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In Proceedings of 2002 International Conference on Data Mining (ICDM’02), pp. 458–465, Maebashi, Japan, Dec. 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Data Mining Graph Mining Sub Graph Frequent Sub Graph

Powered by PhDFocusTM