| Type of Document |
Master's Thesis |
| Author |
Sachdev, Manish Prakash, |
| Author's Email Address |
manishpsachdev@gmail.com |
| URN |
etd-03212007-024741 |
| Title |
On Learning of Ceteris Paribus Preference Theories |
| Degree |
Master of Science |
| Graduate Program |
Computer Science |
| Advisory Committee |
| Advisor Name |
Title |
| Dr. Jon Doyle |
Committee Chair |
| Dr. Dennis Bahler |
Committee Member |
| Dr. Munindar P. Singh |
Committee Member |
|
| Keywords |
- preference learning
- ceteris pairbus preferences
- preference mining
|
| Date of Defense |
2007-03-22 |
| Availability |
unrestricted |
Abstract
The problem of preference elicitation has been of interest for a long time. While traditional methods of asking a set of relevant questions are still useful, the availability of user-preference data from the web has led to substantial attention to the notion of preference mining. In this thesis, we consider the problem of learning logical preference theories that express preference orderings over alternatives.
We present learning algorithms which accept as input a set of comparisons between pairs of complete descriptions of world states. Our first algorithm, that performs exact learning, accepts the complete set of preference orderings for a theory and generates a theory which provides the same ordering of states as the input. This process can require looking at an exponential number of data points. We then look at more realistic approximation algorithms and analyze the complexity of the learning problem under the framework of Probably Approximately Correct (PAC) learning. We then describe approximation algorithms for learning high-level summaries of the underlying theory.
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
etd.pdf |
428.03 Kb |
00:01:58 |
00:01:01 |
00:00:53 |
00:00:26 |
00:00:02 |
|
