首页 | 本学科首页   官方微博 | 高级检索  
     

基于投影寻踪降维的文本特征可视化
引用本文:高茂庭,陆鹏.基于投影寻踪降维的文本特征可视化[J].计算机应用,2008,28(6):1411-1413.
作者姓名:高茂庭  陆鹏
作者单位:上海海事大学,信息工程学院,上海,200135
基金项目:国家自然科学基金 , 上海市教委资助项目 , 上海海事大学校科研和教改项目
摘    要:利用遗传算法优化投影方向,投影寻踪模型将高维的文本特征数据投影到2~3维的低维可视化空间上,并根据高维数据在这个低维空间当中的投影特征值来反映其线性和非线性结构或特征,达到数据降维目的并实现文本数据特征可视化。不仅大大约简了文本挖掘过程的计算复杂性,还有助于在K-means聚类算法中确定初始中心点数目,提高算法精度。实验验证了这种方法应用于文本特征降维的有效性。

关 键 词:投影寻踪  降维  文本挖掘  遗传算法
文章编号:1001-9081(2008)06-1411-03
收稿时间:2007-12-21
修稿时间:2007年12月21

Projection-pursuit-based dimension reduction for visualization of text features
GAO Mao-ting,LU Peng.Projection-pursuit-based dimension reduction for visualization of text features[J].journal of Computer Applications,2008,28(6):1411-1413.
Authors:GAO Mao-ting  LU Peng
Affiliation:GAO Mao-ting,LU PengCollege of Information Engineering,Shanghai Maritime University,Shanghai 200135,China
Abstract:Using genetic algorithm to search for the optimal projecting direction, projection pursuit model was used to project text feature data from high-dimensional space into low-dimensional space (2 or 3 dimensions ), and the linear and non-linear structures and features of the high-dimensional data were shown by its projecting feature value in the low dimensional space, therefore dimensionality was reduced and visualization for high-dimensional text feature data was realized. This method is not only cutting down the computing complexity in the process of text mining, but also helping to determine the number of initial center point for K-means algorithm, and improving the accuracy of the algorithm. Experiments demonstrate the efficiency of this method for text feature dimension reduction.
Keywords:projection pursuit  dimension reduction  text mining  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号