Efficient querying relaxed dominant relationship between product items based on rank aggregation

Authors:
Zhenglu Yang;Lin Li;Masaru Kitsuregawa
Affiliations:
Info. and Comm. Engineering Department, The University of Tokyo, Tokyo, Japan;Info. and Comm. Engineering Department, The University of Tokyo, Tokyo, Japan;Info. and Comm. Engineering Department, The University of Tokyo, Tokyo, Japan
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Year:
2008

Citing 12
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Analyses of multiple evidence combination

Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Models for metasearch

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Incorporating User Preferences in Multimedia Queries

ICDT '97 Proceedings of the 6th International Conference on Database Theory
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth

Proceedings of the 17th International Conference on Data Engineering
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
ProbFuse: a probabilistic approach to data fusion

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Towards efficient dominant relationship exploration of the product items on the web

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2

Enhancing Web Search by Aggregating Results of Related Web Queries

WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, we propose a new model, Relaxed Dominant Relationship (RDR), which extends the state-of-the-art work by incorporating rank aggregation methods. We propose efficient strategies on building compressed data structure to encode the core part of RDR between items. Efficient querying approaches are devised to facilitate the ranking process and to answer the RDR query. Extensive experiments are conducted and the results illustrate the effectiveness and efficiency of our methods.