期刊文献+

基于受限玻尔兹曼机的中文文档分类 被引量:3

下载PDF
导出
摘要 最近,许多不同类型的人工神经网络(Artificial Neural Network)已经应用于文档分类,并且得到了较好的结果。但是,大多数的模型仅使用了少量特征作为输入,因此可能没有足够的信息来对文档进行准确分类。如果输入更多的特征,将可能发生所谓的维数灾难,导致模型的训练时间大幅度增加,其泛化能力也可能会恶化。因此,在原始高维的输入特征中抽取出高度可区分的低维特征,并将其作为相应模型的输入对改善模型的泛化性能会有很大的帮助。受限玻尔兹曼机(Restricted Boltzmann Machine)是一种新型的机器学习工具,因为其强大的学习能力,受限玻尔兹曼机已经被广泛应用于各种机器学习问题。在本文中,我们使用受限玻尔兹曼机从原始输入特征中抽取低维高度可区分的低维特征,并且使用支持向量机(Support Vector Machine)作为回归模型。
出处 《科技创新导报》 2012年第16期35-36,共2页 Science and Technology Innovation Herald
  • 相关文献

参考文献3

二级参考文献15

  • 1Pawlak Z. Rough Sets. International Journal of Information and Computer Science, 1982, 11(5): 341-356
  • 2Pawlak Z, Grzymla-Busse J. Rough Sets. Communications of the ACM, 1995,38(11):88-95
  • 3Deerwester S, Dumains S, Fumas G, et al. Indexing by Latent Semantic Analysis [J]. Journal of the American Society for Information Science, 1990, 41(6):391-407
  • 4Bao Yongguang, Aoyama S, Du Xiaoyong. A Rough Set-based Hybrid Method to Text Categorization. Second International Conference on Web Information Systems Engineering (WISE′01) Volumel.2002:254-261
  • 5Chouchoulas A, Shen Q. A Rough Set-Based Approach to Text Classification. In 7th International Workshop, RSFDGrC99, Yamaguchi,Japan, 1999:118-129
  • 6SHA F,LINY Q,SAULLK,LEE D D.Multiplicative updates for nonnegative quadratic programming[].Neural Computation.2007
  • 7LEWIS D D.Reuters.21578text categorization collection. http://kdd.ics.uci.edu/databases/reu.ters21578/reuters21578.html . 2008
  • 8News Group. http://kdd.ics.uci.edu/databases/20newsgroups/20newsgroups.htm . 2008
  • 9Sebastiani,F Machine Learning in Automated Text Categorization. ACM Computing Surveys . 2002
  • 10Vapnik V N.The Nature of Statistical Learning Theory[]..1995

共引文献6

同被引文献61

  • 1Hopfield J J. Neural networks and physical systems with emergent col|ective computational abilities [J]. Proceedings of the National Academy of Sciences of the United States of America, 1982, 79(8):2554-2558.
  • 2Hinton G E, Sejnowski T J. Optimal perceptual inference [C]//Proc of the 1983 IEEE Conf on Computer Vision and Pattern Recognition. Los Alamitos, CA: IEEE Computer Society, 1983: 448-453.
  • 3Hinton G E, Sejnowski T J. Analyzing cooperative computation [C] //Proc of the 5th Annual Congress of the Cognitive Science Society. New York: ACM, 1983: 2554- 2558.
  • 4Hofstadter D R. The copycat project: An experiment in nondeterminism and creative analogies [DB/OL:. MIT Artificial Intelligence Laboratory Memo 755. (1984- 01-01) [2004-10-01]. http://hdl, handle, net/1721.1/5648.
  • 5Hofstadter D R. A Non-Deterministic Approach to Analogy, Involving the Ising Model of Ferromagnetism[M] //The Physics of Cognitive Processes. Hackensack: World Scientific, 1987.
  • 6Smolensky P. Information Processing in Dynamical Systems: Foundations of Harmony Theory [M]//Parallel Distributed Processing, Vol 1: Foundations. Cambridge: MIT Press, 1986: 194-281.
  • 7Ackley D H, Hinton G E, Sejnowski T J. A learning algorithm for Boltzmann machines [J]. Cognitive Science, 1985, 9(1): 147-169.
  • 8Hinton G E. Training products otF experts by minimizing contrastive divergence[J]. Neural Computation, 2002, 14 (8) : 1771-1800.
  • 9Kirkpatrick S, Gelatt C D, Vecchi M P. Optimization by simulated annealing [J]. Science, 1983, 220 (4598) : 671- 680.
  • 10Hinton G E. To recognize shapes, first learn to generate images [J]. Computational Neuroscience: Theoretical Insights into Brain Function, 2007, 165(1): 535-547.

引证文献3

二级引证文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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