Text clustering approach based on maximal frequent term sets
暂无分享,去创建一个
[1] Benjamin C. M. Fung,et al. Hierarchical Document Clustering using Frequent Itemsets , 2003, SDM.
[2] Hujun Yin,et al. Self-Organising Maps for Hierarchical Tree View Document Clustering Using Contextual Information , 2002, IDEAL.
[3] Ichigaku Takigawa,et al. A Probabilistic Model for Clustering Text Documents with Multiple Fields , 2007, ECIR.
[4] Martin Ester,et al. Frequent term-based text clustering , 2002, KDD.
[5] G. Grahne,et al. High Performance Mining of Maximal Frequent Itemsets Gösta , 2003 .
[6] George Karypis,et al. A Comparison of Document Clustering Techniques , 2000 .
[7] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[8] Gad M. Landau,et al. Fast Parallel and Serial Approximate String Matching , 1989, J. Algorithms.
[9] Bart Goethals,et al. Survey on Frequent Pattern Mining , 2003 .
[10] Vipin Kumar,et al. WebACE: a Web agent for document categorization and exploration , 1998, AGENTS '98.
[11] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.