Monkey: Approximate Graph Mining Based on Spanning Trees
暂无分享,去创建一个
[1] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[2] Joost N. Kok,et al. A quickstart in frequent structure mining can make a difference , 2004, KDD.
[3] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[4] Ke Wang,et al. Discovering Frequent Substructures from Hierarchical Semi-structured Data , 2002, SDM.
[5] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[6] J. Rothberg,et al. Gaining confidence in high-throughput protein interaction networks , 2004, Nature Biotechnology.
[7] Wei Wang,et al. Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.
[8] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[9] Lawrence B. Holder,et al. Substucture Discovery in the SUBDUE System , 1994, KDD Workshop.
[10] Wojciech Szpankowski,et al. An efficient algorithm for detecting frequent subgraphs in biological networks , 2004, ISMB/ECCB.
[11] Jiong Yang,et al. SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.