Minimizing Navigation Cost Using Opt-Edgecut Algorithm

• Published in: I-Manager's Journal on Software Engineering Vol. 6; no. 2; pp. 46 - 52
• Main Authors: Tamilanban, R, Ramkumar, M
• Format: Journal Article
• Language: English
• Published: Nagercoil iManager Publications 01.10.2011
• Subjects: Algorithms; Cost engineering; Finite element method; Hierarchies; Navigation; Queries; Searching; Trees
• ISSN: 0973-5151; 2230-7168
• DOI: 10.26634/jse.6.2.2898

Search queries on large databases, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization of large databases is the main focus of this work. A natural way to organize biomedical citations is according to their MeSH annotations. MeSH is a comprehensive concept hierarchy used by PubMed. In this paper, the authors present the BioNav system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigation cost is minimized. In contrast, previous works expand the hierarchy in a predefined static manner, without navigation cost modeling. They shows that the problem of selecting the best concepts to reveal at each node expansion is NP-complete and propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees. They shows experimentally that BioNav outperforms state-of-the-art categorization systems by up to an order of magnitude, with respect to the user navigation cost. The Medline dataset are retrieved from US National library of Medicine.