集体可以使用搜索帮助吗?

D. Dicheva, Christo Dichev
{"title":"集体可以使用搜索帮助吗?","authors":"D. Dicheva, Christo Dichev","doi":"10.1109/CyberC.2011.14","DOIUrl":null,"url":null,"abstract":"In this paper we propose a \"find similar\" method intended to extend the searching capabilities of digital collections targeting educational and academic domains. Given a document, the described algorithm finds similar documents that may be of interest to the user. It exploits the metadata typical for the participatory web. In the adopted model, documents are viewed as objects associated with a set of tags and a set of users who have tagged them, inducing tag-based and user-based similarity. The similarity between two documents is computed as a combination of their tag-base and, user-based cosine similarity and the document recency. We have con-ducted a series of experiments using a CiteULike dump to investigate the properties of the proposed similarity measure. The experimental results indicate that the algorithm exploiting meta-information about the documents provides a good approximation of our understanding of the contextual dependency of the notion of similarity.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Can Collective Use Help for Searching?\",\"authors\":\"D. Dicheva, Christo Dichev\",\"doi\":\"10.1109/CyberC.2011.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a \\\"find similar\\\" method intended to extend the searching capabilities of digital collections targeting educational and academic domains. Given a document, the described algorithm finds similar documents that may be of interest to the user. It exploits the metadata typical for the participatory web. In the adopted model, documents are viewed as objects associated with a set of tags and a set of users who have tagged them, inducing tag-based and user-based similarity. The similarity between two documents is computed as a combination of their tag-base and, user-based cosine similarity and the document recency. We have con-ducted a series of experiments using a CiteULike dump to investigate the properties of the proposed similarity measure. The experimental results indicate that the algorithm exploiting meta-information about the documents provides a good approximation of our understanding of the contextual dependency of the notion of similarity.\",\"PeriodicalId\":227472,\"journal\":{\"name\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2011.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种“寻找相似”的方法,旨在扩展针对教育和学术领域的数字馆藏的搜索能力。给定一个文档,所描述的算法查找用户可能感兴趣的类似文档。它利用了参与式网络的典型元数据。在采用的模型中,文档被视为与一组标记和一组标记了它们的用户相关联的对象,从而产生基于标记和基于用户的相似性。两个文档之间的相似度计算为其基于标记和基于用户的余弦相似度和文档近日来的组合。我们使用CiteULike转储进行了一系列实验,以研究所建议的相似性度量的属性。实验结果表明,利用关于文档的元信息的算法很好地近似了我们对相似性概念的上下文依赖性的理解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Can Collective Use Help for Searching?
In this paper we propose a "find similar" method intended to extend the searching capabilities of digital collections targeting educational and academic domains. Given a document, the described algorithm finds similar documents that may be of interest to the user. It exploits the metadata typical for the participatory web. In the adopted model, documents are viewed as objects associated with a set of tags and a set of users who have tagged them, inducing tag-based and user-based similarity. The similarity between two documents is computed as a combination of their tag-base and, user-based cosine similarity and the document recency. We have con-ducted a series of experiments using a CiteULike dump to investigate the properties of the proposed similarity measure. The experimental results indicate that the algorithm exploiting meta-information about the documents provides a good approximation of our understanding of the contextual dependency of the notion of similarity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信