Computer Science ›› 2015, Vol. 42 ›› Issue (3): 195-200.doi: 10.11896/j.issn.1002-137X.2015.03.040
Previous Articles Next Articles
NI Zhi-wei, JING Ting-ting and NI Li-ping
| [1] Jain A K.Data clustering:50 years beyond K-means[J].Pattern Recognition Letters,2010,31(8):651-666 [2] Shang Fan-hua,Jiao L C,Shi Jia-rong,et al.Fast affinity propagation clustering:A multilevel approach[J].Pattern Recognition,2012,5(2012):474-486 [3] Vlasblom J,Ahoshana J W.Markov clustering versus affinitypropagation for thpartitioning of protein interaction graphs[J].BMC Bioinformatics,2009(10):99-113 [4] Paccanaro A,Casbon J A,Saqi M A S.Spectral clustering ofprotein sequences[J].Nucleic Acids Research,2006,4(5):1571-1580 [5] Wang Kai-jun,Zhang Jun-ying,Li Dan,et al.Adaptive affinity propagation clustering[J].Acta Automatica Sinica,2007,3(12):1242-1246 [6] Karen K.Affinity program slashes computing times.2007-10-25.http://www.news.utoronto.ca/bin6/070215-2952.asp [7] Bodenhofer U,Kothmeier A,Hochreiter S.APCluster:an Rpackage for affinity propagation clustering[J].Bioinformatics,2011,27(17):2463-2464 [8] Guha S,Rastogi R,Shim K.CURE:an efficient clustering algorithm for large databases[J].ACM SIGMOD Record,ACM,1998,27(2):73-84 [9] Ertoz L,Steinbach M,Kumar V.A new shared nearest neighborclustering algorithm and its applications[C]∥Workshop on Clustering High Dimensional Data and its Applications at 2nd SIAM International Conference on Data Mining.2002:105-115 [10] J Fray B J,Dueck D.Clustering by Passing Messages Between Data Points[J].Science,2007,315(5814):972-976 [11] Hsu D,Kakade S M,Zhang Tong.A spectral algorithm forlearning hidden Markov models[J].Journal of Computer and System Sciences,2012,78(5):1460-1480 [12] Powers D M W.Evaluation:from precision,recall and F-measure to ROC,informedness,markedness & correlation[J].Journal of Machine Learning Technologies,2011,2(1):37-63 [13] Rawashdeh M,Ralescu A.Crisp and fuzzy cluster validity:ge-neralized intra-inter silhouette index[C]∥2012Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS).IEEE,2012:1-6 [14] Guan R,Shi X,Marchese M,et al.Text clustering with seeds affinity propagation[J].IEEE Transactions on Knowledge and Data Engineering,2011,23(4):627-637 [15] Kazantseva A,Szpakowicz S.Linear text segmentation using affinity propagation[C]∥Proceedings of the Conference on Empirical Methods in Natural Language Processing.Association for Computational Linguistics,2011:284-293 [16] Patidar A K,Agrawal J,Mishra N.Analysis of Different Similarity Measure Functions and their Impacts on Shared Nearest Neighbor Clustering Approach[J].International Journal of Computer Applications,2012,40(16):1-5 [17] Lee S S,Lin J C.An accelerated K-means clustering algorithm using selection and erasure rules[J].Journal of Zhejiang University SCIENCE C,2012,13(10):761-768 [18] 鲁伟明,杜晨阳,魏宝刚,等.基于MapReduce的分布式近邻传播聚类算法[J].计算机研究与发展,2012,9(8):1762-1772 [19] 唐东明,朱清新,杨凡,等.一种有效的蛋白质序列聚类分析方法[J].软件学报,2011,2(8):1872-1837 [20] 沈洁,赵雷,杨季文,等.一种基于划分的层次聚类算法[J].计算机工程与应用,2007,43(31):175-177 [21] 王开军,李健,张军英,等.半监督的仿射传播聚类[J].计算机工程,2007,33(23):197-198 [22] 邢艳,周勇.基于互近邻一致性的近邻传播算法[J].计算机应用研究,2012,9(7):2524-2526 |
| No related articles found! |
|
||
Home