Interest-matching comparisons using CP-nets

Authors:
Andrew W. Wicker;Jon Doyle
Affiliations:
Department of Computer Science, North Carolina State University, Raleigh, NC;Department of Computer Science, North Carolina State University, Raleigh, NC
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 3
Cited 0

A Logic of Relative Desire (Preliminary Report)

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Reasoning with conditional ceteris paribus preference statements

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formation of internet-based social networks has revived research on traditional social network models as well as interest-matching, or match-making, systems. In order to automate or augment the process of interest-matching, we describe a method for the comparison of preference orderings represented by CP-nets, which allows one to determine a shared interest level between agents. Empirical results suggest that this distance measure for preference orderings agrees with the intuitive assessment of shared interest levels.