skip to main content
article

State of the art of graph-based data mining

Authors Info & Claims
Published:01 July 2003Publication History
Skip Abstract Section

Abstract

The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. It can therefore be no surprise that graph based data mining has become quite popular in the last few years.This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining. Brief descriptions of some representative approaches are provided as well.

References

  1. MRDM'01: Workshop multi-relational data mining. In conjunction with PKDD'01 and ECML'01, 2002. http://www.kiminkii.com/mrdm/.Google ScholarGoogle Scholar
  2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94: Twentyth Very Large Dada Base Conference, pages 487--499, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Cook and L. Holder. Substructure discovery using minimum description length and background knowledge. J. Artificial Intel. Research, 1 :231--255, 1994.Google ScholarGoogle Scholar
  4. L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In IJCAI'01: Seventeenth International Joint Conference on Artificial Intelligence, volume 2, pages 853--859, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Debnath, R. De Compadre, G. Debnath, A. Schusterman, and C. Hansch. Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. J. Medicinal Chemistry, 34, 1991.Google ScholarGoogle Scholar
  6. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery, 3(1):7--36, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. Gaertner. A survey of kernels for structured data. SIGKDD Explorations, 5(1), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Geamsakul, T. Matsuda, T. Yoshida, H. Motoda, and T. Washio. Classifier construction by graph-based induction for graph-structured data. In PAKDD'03: Proc. of 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, LNAI2637, pages 52--62, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Geibel and F. Wysotzki. Learning relational concepts with decision trees. In ICML'96: 13th Int. Conf. Machine Learning, pages 166--174, 1996.Google ScholarGoogle Scholar
  10. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58--64, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50:321--354, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. I. Jonyer, L. Holder, and D. Cook. Concept formation using graph grammars. In Workshop Notes: MRDM 2002 Workshop on Multi-Relational Data Mining, pages 71--792, 2002.Google ScholarGoogle Scholar
  13. H. Kashima and A. Inokuchi. Kernels for graph classification. In AM2002: Proc. of Int. Workshop on Active Mining, pages 31--35, 2002.Google ScholarGoogle Scholar
  14. R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete input space. In ICML'02: Nineteenth International Joint Conference on Machine Learning, pages 315--322, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM'01: 1st IEEE Conf. Data Mining, pages 313--320, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Liquiere and J. Sallantin. Structural machine learning with galois lattice and graphs. In ICML'98: 15th Int. Conf. Machine Learning, pages 305--313, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. H. Mannila and H. Toivonen. Discovering generalized episodes using minimal occurrences. In 2nd Intl. Conf. Knowledge Discovery and Data Mining, pages 146--151, 1996.Google ScholarGoogle Scholar
  18. B. Mckay. Nauty users guide (version 1.5). Technical Report Technical Report, TR-CS-90-02, Department of computer Science, Australian National University, 1990.Google ScholarGoogle Scholar
  19. A. Mendelzon, A. Mihaila, and T. Milo. Querying the world wide web. Int. J. Digit. Libr., 1:54--67, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  20. S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. J. Logic Programming, 19(20):629--679, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  21. S. Nijssen and J. Kok. Faster association rules for multiple relations. In IJCAI'01: Seventeenth International Joint Conference on Artificial Intelligence, volume 2, pages 891--896, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. A. Srinivasan, R. King, and D. Bristol. An assessment of submissions made to the predictive toxicology evaluation challenge. In IJCAI'99: Proc. of 16th International Joint Conference on Artificial Intelligence, pages 270--275, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. V. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, New York., 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM'02: 2nd IEEE Conf. Data Mining, pages 721--724, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. K. Yoshida, H. Motoda, and N. Indurkhya. Graphbased induction as a unified learning framework. J. of Applied Intel., 4:297--328, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  26. M. Zaki. Efficiently mining frequent trees in a forest. In 8th Intl. Conf. Knowledge Discovery and Data Mining, pages 71--80, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. State of the art of graph-based data mining
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader