[1] 郭崇慧,田凤占. 数据挖掘教程[M]. 北京:清华大学出版社, 2005:107-121.[2]Richard O Duda, Peter E Hart, David G Stork. 模式分类[M]. 2版.李宏东,姚天翔译. 北京:机械工业出版社, 2003:11-12.
[3]周爱武,陈宝楼,王琰. KMeans 算法的研究与改进[J]. 计算机技术与发展, 2012,22(10) :101-104.
[4]孙吉贵,刘杰,赵连宇. 聚类算法研究[J]. 软件学报, 2008,19(1):48-61.
[5]孙甲霞,李学勇. 经典测试理论确定试题难度系数的算法与设计[J]. 中国科技信息, 2009(19):44-45.
[6]李志杰,李元香,王峰,等. 面向大数据流的多任务加速在线学习算法[J]. 计算机研究与发展, 2015,52(11):2545-2554.
[7]Krishma K, Murty M N. Genetic Kmeans algorithm[J]. IEEE Trans. on System,Man, and Cybernetics, Part B,1999,29(3):433-439.
[8]Huang Zhexue. Extensions to the K-means algorithm for clustering large data sets with categorical values[J]. Data Mining and Knowledge Discovery, 1998,2(3):283-304.
[9]胡艺龄,顾小清,赵春. 在线学习行为分析建模及挖掘[J]. 开放教育研究, 2014,20(2):102-110.
[10]Daniel Barbara. Using selfsimilarity to cluster large data sets[J]. Data Mining and Knowledge Discovery, 2003,7(2):123-152.
[11]Modha Dharmendra S, Spangler W Scott. Feature weighting in Kmeans clustering[J]. Machine Learning, 2003,52(3):217-237.
[12]Srinivas M, Patnaik L M. Adaptive probabilities of crossover and mutation in genetic algorithm[J]. IEEE Trans. on Systems, Man and Cybernetics, 2002,24(4):656667.
|