Minimizing Navigation Cost Using Opt-Edgecut Algorithm

Tamilanban R*, M. Ramkumar**
Periodicity:October - December'2011
DOI : https://doi.org/10.26634/jse.6.2.2898

Abstract

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.

Keywords

Search Process, Graphical User Interfaces, Interactive Data Exploration and Discovery , Interaction Styles.

How to Cite this Article?

Tamilanban R and M. Ramkumar (2011). Minimizing Navigation Cost Using Opt-Edgecut Algorithm. i-manager’s Journal on Software Engineering, 6(2), 46-52. https://doi.org/10.26634/jse.6.2.2898

References

[1]. J.S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis, (2003). “Automated Ranking of Database Query Results,” Proc. First Biennial Conf. Innovative Data Systems Research,
[2]. K. Chakrabarti S. Chaudhuri, and S.W. Hwang, (2004). “Automatic Categorization of Query Results,” Proc. ACM SIGMOD, pp. 755- 766,
[3]. Z. Chen and T. Li, (2007). “Addressing Diverse User Preferences in SQLQuery- Result Navigation,” Proc. ACM SIGMOD, pp. 641-652.
[4]. V. Hristidis and Y. Papakonstantinou, (2002). “DISCOVER: Keyword Search in Relational Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB).
[5]. M. Khaki, (2005). “Findex: Search Results Categories Help When Document Ranking Fails,” Proc. ACM SIGCHI Conf. Human Factors in Computing Systems, pp. 131- 140.
[6]. A. Kashyap, V. Hristidis, M. Petropoulos, and S. Tavoulari, (2009). “BioNav: Effective Navigation on Query Results of Biomedical Databases,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), (short paper), pp. 1287-1290.
[7]. Medical Subject Headings (MeSH), http: //www.nlm.nih.gov/ mesh/, 2010.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.