메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1690-1696

Multi-select faceted navigation based on minimum description length principle

Author keywords

[No Author keywords available]

Indexed keywords

COST-SAVING; EMPERICAL STUDIES; KEY ISSUES; MINIMUM DESCRIPTION LENGTH PRINCIPLE; QUERY REFINEMENT; USER QUERY;

EID: 84881038650     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-284     Document Type: Conference Paper
Times cited : (1)

References (18)
  • 1
    • 70349250370 scopus 로고    scopus 로고
    • Minimum-effort driven dynamic faceted search in structured databases
    • 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.
    • (2008) CIKM ' 08 , pp. 13-22
    • Roy, S.B.1    Wang, H.2    Das, G.3    Nambiar, U.4    Mohania, M.5
  • 3
    • 52649152249 scopus 로고    scopus 로고
    • Automatic extraction of useful facet hierarchies from text databases
    • Wisam Dakka and Panagiotis G. Ipeirotis. Automatic extraction of useful facet hierarchies from text databases. In ICDE '08, pages 466-475, 2008.
    • (2008) ICDE '08 , pp. 466-475
    • Dakka, W.1    Ipeirotis, P.G.2
  • 4
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In SIGMOD '00, pages 1-12, 2000.
    • (2000) SIGMOD '00 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 6
    • 33745213314 scopus 로고    scopus 로고
    • Clustering versus faceted categories for information exploration
    • April
    • Marti A. Hearst. Clustering versus faceted categories for information exploration. Commun. ACM, 49:59-61, April 2006.
    • (2006) Commun. ACM , vol.49 , pp. 59-61
    • Hearst, M.A.1
  • 7
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • D.A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9):1098-1101, 1952.
    • (1952) Proceedings of the IRE , vol.40 , Issue.9 , pp. 1098-1101
    • Huffman, D.A.1
  • 8
    • 78651268983 scopus 로고    scopus 로고
    • Facetor: Cost-driven exploration of faceted query results
    • Abhijith Kashyap, Vagelis Hristidis, and Michalis Petropoulos. Facetor: Cost-driven exploration of faceted query results. In CIKM '10, pages 719-728, 2010.
    • (2010) CIKM '10 , pp. 719-728
    • Kashyap, A.1    Hristidis, V.2    Petropoulos, M.3
  • 9
    • 57349115984 scopus 로고    scopus 로고
    • Personalized interactive faceted search
    • J. Koren, Y. Zhang, and X. Liu. Personalized interactive faceted search. In WWW '08, pages 477-486, 2008.
    • (2008) WWW '08 , pp. 477-486
    • Koren, J.1    Zhang, Y.2    Liu, X.3
  • 10
    • 35449007737 scopus 로고    scopus 로고
    • Trajectory clustering: A partition-and-group framework
    • Jae-Gil Lee, Jiawei Han, and Kyu-Young Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD '07, pages 593-604, 2007.
    • (2007) SIGMOD '07 , pp. 593-604
    • Lee, J.-G.1    Han, J.2    Whang, K.-Y.3
  • 11
    • 84892448817 scopus 로고    scopus 로고
    • Facetlens: Exposing trends and relationships to support sensemaking within faceted datasets
    • 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.
    • (2009) SIGCHI '09 , pp. 1293-1302
    • Lee, B.1    Smith, G.2    Robertson, G.G.3    Czerwinski, M.4    Tan, D.S.5
  • 12
    • 77954592231 scopus 로고    scopus 로고
    • Facetedpedia: Dynamic generation of query-dependent faceted interfaces for wikipedia
    • 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.
    • (2010) WWW '10 , pp. 651-660
    • Li, C.1    Yan, N.2    Roy, S.B.3    Lisham, L.4    Das, G.5
  • 13
    • 33745184635 scopus 로고    scopus 로고
    • Exploratory search: From finding to understanding
    • April
    • Gary Marchionini. Exploratory search: from finding to understanding. Commun. ACM, 49:41-46, April 2006.
    • (2006) Commun. ACM , vol.49 , pp. 41-46
    • Marchionini, G.1
  • 14
    • 57149127816 scopus 로고    scopus 로고
    • Graph summarization with bounded error
    • S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD '08, pages 419-432, 2008.
    • (2008) SIGMOD '08 , pp. 419-432
    • Navlakha, S.1    Rastogi, R.2    Shrivastava, N.3
  • 17
    • 77954631590 scopus 로고    scopus 로고
    • Faceted exploration of image search results
    • R. van Zwol and B. Sigurbjornsson. Faceted exploration of image search results. In WWW '10, pages 961-970, 2010.
    • (2010) WWW '10 , pp. 961-970
    • Van Zwol, R.1    Sigurbjornsson, B.2
  • 18
    • 0038037309 scopus 로고    scopus 로고
    • Faceted metadata for image search and browsing
    • Ka-Ping Yee, Kirsten Swearingen, Kevin Li, and Marti Hearst. Faceted metadata for image search and browsing. In SIGCHI '03, pages 401-408, 2003.
    • (2003) SIGCHI '03 , pp. 401-408
    • Yee, K.-P.1    Swearingen, K.2    Li, K.3    Hearst, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.