Supporting personalized ranking over categorical attributes

Authors:
Gae-won You;Seung-won Hwang;Hwanjo Yu
Affiliations:
Department of Computer Science and Engineering, POSTECH, Pohang, Republic of Korea;Department of Computer Science and Engineering, POSTECH, Pohang, Republic of Korea;Department of Computer Science and Engineering, POSTECH, Pohang, Republic of Korea
Venue:
Information Sciences: an International Journal
Year:
2008

Citing 17
Cited 4

Combining fuzzy information from multiple systems (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Vector-space ranking with effective early termination

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Static index pruning for information retrieval systems

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
Minimal probing: supporting expensive predicates for top-k queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Personalized web search by mapping user queries to categories

Proceedings of the eleventh international conference on Information and knowledge management
Model 204 Architecture and Performance

Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
RankFP: A Framework for Supporting Rank Formulation and Processing

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Using ODP metadata to personalize search

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Probabilistic information retrieval approach for ranking of database query results

ACM Transactions on Database Systems (TODS)
Category ranking for personalized search

Data & Knowledge Engineering
DCFLA: A distributed collaborative-filtering neighbor-locating algorithm

Information Sciences: an International Journal
AdROSA-Adaptive personalization of web advertising

Information Sciences: an International Journal
Top-k query evaluation with probabilistic guarantees

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Soft computing agents for e-Health in application to the research and control of unknown diseases

Information Sciences: an International Journal

Personalized rough-set-based recommendation by integrating multiple contents and collaborative information

Information Sciences: an International Journal
Supporting efficient distributed skyline computation using skyline views

Information Sciences: an International Journal
Interactive skyline queries

Information Sciences: an International Journal
Pragmatic correlation analysis for probabilistic ranking over relational data

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper studies how to enable an effective ranked retrieval over data with categorical attributes, in particular, by supporting personalized ranked retrieval of highly relevant data. While ranked retrieval has been actively studied lately, existing efforts have focused only on supporting ranking over numerical or text data. However, many real-life data contain a large amount of categorical attributes, in combination with numerical and text attributes, which cannot be efficiently supported - unlike numerical attributes where a natural ordering is inherent, the existence of categorical attributes with no such ordering complicates both the formulation and processing of ranking. This paper studies the efficient and effective support of ranking over categorical data, as well as uniform support with other types of attributes.