[1]王煜,王正欧,白石.用于文本分类的改进KNN算法[J].中文信息学报,2007,21(3):76-81.[2]刘海峰,张学仁,姚泽清,等. 基于类别选择的改进KNN文本分类[J]. 计算机科学,2009,36(11):213-216.[3]PAWLAK Z. Rough sets[J].International Journal of Computer Information Science, 1982, 11(5):341-356.[4]MARTINEZ A M, KAK A C. PCA versus LDA[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001,23(2):228-233.[5]李荣陆.基于密度的KNN文本分类器训练样本的裁剪方法[J].计算机研究与发展,2004,41(4):539-545.[6]张孝飞,黄河燕.一种采用聚类技术改进的KNN文本分类方法[J].模式识别与人工智能, 2009,22(6):936-940.[7]胡燕,吴虎子,钟珞.基于改进的KNN算法的中文网页自动分类方法研究[J].武汉大学学报:工学版,2007, 40(4): 141-144.[8]DEBOLE F, SEBASTIANI F. An analysis of the relative hardness of reuters-21578 subsets[J].Journal of the American Society for Information Science and Technology,2004,56(6):584-596.[9]BARBARA D, LI Y, COUTO J. COOLCAT: An entropy-based algorithm for categorical clustering[C]// Proceedings of the 11th International Conference on Information and Knowledge Management. New York: ACM, 2002: 582.[10]VRIES A D, MAMOULIS N, NES N, et al. Efficient KNN search on vertically decomposed data[C]// Proceedings of the 2002 ACMSIGMOD International Conference on Management of Data. New York: ACM,2002:322-333. |