TY - GEN
T1 - Reverse top-k query on uncertain preference
AU - Li, Guohui
AU - Chen, Qi
AU - Zheng, Bolong
AU - Zhao, Xiaosong
PY - 2018/1/1
Y1 - 2018/1/1
N2 - As a reverse rank-aware query, reverse top-k query returns the user preferences which make the given object belong to the top-k result set. This paper studies the reverse top-k query on uncertain preferences for the first time. A user’s uncertain preference consists of several probable preference instances, which reflects the user’s potential consumption tendency. In this paper, we design an optimization algorithm BBUPR based on the proposed RUI-tree index. Our experiment results show that BBUPR outperforms the other algorithms.
AB - As a reverse rank-aware query, reverse top-k query returns the user preferences which make the given object belong to the top-k result set. This paper studies the reverse top-k query on uncertain preferences for the first time. A user’s uncertain preference consists of several probable preference instances, which reflects the user’s potential consumption tendency. In this paper, we design an optimization algorithm BBUPR based on the proposed RUI-tree index. Our experiment results show that BBUPR outperforms the other algorithms.
KW - Reverse top-k query
KW - RUI-tree
KW - Uncertain preference
UR - http://www.scopus.com/inward/record.url?scp=85051115253&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-96893-3_26
DO - 10.1007/978-3-319-96893-3_26
M3 - Article in proceeding
AN - SCOPUS:85051115253
SN - 9783319968926
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 350
EP - 358
BT - Web and Big Data - Second International Joint Conference, APWeb-WAIM 2018, Proceedings
PB - Springer
T2 - 2nd Asia Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2018
Y2 - 23 July 2018 through 25 July 2018
ER -