Constraint-Based Graph Mining in Large Database
暂无分享,去创建一个
Chen Wang | Wei Wang | Baile Shi | Tianyi Wu | Yongtai Zhu
[1] Wei Wang,et al. Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.
[2] Laks V. S. Lakshmanan,et al. Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.
[3] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[4] Jian Pei,et al. Mining sequential patterns with constraints in large databases , 2002, CIKM '02.
[5] Jian Pei,et al. Can we push more constraints into frequent pattern mining? , 2000, KDD '00.
[6] Ramakrishnan Srikant,et al. Mining Association Rules with Item Constraints , 1997, KDD.
[7] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[8] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[9] Chen Wang,et al. Scalable mining of large disk-based graph databases , 2004, KDD.
[10] Laks V. S. Lakshmanan,et al. Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.
[11] Kyuseok Shim,et al. SPIRIT: Sequential Pattern Mining with Regular Expression Constraints , 1999, VLDB.
[12] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.