Email this article A New Text Clustering Method Based on KSEP
Abstract
Text clustering is one of the key research areas in data mining. k-medoids algorithm is a classical division algorithm, and can solve the problem of isolated points, But it often converges to local optimum. This article presents a improved social evolutionary programming(K-medoids Social Evolutionary Programming,KSEP). The algorithm is the k-medoids algorithm as the main cognitive reasoning algorithm. and Improved to learning of Paradigm、Optimal paradigm strengthening and attenuation and Cognitive agent betrayal of paradigm. This algorithm will increase the diversity of species group and enhance the optimization capability of social evolutionary programming, thus improve the accuracy of clustering and the capacity of acquiring isolated points.
Keywords
References
[1] Yu Yixin, Zhang Hongpeng. A social cognition model applied to general combination optimization problem. Proceedings of the first international conference on machine learning and cybernetics, November4-5,2002 Beijing China,1208~1213.
[2] S︳ebastien Picault, Anne Collinot, Designing Social Cognition Models for Multi-Agent Systems through Simulating Primate Societies,Proceedings of ICMAS98(3rd International Conference on Multi-Agent Systems),1998,238~245.
[3] HAO Zhangang, Building Text Knowledge Map for P -roduct Development based on CSEP Method, 2009 International Conference on Computer Network and Multimedia Technology,2009, 12 : 1081-1085.
[4] HAO Zhangang,YANG Jianhua, Building Knowledge M -ap for Product Development based on GAKME Method. The Second International Workshop on Education Technology and Computer 2010,3:696-699.
http://dx.doi.org/10.1109/ETCS.2010.567
[5] XU Sen, LU Zhi-mao,GU Guo-chang, Spectral clustering algorithms for docu -ment cluster ensemble problem[J], Journal on Communications, 2010, Vol. 31 No.6,58-66.
[6] DHILLON I S, MODHA D S. Concept decompositions for large sparse text data using clustering[J]. Macliine Learning, 2001, 42(1-2):143-175.
[7] Guan Renchu,Pei Zhili,Shi Xiaohu,Yank Chen,and Liana Yanchun, Weight Affinity Propagation and Its Application to Text Clustering[J], Journal of Cor -mputer Research and DeveloprnenL, 2010,47(10), 1733- 1740.
[8] PENG Jing, YANG Dons-Qin, TANG Shi-Wei, FU Yan, JIANG Han-Kui, A Novel Text Clustering Algorithm Based on Inner Product Space Model of Semantic[J], CHINESE JOURNAL OF COMPUTERS, 2007, 30 (8),1354-1362.
[9] Hamerly G, Elkan C.Learning the k in k-means // Pm -ceedalgs of the 17th Annual Conference on 1eural hlfamatiou Pmcessalg Svstmls(NIPS).2003,281-289.
[10] WagstaffK, Cardie C,Rogers S, Schroedl S Constranied K-mearns clustering with background knowledge In Brodley CE, Danyluk AP, eds. Proc of the 18th Int 1 Conf on Machine Learning[M].William stow M organ Kauf m ann Publishers 2001.577-584.
[11] Tao Li Docunent clustering via Adaptive Suhspace lt -eration[ A]. In proceedings of the 12th ACM international Conference on Multimedia[C]. New York ACM Publisher 2004 364- 367.
[12] Zhu Ming, Data Ming,HeFei:China Science and Tec -hnology University Press, 2002,129-164.
[13] G. Forestier, P. Ganrski, C. Wemmert. Collaborative clustering with background knowledge [J]. Data & Knowledge Engineering,2010,69(02):211-228.
http://dx.doi.org/10.1016/j.datak.2009.10.004
[14] Wen Zhang a, Taketoshi Yoshida b, Xijin Tang c, Qing Wanga,Text clustering using frequent itemsets[J], Knowledge-Based Systems,2010,23(5),379-388.
[15] Linghui Gong, Jianping Zeng, Shiyong Zhang,Text stream clustering algorithm based on adaptive feature selection[J], Expert Systems with Applications, 2011, 38 (3),1393-1399.
http://dx.doi.org/10.1016/j.eswa.2010.07.041
[16] Argyris Kalogeratos, Aristidis Likas,Document cluste -ring using synthetic cluster prototypes[J], Data & Knowledge Engineering, 2011,70(3), 284-306.
http://dx.doi.org/10.1016/j.datak.2010.12.002
Full Text: PDF