Search result diversification based on hierarchical intents

Sha Hu; Zhicheng Dou; Xiaojie Wang; Tetsuya Sakai; Ji Rong Wen

doi:10.1145/2806416.2806455

Search result diversification based on hierarchical intents

Sha Hu, Zhicheng Dou^*, Xiaojie Wang, Tetsuya Sakai, Ji Rong Wen

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

56 Citations (Scopus)

Abstract

A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics.

Original language	English
Title of host publication	CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management
Publisher	Association for Computing Machinery
Pages	63-72
Number of pages	10
ISBN (Electronic)	9781450337946
DOIs	https://doi.org/10.1145/2806416.2806455
Publication status	Published - 2015 Oct 17
Event	24th ACM International Conference on Information and Knowledge Management, CIKM 2015 - Melbourne, Australia Duration: 2015 Oct 19 → 2015 Oct 23

Publication series

Name	International Conference on Information and Knowledge Management, Proceedings
Volume	19-23-Oct-2015

Other

Other	24th ACM International Conference on Information and Knowledge Management, CIKM 2015
Country/Territory	Australia
City	Melbourne
Period	15/10/19 → 15/10/23

Keywords

Hierarchical diversification
Hierarchical intents
Search result diversification

ASJC Scopus subject areas

Decision Sciences(all)
Business, Management and Accounting(all)

Access to Document

10.1145/2806416.2806455

Cite this

Hu, S., Dou, Z., Wang, X., Sakai, T., & Wen, J. R. (2015). Search result diversification based on hierarchical intents. In CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management (pp. 63-72). (International Conference on Information and Knowledge Management, Proceedings; Vol. 19-23-Oct-2015). Association for Computing Machinery. https://doi.org/10.1145/2806416.2806455

Search result diversification based on hierarchical intents. / Hu, Sha; Dou, Zhicheng; Wang, Xiaojie et al.
CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery, 2015. p. 63-72 (International Conference on Information and Knowledge Management, Proceedings; Vol. 19-23-Oct-2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hu, S, Dou, Z, Wang, X, Sakai, T & Wen, JR 2015, Search result diversification based on hierarchical intents. in CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management. International Conference on Information and Knowledge Management, Proceedings, vol. 19-23-Oct-2015, Association for Computing Machinery, pp. 63-72, 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, Australia, 15/10/19. https://doi.org/10.1145/2806416.2806455

Hu S, Dou Z, Wang X, Sakai T, Wen JR. Search result diversification based on hierarchical intents. In CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery. 2015. p. 63-72. (International Conference on Information and Knowledge Management, Proceedings). doi: 10.1145/2806416.2806455

@inproceedings{e4250e56b57d4493990ede28aecda4b6,

title = "Search result diversification based on hierarchical intents",

abstract = "A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics.",

keywords = "Hierarchical diversification, Hierarchical intents, Search result diversification",

author = "Sha Hu and Zhicheng Dou and Xiaojie Wang and Tetsuya Sakai and Wen, {Ji Rong}",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 24th ACM International Conference on Information and Knowledge Management, CIKM 2015 ; Conference date: 19-10-2015 Through 23-10-2015",

year = "2015",

month = oct,

day = "17",

doi = "10.1145/2806416.2806455",

language = "English",

series = "International Conference on Information and Knowledge Management, Proceedings",

publisher = "Association for Computing Machinery",

pages = "63--72",

booktitle = "CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management",

}

TY - GEN

T1 - Search result diversification based on hierarchical intents

AU - Hu, Sha

AU - Dou, Zhicheng

AU - Wang, Xiaojie

AU - Sakai, Tetsuya

AU - Wen, Ji Rong

PY - 2015/10/17

Y1 - 2015/10/17

N2 - A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics.

AB - A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics.

KW - Hierarchical diversification

KW - Hierarchical intents

KW - Search result diversification

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

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

U2 - 10.1145/2806416.2806455

DO - 10.1145/2806416.2806455

M3 - Conference contribution

AN - SCOPUS:84958250435

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 63

EP - 72

BT - CIKM 2015 - Proceedings of the 24th ACM International Conference on Information and Knowledge Management

PB - Association for Computing Machinery

T2 - 24th ACM International Conference on Information and Knowledge Management, CIKM 2015

Y2 - 19 October 2015 through 23 October 2015

ER -

Search result diversification based on hierarchical intents

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this