Web document retrieval using manifold learning and ACO algorithm

To efficiently deal with high dimensionality and precision problems in document retrieval, a novel document retrieval algorithm based on manifold learning and ant colony optimization(ACO) algorithm is proposed. The high-dimensional document data are first projected into lower-dimensional feature space with neighborhood preserving embedding (NPE) algorithm, the ACO algorithm is then applied to retrieve relevant documents in the reduced lower-dimensionality document feature space. Extensive experiments on real-world data set demonstrate the effectiveness of the proposed algorithm.

[1]  Chris Buckley,et al.  Pivoted Document Length Normalization , 1996, SIGIR Forum.

[2]  Shuicheng Yan,et al.  Neighborhood preserving embedding , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[3]  Elizabeth R. Jessup,et al.  Matrices, Vector Spaces, and Information Retrieval , 1999, SIAM Rev..

[4]  Jiang Jianguo,et al.  A Novel Strategy of Coalition Evolvement Based on Interest , 2007 .

[5]  Ziqiang Wang,et al.  A PACA-Based Multicast Routing Algorithm , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  Amit Singhal,et al.  Pivoted document length normalization , 1996, SIGIR 1996.

[8]  Nicu Sebe,et al.  How to complete performance graphs in content-based image retrieval: add generality and normalize scope , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.