Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently

Wei Chang, Jia-Ling Koh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, a method is proposed to dynamically construct a faceted interface to help users navigate web search results for finding required data efficiently. The proposed method consists of two processing steps: 1) candidate facets extraction, and 2) facet hierarchy construction. At first, the category information of entities in Wikipedia and a learning model are used to select the query-dependent facet terms for constructing the facet hierarchy. Then an objective function is designed to estimate the average browsing cost of users when accessing the search results by a given facet hierarchy. Accordingly, two greedy based algorithms, one is a bottom-up approach and another one is a top-down approach, are proposed to construct a facet hierarchy for optimizing the objective function. A systematic performance study is performed to verify the effectiveness and the efficiency of the proposed algorithms.

Original languageEnglish
Title of host publicationCurrent Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings
EditorsChang-Hwan Lee, Yongdai Kim, Young Sig Kwon, Juntae Kim, Moonis Ali
PublisherSpringer Verlag
Pages293-304
Number of pages12
ISBN (Print)9783319190655
DOIs
Publication statusPublished - 2015 Jan 1
Event28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015 - Seoul, Korea, Republic of
Duration: 2015 Jun 102015 Jun 12

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9101
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015
CountryKorea, Republic of
CitySeoul
Period15/6/1015/6/12

Fingerprint

Web Search
Browsing
Facet
Processing
Objective function
Costs
Wikipedia
Bottom-up
Hierarchy
Query
Verify
Dependent
Term
Estimate

Keywords

  • Faceted search
  • Search result organization
  • Wikipedia

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chang, W., & Koh, J-L. (2015). Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently. In C-H. Lee, Y. Kim, Y. S. Kwon, J. Kim, & M. Ali (Eds.), Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings (pp. 293-304). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9101). Springer Verlag. https://doi.org/10.1007/978-3-319-19066-2_29

Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently. / Chang, Wei; Koh, Jia-Ling.

Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings. ed. / Chang-Hwan Lee; Yongdai Kim; Young Sig Kwon; Juntae Kim; Moonis Ali. Springer Verlag, 2015. p. 293-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9101).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chang, W & Koh, J-L 2015, Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently. in C-H Lee, Y Kim, YS Kwon, J Kim & M Ali (eds), Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9101, Springer Verlag, pp. 293-304, 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Seoul, Korea, Republic of, 15/6/10. https://doi.org/10.1007/978-3-319-19066-2_29
Chang W, Koh J-L. Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently. In Lee C-H, Kim Y, Kwon YS, Kim J, Ali M, editors, Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings. Springer Verlag. 2015. p. 293-304. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-19066-2_29
Chang, Wei ; Koh, Jia-Ling. / Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently. Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings. editor / Chang-Hwan Lee ; Yongdai Kim ; Young Sig Kwon ; Juntae Kim ; Moonis Ali. Springer Verlag, 2015. pp. 293-304 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2c1a85d7f10b4b7bbe70bccf5789610a,
title = "Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently",
abstract = "In this paper, a method is proposed to dynamically construct a faceted interface to help users navigate web search results for finding required data efficiently. The proposed method consists of two processing steps: 1) candidate facets extraction, and 2) facet hierarchy construction. At first, the category information of entities in Wikipedia and a learning model are used to select the query-dependent facet terms for constructing the facet hierarchy. Then an objective function is designed to estimate the average browsing cost of users when accessing the search results by a given facet hierarchy. Accordingly, two greedy based algorithms, one is a bottom-up approach and another one is a top-down approach, are proposed to construct a facet hierarchy for optimizing the objective function. A systematic performance study is performed to verify the effectiveness and the efficiency of the proposed algorithms.",
keywords = "Faceted search, Search result organization, Wikipedia",
author = "Wei Chang and Jia-Ling Koh",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-19066-2_29",
language = "English",
isbn = "9783319190655",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "293--304",
editor = "Chang-Hwan Lee and Yongdai Kim and Kwon, {Young Sig} and Juntae Kim and Moonis Ali",
booktitle = "Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings",

}

TY - GEN

T1 - Dynamic Facet Hierarchy constructing for Browsing web search results Efficiently

AU - Chang, Wei

AU - Koh, Jia-Ling

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In this paper, a method is proposed to dynamically construct a faceted interface to help users navigate web search results for finding required data efficiently. The proposed method consists of two processing steps: 1) candidate facets extraction, and 2) facet hierarchy construction. At first, the category information of entities in Wikipedia and a learning model are used to select the query-dependent facet terms for constructing the facet hierarchy. Then an objective function is designed to estimate the average browsing cost of users when accessing the search results by a given facet hierarchy. Accordingly, two greedy based algorithms, one is a bottom-up approach and another one is a top-down approach, are proposed to construct a facet hierarchy for optimizing the objective function. A systematic performance study is performed to verify the effectiveness and the efficiency of the proposed algorithms.

AB - In this paper, a method is proposed to dynamically construct a faceted interface to help users navigate web search results for finding required data efficiently. The proposed method consists of two processing steps: 1) candidate facets extraction, and 2) facet hierarchy construction. At first, the category information of entities in Wikipedia and a learning model are used to select the query-dependent facet terms for constructing the facet hierarchy. Then an objective function is designed to estimate the average browsing cost of users when accessing the search results by a given facet hierarchy. Accordingly, two greedy based algorithms, one is a bottom-up approach and another one is a top-down approach, are proposed to construct a facet hierarchy for optimizing the objective function. A systematic performance study is performed to verify the effectiveness and the efficiency of the proposed algorithms.

KW - Faceted search

KW - Search result organization

KW - Wikipedia

UR - http://www.scopus.com/inward/record.url?scp=84946416201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946416201&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-19066-2_29

DO - 10.1007/978-3-319-19066-2_29

M3 - Conference contribution

AN - SCOPUS:84946416201

SN - 9783319190655

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 293

EP - 304

BT - Current Approaches in Applied Artificial Intelligence - 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Proceedings

A2 - Lee, Chang-Hwan

A2 - Kim, Yongdai

A2 - Kwon, Young Sig

A2 - Kim, Juntae

A2 - Ali, Moonis

PB - Springer Verlag

ER -