ACM Home Page
Please provide us with feedback. Feedback
Mining preferences from superior and inferior examples
Full text PdfPdf (296 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Las Vegas, Nevada, USA
SESSION: Research papers table of contents
Pages 390-398  
Year of Publication: 2008
ISBN:978-1-60558-193-4
Authors
Bin Jiang  Simon Fraser University, Burnaby, BC, Canada
Jian Pei  Simon Fraser University, Burnaby, BC, Canada
Xuemin Lin  The University of New South Wales, Sydney, Australia
David W. Cheung  The University of Hong Kong, Hong Kong, Hong Kong
Jiawei Han  University of Illinois at Urbana-Champaign , Urbana, IL, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 284,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1401890.1401940
What is a DOI?

ABSTRACT

Mining user preferences plays a critical role in many important applications such as customer relationship management (CRM), product and service recommendation, and marketing campaigns. In this paper, we identify an interesting and practical problem of mining user preferences: in a multidimensional space where the user preferences on some categorical attributes are unknown, from some superior and inferior examples provided by a user, can we learn about the user's preferences on those categorical attributes? We model the problem systematically and show that mining user preferences from superior and inferior examples is challenging. Although the problem has great potential in practice, to the best of our knowledge, it has not been explored systematically before. As the first attempt to tackle the problem, we propose a greedy method and show that our method is practical using real data sets and synthetic data sets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
 
6
 
7
S. Holland, M. Ester, and W. Kießling. Preference mining: A novel approach on mining user preferences for personalized applications. In PKDD, 2003.
 
8
 
9
B. Jiang, J. Pei, X. Lin, D. W-L Cheung, and J. Han. Mining preferences from superior and inferior examples. Technical report TR 2008-09, School of Computing Science, Simon Fraser University, 2008.
10
 
11
 
12
 
13
 
14
 
15
16
 
17
 
18
 
19
 
20
R. E. S. William W. Cohen and Y. Singer. Learning to order things. J. Artif. Intell. Res. (JAIR), 1999.

Collaborative Colleagues:
Bin Jiang: colleagues
Jian Pei: colleagues
Xuemin Lin: colleagues
David W. Cheung: colleagues
Jiawei Han: colleagues