FLPI: an optimal algorithm for document indexing

Authors:
Jian-Wen Tao;Qi-Fu Yao;Jie-Yu Zhao
Affiliations:
Department of Information Engineer, Zhejiang Business Technology Institute, Ningbo, P.R. China and College of Information Science and Engineering, Ningbo University, Ningbo, P.R. China;Department of Information Engineer, Zhejiang Business Technology Institute, Ningbo, P.R. China;College of Information Science and Engineering, Ningbo University, Ningbo, P.R. China
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 4
Cited 0

Probabilistic latent semantic indexing

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Document clustering based on non-negative matrix factorization

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Locality preserving indexing for document representation

Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Document Clustering Using Locality Preserving Indexing

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.