FLPI:An Optimal Algorithm for Document Indexing
LPI is not efficient in time and memory which makes it difficult to be applied to very large data set.In this paper,we propose a optimal algorithm called FLPI which decomposes the LPI problem as a graph embedding problem plus a regularized least squares problem.Such modification avoids eigen decomposition of dense matrices and can significantly reduce both time and memory cost in computation.Moreover,with a specifically designed graph in supervised situation,LPI only needs to solve the regularized least squares problem which is a further saving of time and memory.Real and synthetic data experimental results show that FLPI obtains similar or better results comparing to LPI and it is significantly faster.
Locality preserving indexing (LPI) Latent semantic indexing (LSI) Document indexing Dimensionality reduction
Jian-Wen Tao Qi-Fu Yao Jie-Yu Zhao
Department of Information Engineer Zhejiang Business Technology Institute,Ningbo,P.R.China; College Department of Information Engineer Zhejiang Business Technology Institute,Ningbo,P.R.China College of Information Science and Engineering,Ningbo University,Ningbo,P.R.China
国际会议
成都
英文
644-651
2008-05-17（万方平台首次上网日期，不代表论文的发表时间）