Database Reference
In-Depth Information
14. L. Dehaspe, H. Toivonen, and R. King. Finding frequent substructures in chemical compounds.
In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98) , pages 30-36, 1998.
15. M. Deshpande,
M. Kuramochi,
N. Wale,
and G. Karypis.
Frequent substructure-based
approaches for classifying chemical compounds.
IEEE Trans.
on Knowledge and Data
Engineering , 17:1036-1050, 2005.
16. M. Fiedler and C. Borgelt. Support computation for mining frequent subgraphs in a single
graph. In Proc. 5th Int. Workshop on Mining and Learning with Graphs (MLG'07) , 2007.
17. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an
application to boosting. In Proc. 2nd European Conf. Computational Learning Theory , pages
23-27, 1995.
18. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs.
In VLDB , pages 721-732, 2005.
19. H. He and A. K. Singh. Efficient algorithms for mining significant substructures in graphs with
quality guarantees. In Proc. 2007 Int. Conf. Data Mining (ICDM'07) , pages 163-172, 2007.
20. L. B. Holder, D. J. Cook, and S. Djoko. Substructure discovery in the subdue system. In Proc.
AAAI'94 Workshop Knowledge Discovery in Databases (KDD'94) , pages 169-180, 1994.
21. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of
isomorphism. In Proc. 2003 Int. Conf. Data Mining (ICDM'03) , pages 549-552, 2003.
22. J. Huan, W. Wang, D. Bandyopadhyay, J. Snoeyink, J. Prins, and A. Tropsha. Mining spa-
tial motifs from protein structure graphs. In Proc. 8th Int. Conf. Research in Computational
Molecular Biology (RECOMB) , pages 308-315, 2004.
23. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: Mining maximal frequent subgraphs from
graph databases. In Proc. 2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases
(KDD'04) , pages 581-586, 2004.
24. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent sub-
structures from graph data. In Proc. 2000 European Symp. Principle of Data Mining and
Knowledge Discovery (PKDD'00) , pages 13-23, 1998.
25. R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. Agrawal. Discovering frequent topo-
logical structures from graph datasets. In Proc. 2005 ACM SIGKDD Int. Conf. Knowledge
Discovery in Databases (KDD'05) , pages 606-611, 2005.
26. R. Jin, L. Liu, and C. C. Aggarwal. Discovering highly reliable subgraphs in uncertain graphs.
In KDD , pages 992-1000, 2011.
27. M. Koyuturk, A. Grama, and W. Szpankowski. An efficient algorithm for detecting frequent
subgraphs in biological networks. Bioinformatics , 20:I200-I207, 2004.
28. T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In
Advances in Neural Information Processing Systems 18 (NIPS'04) , 2004.
29. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. 2001 Int. Conf. Data
Mining (ICDM'01) , pages 313-320, 2001.
30. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Mining
and Knowledge Discovery , 11:243-271, 2005.
31. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In Proc.
2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'04) , pages 647-652,
2004.
32. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan:
Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. 2001 Int.
Conf. Data Engineering (ICDE'01) , pages 215-224, 2001.
33. S. Ranu and A. K. Singh. GraphSig: A scalable approach to mining significant subgraphs in
large graph databases. In Proc. 2009 Int. Conf. Data Engineering (ICDE'09) , pages 844-855,
2009.
34. H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In Proc.
2008 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'08) , pages 578-586,
2008.
35. L. Thomas, S. Valluri, and K. Karlapalem. MARGIN: Maximal frequent subgraph mining. In
Proc. 2006 Int. Conf. on Data Mining (ICDM'06) , pages 1097-1101, 2006.
Search WWH ::




Custom Search