期刊文献+

谱聚类及其在文本分析中的应用研究进展

Spectral Clustering and Its Application in Text Analysis
下载PDF
导出
摘要 随着文本数据的快速积累,文本自动分析成为管理和利用海量文本数据的重要手段。其中,文本聚类是文本分析的基本任务之一。本文着重介绍文本分析与谱聚类的研究进展,阐述目前在文本分析中应用谱聚类技术的主要方法,旨在为文本分析中谱聚类方法的应用提供引导作用。 With the fast accumulation of text data, the automatic text analysis has become an important way to manage and utilize a large amount of text data. The text clustering is one of fundamental tasks for text analysis. The developments of text analysis and spectral clustering are introduced. The main methods for spectral clustering in text analysis are presented. This paper attempts to provide reference for the construction of spectral clustering methods applied in text analysis.
作者 邢洁清
出处 《安徽电子信息职业技术学院学报》 2015年第4期15-18,共4页 Journal of Anhui Vocational College of Electronics & Information Technology
基金 海南省高等学校科学研究项目(No.Hjkj2013-54) 海南省自然科学基金项目(NO.614246)
关键词 聚类 谱聚类 文本分析 局部最优 clustering spectral clustering text analysis local optimum
  • 相关文献

参考文献22

  • 1陶新民,宋少宇,曹盼东,付丹丹.一种基于流形距离核的谱聚类算法[J].信息与控制,2012,41(3):307-313. 被引量:27
  • 2王会青,陈俊杰.基于图划分的谱聚类方法的研究[J].计算机工程与设计,2011,32(1):289-292. 被引量:16
  • 3Shi J., Malik J. Normalized Cuts and Image Segmentation [J].IEEE Transactions on Pattern Analysis and Machine Intelli -gence, 2000, (#).
  • 4Ng A. Y., Jordan M. I., Weiss Y. On Spectral Clustering:Analysis and anAlgorithm [C].Advances in Neural InformationProcessing Systems,2001.
  • 5Donath W. E., Hoffman A. J. Lower bounds for thepartitioning of graph [J]. IBM J Res Dev, 1-93, (5).
  • 6Ding C. H. Q., He X ., Zha H. et al A min -max cutalgorithm for graph partitioning and data clustering [C]. In:Proceedings of IEEE international conference on data mining,2001.
  • 7Hagen L., Kahng A. B. New spectral methods for radio cutpartitioning and clustering [J]. IEEE Trans Comput-aid DesIntegr Circuits Syst, 1-2.
  • 8Fiedler M. Algebraic connectivity of graphs [J]. CzechoslovMath J, 1-93, (2).
  • 9Zhang X. C., Li J. W., Yu H. Local density adaptivesimilarity measurement for spectral clustering [J]. Patt RecognLett, 2011, (2).
  • 10Yang P., Zhu Q. S., Huang B. Spectral clustering withdensity sensitive similarity function [J]. Knowl -Based Syst,2011,(5).

二级参考文献50

  • 1Meila M,Shi J.A random walks view of spectral segmentation [C]. 8th International Workshop on Artificial Intelligence and Statistics,2001.
  • 2Brand M,Kun H A.Unifying theorem for spectral embedding and clustering[C].Key West,Florida: Proceeding of the 9th International Conference on Artificial Intelligence and Statistics,2003.
  • 3Dhillon I, Guan Y, Kulis B. A unified view of kernel k-means, spectral clustering and graph cuts[R]. Technical report, UTCS, 2004.
  • 4Xing E P, Jordan M I.On semidefine relaxation for normalized k- cut and connections to spectral clustering[R].Technical Report, UCB/CSD-03-1265, EECS Department, University of California, Berkeley, 2003.
  • 5Meila M, Xu L. Multiway cuts and spectral clustering [R]. U. Washington Tech Report.2003.
  • 6NG A Y, JORDAN M I,WEISS Y.On spectral clustering: Analysis and an algorithm [C]. Proceedings of the 14th Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press,2002:849-856.
  • 7HAN Jiawei,KAMBER M.Data mining: concept and techniques [M].America:Morgan Kaufmann Publishers,2001:223-260.
  • 8Zhang B,Hsu M,Dayal U.K-harmonic means - a data clustering algorithm[R].HP Technical Report, 1999.
  • 9EKINAEKIN A, PANKANTI S, HAMPAPUR A. Initialization independent spectral clustering with applications to automatic video analysis[C].Montrea, Canada:Proc ofIEEE ICASSP,2004: 641-644.
  • 10Polito M, Perona P. Grouping and dimensionality reduction by locally linear embedding[C].Neural Information Processing Systems,2002.

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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