Graph clustering based on structural similarity of fragments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3847 LNAI, Issue , 2006, Pages 97-114

  Yoshida, Tetsuya ^a   Shoda, Ryosuke ^b   Motoda, Hiroshi ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ENTERPRISE RESOURCE PLANNING; GRAPH THEORY; USER INTERFACES;

FRAGMENT SPECTRUM; GRAPH CLUSTERING; GRAPH-STRUCTURED DATA; RESOURCE COMBINATIONS;

WORLD WIDE WEB;

EID: 33745126250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605126_6     Document Type: Conference Paper

References (20)

1. L.A.N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences, 97(21):11149-11152, 2000.
2. S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan Kaufmann, 2002.
3. P. Clark and Niblett T. The cn2 induction algorithm. Machine Learning, 3:261-283, 1989.
4. D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32-41, 2000.
5. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compound. In Proc. the 4th International conference on Knowledge Discovery and Data Mining, pages 30-36, 1998.
6. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data, Machine Learning, 50(3):321-354, 2003.
7. M. Kuramochi and G.Karypis. Frequent subgraph discovery. In Proc. of the 1st IEEE ICDM, pages 313-320, 2001.
8. T. Matsuda, H. Motoda, T. Yoshida, and T. Washio. Mining patterns from structured data by beam-wise graph-based induction. In Proc. of The Fifth International Conference on Discovery Science, pages 422-429, 2002.
9. T. Matsuda, T. Yoshida, H. Motoda, and T. Washio. Beam-wise graph-based induction for structured data mining. In International Workshop on Active Mining (AM-2002): working notes, pages 23-30, 2002.
10. R. S. Michalski. Learning flexible concepts: Fundamental ideas and a method based on two-tiered representaion. Machine Learning: An Artificial Intelligence Approach, 3:63-102, 1990.
11. S. Muggleton and L. de Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19(20):629-679, 1994.
12. S. Nomura, T. Miki, and T. Ishida. Comparative Study of Web Citation Analysis and Bibliographical Citation Analysis in Community Mining. IEICE Transaction, J87-D-I(3):382-389, 2004. (in Japanese).
13. C.R. Palmer, P.B. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs, In Proc. of the KDD-2002, 2002.
14. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
15. J. R. Quinlan. C4-5:Programs For Machine Learning. Morgan Kaufmann Publishers, 1993.
16. J.W. Raymond, C.J. Blankley, and P. Willett. Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. Molecular Graphics and Modelling, 21(5):421-433, 2003.
17. Y. Takahashi, H. Ohoka, and Y. Ishiyama. Structural similarity analysis based on topological fragement spectra. Adavances in Molecular Similarity, 2:93-104, 1998.
18. D.J. Watts. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, 2004.
19. D.J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.
20. T. Yoshida, G. Warodom, A. Mogi, K. Ohara, H. Motoda, T. Washio, H. Yokoi, and K. Takabayashi. Preliminary analysis of interferon therapy by graph-based induction. In Working note of International Workshop on Active Mining (AM-2004), pages 31-40, 2004.