Abstract
Discovering user preference is an important task in various database applications, such as searching product information and rating goods and services. However, there still lacks of a unifying model that is able to capture both implicit and explicit user preference information and to support managing, querying and analysing the information obtained from different sources.
In this paper, we present a framework based on our newly proposed Preference Band Model (PBM), which aims to achieve several goals. First, the PBM can serve as a formal basis to unify both implicit and explicit user preferences. We develop the model using a matrix-theoretic approach. Second, the model provides means to manipulate different sources of preference information. We establish a set of algebraic operators on Preference-Order Matrices (POMs). Third, the model supports direct querying of collective user preference and the discovery of a preference band. Roughly, a preference band is a ranking on sets of equally preferred items discovered from a POM that presents collective user preference. We demonstrate the applicability of our framework by studying two real datasets.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. In: ACM STOC, pp. 684–693 (2005)
Chomicki, J.: Preference formulas in relational queries. ACM Transaction Database System 28(4), 427–466 (2003)
Fagin, R., Kumar, R., Mahdian, M.: Comparing and aggregating with ties. In: ACM PODS, pp. 47–58 (2004)
Feng, J., Fang, Q., Ng, W.: Discovering Bucket Orders from Full Rankings. In: ACM SIGMOD (2008)
Gionis, A., Mannila, H., Puolamaki, K., Ukkonen, A.: Algorithms for discovering bucket orders from data. In: ACM SIGKDD, pp. 561–566 (2006)
Goharian, N., Jain, A., Sun, Q.: Comparative analysis of sparse matrix algorithms for information retrieval. Journal of Sys., Cyb. and Inf. 1(1) (2003)
Kießling, W., Köstler, G.: Foundations of Preference in Database Systems. In: Proc. of VLDB (2002)
Ng, W.: Prioritized Preferences and Choice Constraints. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 261–276. Springer, Heidelberg (2007)
Tan, Q., et al.: Applying Co-training to Clickthrough Data for Search Engine Adaptation. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 519–532. Springer, Heidelberg (2004)
Puolamäki, K., Fortelius, M., Mannila, H.: Seriation in paleontological data using markov chain monte carlo methods. PLoS Computational Bioglogy 2(2) (2006)
van Zuylen, A., et al.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: ACM-SIAM SODA, pp. 405–414 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, W. (2008). Developing Preference Band Model to Manage Collective Preferences. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds) Conceptual Modeling - ER 2008. ER 2008. Lecture Notes in Computer Science, vol 5231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87877-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-87877-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87876-6
Online ISBN: 978-3-540-87877-3
eBook Packages: Computer ScienceComputer Science (R0)