Graph mining with variational dirichlet process mixture models

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 1, Issue , 2008, Pages 432-442

  Tsuda, Koji ^a   Kurihara, Kenichi ^b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; DATA HANDLING; FREE ENERGY;

BINARY FEATURE VECTOR; DIRICHLET PROCESS MIXTURE MODEL; FREQUENT SUBGRAPH MINING; GRAPH KERNELS; HIGH DIMENSIONALITY; NONPARAMETRIC BAYESIAN METHODS; TREE PRUNING; VARIATIONAL INFERENCE;

DATA MINING;

EID: 52649090208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.39     Document Type: Conference Paper

References (17)

1. D.M. Blei and M.I. Jordan. Variational inference for Dirichlet process mixtures. Bayesian Analysis, 1(1):121-144, 2005.
2. B. Bringmann, A. Zimmermann, L. D. Raedt, and S. Nijssen. Don't be afraid of simpler patterns. In 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), pages 55-66, 2006.
3. H.Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In 23rd International Conference on Data Engineering, 2007.
4. C. Helma, T. Cramer, S. Kramer, and L.D. Raedt. Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. J. Chem. Inf. Comput. Sci., 44:1402-1411, 2004.
5. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In T. Faucett and N. Mishra, editors, Proceedings of the 20th International Conference on Machine Learning, pages 321-328, Menlo Park, CA, AAAI Press, 2003.
6. J. Kazius, S. Nijssen, J. Kok, and T. Back A.P. Ijzerman. Substructure mining using elaborate chemical representation. J. Chem. Inf. Model, 46:597-605, 2006.
7. S. Kim, M.G. Tadesse, and M. Vannucci. Variable selection in clustering via Dirichlet mixture models. Biometrika, 93(4):877-893, 2006.
8. K. Kurihara, M. Welling, and N. Vlassis. Accelerated variational Dirichlet process mixtures. In NIPS 19, 2007.
9. A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern., 13:353-362, 1983.
10. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
11. J. Sethuraman. A constructive definition of Dirichlet priors. Statistica Sinica, 4:639-650, 1994.
12. K. Tsuda and T. Kudo. Clustering graphs by weighted substructure mining. In W.W. Cohen and A. Moore, editors, Proceedings of the 23rd International Conference on Machine Learning (ICML), pages 953-960. ACM Press, 2006.
13. F. Valente and C. Wellekens. Variational Bayesian feature selection for Gaussian mixture models. In ICASSP'04, volume 1, pages 513-516, 2004.
14. T. Washio and H. Motoda. State of the art of graphbased data mining. SIGKDD Explorations, 5(1):59-68, 2003.
15. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM), pages 721-724. IEEE Computer Society, 2002.
16. X. Yan and J. Han. gSpan: graph-based substructure pattern mining. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 2002.
17. Y. Zhao and G. Karypis. Criterion functions for document clustering: Experiments and analysis. Technical Report #01-40, Department of Computer Science, University of Minnesota, 2001.