Learning conditional preference networks with queries

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1930-1935

  Koriche, Frédéric ^a   Zanuttini, Bruno ^b  

^a LIRMM   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE-EFFICIENT ALGORITHMS; CONDITIONAL PREFERENCES; EQUIVALENCE QUERIES; EXACT LEARNING; MEMBERSHIP QUERY; MULTI-ATTRIBUTES; PREFERENCE ORDER; QUERY COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

EID: 77249105045     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147-164, 1992.
2. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
3. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
4. F. Athienitou and Y. Dimopoulos. Learning CP-networks: A preliminary investigation. In Adv. in Preference Handling (M-PREF), 2007.
5. J. Basilico and T. Hofmann. Unifying collaborative and content-based filtering. In ICML'04, pages 9-17, 2004.
6. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res., 21:135-191, 2004.
7. N. Bshouty. Exact learning boolean functions via the monotone theory. Information and Computation, 123(1):146-153, 1995.
8. C. Domshlak, R. Brafman, and S. Shimony. Preference-based configuration of web page content. In IJCAI'01, pages 1451-1456, 2001.
9. M. Frazier and L. Pitt. Classic learning. Machine Learning, 25(2-3):151-193, 1996.
10. P. Green and V. Srinivasan. Conjoint analysis in consumer research: Issues and outlook. J. Consumer Research, 5(2):103-123, 1978.
11. J. Lang and J. Mengin. The complexity of learning separable ceteris paribus preferences. In IJCAI'09 (these proceedings), 2009.
12. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4):285-318, 1988.
13. M. Sachdev. On learning of ceteris paribus preference theories. Master's thesis, Graduate Faculty of North Carolina State University, 2007.
14. C. Ziegler, G. Lausen, and J. Konstan. On exploiting classification taxonomies in recommender systems. AI Communications, 21(2-3):97-125, 2008.