Abstract
We propose and describe Parameterized filesystem HITS (PFH), a lightweight rearrangement algorithm that performs a re-ranking of existing content-only search results in tree-like hierarchical corpora, such as a filesystem. PFH does this by combining the content analysis of the results with structural analysis of how they are organized. An ? parameter is used to vary the structure-content bias, allowing us to observe changes in performance when we place more emphasis on structure or on content. Using real and simulated data, experiments are provided to show that ? = 0.8 (i.e, 20% structure and 80% content) can substantially boost Mean Reciprocal Rank while keeping other IR metrics steady. Such an algorithm may be useful for building retrieval systems over hierarchical content such as Desktop Search, technical documents and books.
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 callDisclaimer: 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.
