An Information Theoretic Approach for Ontology-based Interest Matching
暂无分享,去创建一个
Designing a general algorithm for interest matching is a major challenge in building online community and agent-based communication networks. This paper presents an information theoretic concept-matching approach to measure degrees of similarity among users. Kullback-Leiber distance is used as a measure of similarity on users represented by concept hierarchy. Preliminary sensitivity analysis shows that KL distance has more interesting properties and is more noise tolerant than keyword-overlap approaches. A multi-agent system has also been built to deploy the interest-matching algorithm.
[1] John Riedl,et al. GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.
[2] L. N. Foner,et al. A multi-agent, referral based matchmaking system , 1997 .
[3] Matthias Klusch,et al. Matchmaking among Heterogeneous Agents on the Internet , 1999 .