Affiliation:
1. Department of Computer Science and Engineering, National Institute of Technology Karnataka, Surathkal, India
Abstract
The evolution of the Internet and real-time applications has contributed to the growth of massive unstructured data which imposes the increased complexity of efficient retrieval of dynamic data. Extant research uses clustering methods and indexes to speed up the retrieval. However, the quality of clustering methods depends on data representation models where existing models suffer from dimensionality explosion and sparsity problems. As documents evolve, index reconstruction from scratch is expensive. In this work, compact vectors of documents generated by the Doc2Vec model are used to cluster the documents and the indexes are incrementally updated with less complexity using the diff method. The probabilistic ranking scheme BM25+ is used to improve the quality of retrieval for user queries. The experimental analysis demonstrates that the proposed system significantly improves the clustering performance and reduces retrieval time to obtain top-k results.
Reference45 articles.
1. Asadi, N., & Lin, J. (2013). Fast, incremental inverted indexing in main memory for web-scale collections.
2. Keyword search using modified minimum edit distance measure.;K.Audhkhasi;Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP,2007
3. Representation Learning: A Review and New Perspectives
4. Latent Dirichlet allocation.;D. M.Blei;Journal of Machine Learning Research,2003
5. Bojanowski, P., Grave, E., Joulin, A., & Mikolov, T. (2017). Enriching word vectors with sub-word information. Transactions of the Association for Computational Linguistics, 5, 135-146. Retrieved from https://www.aclweb.org/anthology/Q17-1010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献