参考文献/References:
[1] DAVIES S,MOORE A.Bayesian networks for lossless dataset compression[C]//Proceeding of International Conference Knowledge Discovery and Data Mining.San Diego:ACM Press,2013:387-391.
[2] 喻小光,陈维斌,陈荣鑫.一种数据规约的近似挖掘方法的实现[J].华侨大学学报(自然科学版),2008,29(3):370-374.
[3] MERETAKIS D,WUTHRICH B.Extending na?ve bayes classifiers using long item sets[C]//Proceeding of International Conference Knowledge Discovery and Data Mining.San Diego:ACM Press,2013:165-174.
[4] ESPOSITO F,MALERBA D,SEMERARO G,et al.A comparative analysis of methods for pruning decision trees[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2014,19(5):476-491.
[5] LAM S L Y,LEE D L.Feature reduction for neural network based text categorization[C]//Digital Symposium Collection of 6th International Conference on Database System for Advanced Application.[S.l.]:IEEE Press,2015:1121-1130.
[6] CESTNIK B,BRATKO I.On estimating probabilities in tree pruning, machine learning: EWSL-91[C]//Kodratoff Lecture Notes in Artificial Intelligence.Berlin:Springer,2015:138-150.
[7] ANDROUTSOPOULOS G,PALIOURAS V,KARKALETSIS G,et al.Learning to filter spam e-mail: A comparison of a na?ve Bayesian and a memory based approach[C]//Proceedings of 4th European Conference on Principles and Practice of Knowledge Discovery in Databases.London:Jerry Press,2000:1-13.
[8] SUN Lihua,ZHANG Jidong,LI Jingmei.An improved knearest neighbor system and its application to text classification[J].Applied Science and Technology,2002,29(2):25-27.
[9] 寸待杰,刘韶涛.采用内容挖掘的缅甸文字相似性文档检索[J].华侨大学学报(自然科学版),2013,34(5):521-524.
[10] RASTOGI R,SHIM K.Public: A decision tree that integrates building and pruning[C]//Proceeding of 24th International Conference on Very Large Data Bases.New York:[s.n.],2014:404-415.
相似文献/References:
[1]寸待杰,刘韶涛.采用内容挖掘的缅甸文字相似文档检索[J].华侨大学学报(自然科学版),2013,34(5):521.[doi:10.11830/ISSN.1000-5013.2013.05.0521]
CUN Dai-jie,LIU Shao-tao.Retrieval of the Most Similar Myanmar Document Using Content Mining[J].Journal of Huaqiao University(Natural Science),2013,34(1):521.[doi:10.11830/ISSN.1000-5013.2013.05.0521]