Text Dimensionality Reduction with Mutual Information Preserving Mapping

被引:0
作者
YANG Zhen [1 ,2 ]
YAO Fei [1 ]
FAN Kefeng [3 ]
HUANG Jian [4 ]
机构
[1] College of Computer Science,Beijing University of Technology
[2] Guangxi Colleges and Universities Key Laboratory of cloud computing and complex systems,Guilin University of Electronic Technology
[3] China Electronics Standardization Institute
[4] Central University of Finance and Economics
关键词
Dimensionality reduction; Manifold learning; Temporal summarization; Mutual information preserving mapping(MIPM);
D O I
暂无
中图分类号
TP391.1 [文字信息处理];
学科分类号
081203 ; 0835 ;
摘要
With the explosion of information,it is becoming increasingly difficult to get what is really wanted.Dimensionality reduction is the first step in efficient processing of large data.Although dimensionality can be reduced in many ways,little work has been done to achieve dimensionality reduction without changing the inner semantic relationship among high dimension data.To remedy this problem,we introduced a manifold learning based method,named Mutual information preserving mapping(MIPM),to explore the low-dimensional,neighborhood and mutual information preserving embeddings of highdimensional inputs.Experimental results show that the proposed method is effective for the text dimensionality reduction task.The MIPM was used to develop a temporal summarization system for efficiently monitoring the information associated with an event over time.With respect to the established baselines,results of these experiments show that our method is effective in the temporal summarization.
引用
收藏
页码:919 / 925
页数:7
相关论文
共 5 条
[1]  
Dimensionality reduction for documents with nearest neighbor queries[J] . Stephen Ingram,Tamara Munzner.Neurocomputing . 2015
[2]  
A supervised non-linear dimensionality reduction approach for manifold learning[J] . B. Raducanu,F. Dornaika.Pattern Recognition . 2011 (6)
[3]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[4]   Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases [J].
Eamonn Keogh ;
Kaushik Chakrabarti ;
Michael Pazzani ;
Sharad Mehrotra .
Knowledge and Information Systems, 2001, 3 (3) :263-286
[5]   THREE-DIMENSIONAL OBJECT RECOGNITION. [J].
Besl, Paul J. ;
Jain, Ramesh C. .
Computing surveys, 1985, 17 (01) :75-145