Electronic Commerce Research Laboratory 网络安全实 电子商务研究实验室网络安全实.pptVIP

Electronic Commerce Research Laboratory 网络安全实 电子商务研究实验室网络安全实.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Andare piu’ veloce qui * The Spearman footrule distance (of two ranked lists) is the sum over all the elements of the absolute difference of their rank. * Kemeny distance is the number of pairwise disagreements. So it is the number of permutations to modify one ranked list in the other. Both rank aggregations are optimal but they are different. Both aggregations are kemeny optimal. Because a better one should have 0 distance from one of the two lists (to get global distance =1) but the first one has distance 2 from the second list (and vice versa) so the minimum is 2. * * This function is maximized by any sorting of the test items in decreasing value of their ratings Andare veloce qui – dire solo quello di sopra. * * pseudo-random伪随机:group中用户随机聚合,但是内部成员之间存在一定的关系 * 为什么随机的方法nDCG值也很高,主要原因在于对于一个长度为5的排序序列,随机排序平均nDCG值都能达到0.91,所以会很高 * * C’e’ quella linea verticale sopra perche’ il massimo del gain e’ comunque quello per il group recommendation che ottiene NDCG = 1. Infatti, per esempio quando la individual ha NDCG = 0.95 il gain puo’ al massimo essere 0.05, ovvero quando la group recommendation vale 1. * C’e’ quella linea verticale sopra perche’ il massimo del gain e’ comunque quello per il group recommendation che ottiene NDCG = 1. Infatti, per esempio quando la individual ha NDCG = 0.95 il gain puo’ al massimo essere 0.05, ovvero quando la group recommendation vale 1. * This result motivated the following experiment * where we look at the correlation between the average similarity of a user to the other group members and the effectiveness of the group recommendations for this user. * Rank aggregation techniques 为group recommendation提供了实现的可能 * * Group Recommendations with Rank Aggregation and Collaborative Filtering Linas Baltrunas, Tadas Makcinskas, Francesco Ricci Free University of Bozen-Bolzano Italy fricci@unibz.it Motivations Rank aggregation techniques are useful for building meta search engines, selecting documents satisfying multiple criteria, and spam reducti

您可能关注的文档

文档评论(0)

chenchend + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档