Comparison of K-means and Modified K-mean algorithms for Large Data-set
暂无分享,去创建一个
[1] Friedrich Leisch,et al. Extending Standard Cluster Algorithms to Allow for Group Constraints , 2006 .
[2] Qiang Wang,et al. Fuzzy Clustering Algorithm Based on Tree for Association Rules , 2006 .
[3] Huan Liu,et al. Subspace clustering for high dimensional data: a review , 2004, SKDD.
[4] David A. Landgrebe,et al. A survey of decision tree classifier methodology , 1991, IEEE Trans. Syst. Man Cybern..
[5] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[6] Agma J. M. Traina,et al. An Efficient Approach to Scale up k-medoid based Algorithms in Large Databases , 2006, SBBD.
[7] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[8] Joshua Zhexue Huang,et al. A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining , 1997, DMKD.
[9] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[10] W. Loh,et al. REGRESSION TREES WITH UNBIASED VARIABLE SELECTION AND INTERACTION DETECTION , 2002 .
[11] Tobias Scheffer,et al. Scalable look-ahead linear regression trees , 2007, KDD '07.