Issue No. 04 - April (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.135
Vagelis Hristidis , Florida International University, Miami
Abhijith Kashyap , SUNY Buffalo, Buffalo
Michalis Petropoulos , SUNY Buffalo, Buffalo
Sotiria Tavoulari , Yale University, New Haven
Search queries on biomedical databases, such as PubMed, 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 for biomedical databases is the 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, we 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. We show 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. We show experimentally that BioNav outperforms state-of-the-art categorization systems by up to an order of magnitude, with respect to the user navigation cost. BioNav for the MEDLINE database is available at http://db.cse.buffalo.edu/bionav.
Interactive data exploration and discovery, search process, graphical user interfaces, interaction styles.
Vagelis Hristidis, Abhijith Kashyap, Michalis Petropoulos, Sotiria Tavoulari, "Effective Navigation of Query Results Based on Concept Hierarchies", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 540-553, April 2011, doi:10.1109/TKDE.2010.135