arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0309013cs.IRcond-mat.dis-nncond-mat.stat-mechcs.AIcs.DLcs.HCcs.MA
收藏

文档网络的半度量行为及其在推荐系统中的应用

Semi-metric Behavior in Document Networks and its Application to Recommendation Systems

L. M. Rocha

摘要:

针对不同文档网络(DN)(如万维网(WWW)和数字图书馆)的推荐系统通常使用从文档和关键字之间的关系提取的距离函数。例如,万维网中的文件通过超链接网络相关联,而书目数据库中的文件通过引用和协作网络相关联。此外,文档与关键词相关。从这些关系计算的距离函数在DN的项目之间建立关联网络,称为距离图,其允许推荐系统识别个体用户的相关关联。然而,现代推荐系统需要集成来自多个源的关联数据,例如不同的数据库,网站,甚至其他用户。因此,我们提出了一个问题,结合证据(项目之间的关联)从不同的来源,其特征在于距离函数。在本文中,我们描述了我们的工作(1)推断相关的关联,以及表征,半度量距离图和(2)在推荐系统中结合证据从不同的距离图。关于(1),我们提出了半度量距离图的概念,并引入比率来度量半度量行为。我们计算这些比率的几个DN,如数字图书馆和网站,并表明它们是有用的,以确定隐含的关联。关于(2),我们描述了一个算法来结合证据的距离图,使用证据集,一个集结构的基础上区间值模糊集和Dempster-Shafer证据理论。该算法已被开发为一个名为TalkMine推荐系统。

英文摘要:

Recommendation systems for different Document Networks (DN) such as the World Wide Web (WWW) and Digital Libraries, often use distance functions extracted from relationships among documents and keywords. For instance, documents in the WWW are related via a hyperlink network, while documents in bibliographic databases are related by citation and collaboration networks. Furthermore, documents are related to keyterms. The distance functions computed from these relations establish associative networks among items of the DN, referred to as Distance Graphs, which allow recommendation systems to identify relevant associations for individual users. However, modern recommendation systems need to integrate associative data from multiple sources such as different databases, web sites, and even other users. Thus, we are presented with a problem of combining evidence (about associations between items) from different sources characterized by distance functions. In this paper we describe our work on (1) inferring relevant associations from, as well as characterizing, semi-metric distance graphs and (2) combining evidence from different distance graphs in a recommendation system. Regarding (1), we present the idea of semi-metric distance graphs, and introduce ratios to measure semi-metric behavior. We compute these ratios for several DN such as digital libraries and web sites and show that they are useful to identify implicit associations. Regarding (2), we describe an algorithm to combine evidence from distance graphs that uses Evidence Sets, a set structure based on Interval Valued Fuzzy Sets and Dempster-Shafer Theory of Evidence. This algorithm has been developed for a recommendation system named TalkMine.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑