Proceedings

Multi-Select Faceted Navigation Based on Minimum Description Length Principle

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1690-1695.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-284

© 2011 International Joint Conferences on Artificial Intelligence

Abstract

Faceted navigation can effectively reduce user efforts of reaching targeted resources in databases, by suggesting dynamic facet values for iterative query refinement. A key issue is minimizing the navigation cost in a user query session. Conventional navigation scheme assumes that at each step, users select only one suggested value to figure out resources containing it. To make faceted navigation more flexible and effective, this paper introduces a multi-select scheme where multiple suggested values can be selected at one step, and a selected value can be used to either retain or exclude the resources containing it. Previous algorithms for cost-driven value suggestion can hardly work well under our navigation scheme. Therefore, we propose to optimize the navigation cost using the Minimum Description Length principle, which can well balance the number of navigation steps and the number of suggested values per step under our new scheme. An emperical study demonstrates that our approach is more cost-saving and efficient than state-of-the-art approaches.

  1. [Basu Roy et al., 2008] Senjuti Basu Roy, Haidong Wang, Gautam Das, Ullas Nambiar, and Mukesh Mohania. Minimum-effort driven dynamic faceted search in structured databases. In CIKM '08, pages 13-22, 2008.
  2. [Bergman, 2001] M.K. Bergman. The deep web: Surfacing hidden value. Journal of Electronic Publishing, 7(1), 2001.
  3. [Dakka and Ipeirotis, 2008] Wisam Dakka and Panagiotis G. Ipeirotis. Automatic extraction of useful facet hierarchies from text databases. In ICDE '08, pages 466-475, 2008.
  4. [Han et al., 2000] Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In SIGMOD '00, pages 1-12, 2000.
  5. [He et al., 2007] Bin He, Mitesh Patel, Zhen Zhang, and Kevin Chen-Chuan Chang. Accessing the deep web. Commun. ACM, 50:94-101, May 2007.
  6. Marti A. Hearst. Clustering versus faceted cate- gories for information exploration. Commun. ACM, 49:59-61, April 2006.
  7. [Huffman, 1952] D.A. Huffman. A method for the construc- tion of minimum-redundancy codes. Proceedings of the IRE, 40(9):1098-1101, 1952.
  8. [Kashyap et al., 2010] Abhijith Kashyap, Vagelis Hristidis, and Michalis Petropoulos. Facetor: Cost-driven exploration of faceted query results. In CIKM '10, pages 719-728, 2010.
  9. [Koren et al., 2008] J. Koren, Y. Zhang, and X. Liu. Personalized interactive faceted search. In WWW '08, pages 477-486, 2008.
  10. [Lee et al., 2007] Jae-Gil Lee, Jiawei Han, and Kyu-Young Whang. Trajectory clustering: a partition-and-group framework. In SIG- MOD '07, pages 593-604, 2007.
  11. [Lee et al., 2009] Bongshin Lee, Greg Smith, George G. Robertson, Mary Czerwinski, and Desney S. Tan. Facetlens: exposing trends and relationships to support sensemaking within faceted datasets. In SIGCHI '09, pages 1293-1302, 2009.
  12. [Li et al., 2010] C. Li, N. Yan, S.B. Roy, L. Lisham, and G. Das. Facetedpedia: dynamic generation of query-dependent faceted interfaces for wikipedia. In WWW '10, pages 651-660, 2010.
  13. [Marchionini, 2006] Gary Marchionini. Exploratory search: from finding to understanding. Commun. ACM, 49:41-46, April 2006.
  14. [Navlakha et al., 2008] S. Navlakha, R. Rastogi, and N. Shrivas- tava. Graph summarization with bounded error. In SIGMOD '08, pages 419-432, 2008.
  15. [Sinha and Karger, 2005] V. Sinha and D.R. Karger. Magnet: Sup- porting navigation in semistructured data environments. In SIG- MOD '05, pages 97-106, 2005.
  16. [Tunkelang, 2006] D. Tunkelang. Dynamic category sets: An ap- proach for faceted search. In SIGIR '06 Workshop on Faceted Search, 2006.
  17. [van Zwol and Sigurbjornsson, 2010] R. van Zwol and B. Sigurb- jornsson. Faceted exploration of image search results. In WWW '10, pages 961-970, 2010.
  18. [Yee et al., 2003] Ka-Ping Yee, Kirsten Swearingen, Kevin Li, and Marti Hearst. Faceted metadata for image search and browsing. In SIGCHI '03, pages 401-408, 2003.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards