期刊文献+

一种面向专利信息的文本自动分类算法 被引量:2

下载PDF
导出
摘要 讨论了两种常用的文本分类算法:Rocchio方法和K近邻方法。前者速度快,但是分类精度通常不能令人满意。后者则相反,他在分类时要花费更多的时间,但分类效果要好很多。通过综合他们的优点并结合专利文本的特点提出了一种适用于专利文本自动分类的层次分类方法。实验表明,该算法具有较好的分类精度与效率。
出处 《科技创新导报》 2009年第15期25-26,28,共3页 Science and Technology Innovation Herald
  • 相关文献

参考文献3

二级参考文献20

  • 1Yang Y, Liu X. A re-examination of text categorization methods. In: Proceedings of 22nd Annual International ACMSIGIR Conference on Research and Development in Information Retrieval ( SIGIR'99 ) . Berkeley: ACM Press, 1999. 42 ~ 49
  • 2He J,Tan AH, Tan CL. A comparative study on Chinese text categorization methods. In: Proceedings of the International Workshop on Text and Web Mining. Singapore: Melbourne,2000. 24~ 35
  • 3Cover TM, Hart PE. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 1968, IT-13: 21 ~ 27
  • 4Hart PE. Condensed nearest neighbor rule. IEEE Transactions on Information Theory, 1968, IT-14:515 ~ 516
  • 5Li RL, Hu YF. Noise reduction to text categorization based on density for k NN. In: Proceeding of the Second International Conference on Machine Learning and Cybernetics. Xi'an,2003. 3119~ 3124
  • 6Hwang WJ, Wen KW. Fast k NN classification algorithm based on partial distance search. Electronics Letters, 1998,34(21 ) :2006 ~ 2063
  • 7Baek SJ, Sung KM. Fast K-nearest-neighbour search algorithm for nonparametric classification. Electronics Letters ,2000,36(21 ) :1821 ~ 1822
  • 8Grabowski S. Voting over multiple k-NN classifier. TCSET'2002. 2002. 223 ~ 225
  • 9Denoeux T. A k-nearest neighbor classification rule based on dempster-shafer theory. IEEE Trans on Systems, Man, and Cybernetics, 1995,25 (5):804 ~ 813
  • 10Zhang B, Srihari SN. A fast algorithm finding k-nearest neighbors with non-metric dissimilarity. In: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition( IWFHR' 02). 2002

共引文献40

同被引文献25

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部