Abstract
Searching for similar documents from huge amounts of documents is an important and time consuming problem. Although the numerous precise models have been developed for the task, the traditional search algorithms are unable to meet the needs of users for quick search. Herein, a new document similarity calculation and search method with high efficiency is proposed. The calculation of the similarity is based on the total probability model and the efficient search is achieved via level n nodes and paths of citation graph. A special approach from the branch and bound limits the search scope and provide decision algorithm. With the increase in the number of documents, the efficiency of the proposed algorithm is dramatically promoted.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Database Theory and Application
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
