Efficient assembly of social semantic networks

Benjamin Markines, Heather Roinestad, F. Menczer
{"title":"Efficient assembly of social semantic networks","authors":"Benjamin Markines, Heather Roinestad, F. Menczer","doi":"10.1145/1379092.1379122","DOIUrl":null,"url":null,"abstract":"Social bookmarks allow Web users to actively annotate individual Web resources. Researchers are exploring the use of these annotations to create implicit links between online resources. We define an implicit link as a relationship between two online resources established by the Web community. An individual may create or reinforce a relationship between two resources by applying a common tag or organizing them in a common folder. This has led to the exploration of techniques for building networks of resources, categories, and people using the social annotations. In order for these techniques to move from the lab to the real world, efficient building and maintenance of these potentially large networks remains a major obstacle. Methods for assembling and indexing these large networks will allow researchers to run more rigorous assessments of their proposed techniques. Toward this goal we explore an approach from the sparse matrix literature and apply it to our system, GiveALink.org. We also investigate distributing the assembly, allowing us to grow the network with the body of resources, annotations, and users. Dividing the network is effective for assembling a global network where the implicit links are dependent on global properties. Additionally, we explore alternative implicit link measures that remove global dependencies and thus allow for the global network to be assembled incrementally, as each participant makes independent contributions. Finally we evaluate three scalable similarity measures, two of which require a revision of the data model underlying our social annotations.","PeriodicalId":285799,"journal":{"name":"Proceedings of the nineteenth ACM conference on Hypertext and hypermedia","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the nineteenth ACM conference on Hypertext and hypermedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1379092.1379122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Social bookmarks allow Web users to actively annotate individual Web resources. Researchers are exploring the use of these annotations to create implicit links between online resources. We define an implicit link as a relationship between two online resources established by the Web community. An individual may create or reinforce a relationship between two resources by applying a common tag or organizing them in a common folder. This has led to the exploration of techniques for building networks of resources, categories, and people using the social annotations. In order for these techniques to move from the lab to the real world, efficient building and maintenance of these potentially large networks remains a major obstacle. Methods for assembling and indexing these large networks will allow researchers to run more rigorous assessments of their proposed techniques. Toward this goal we explore an approach from the sparse matrix literature and apply it to our system, GiveALink.org. We also investigate distributing the assembly, allowing us to grow the network with the body of resources, annotations, and users. Dividing the network is effective for assembling a global network where the implicit links are dependent on global properties. Additionally, we explore alternative implicit link measures that remove global dependencies and thus allow for the global network to be assembled incrementally, as each participant makes independent contributions. Finally we evaluate three scalable similarity measures, two of which require a revision of the data model underlying our social annotations.
社会语义网络的高效组装
社交书签允许Web用户主动注释单个Web资源。研究人员正在探索使用这些注释来创建在线资源之间的隐式链接。我们将隐式链接定义为由Web社区建立的两个在线资源之间的关系。个人可以通过应用一个共同的标签或将它们组织在一个共同的文件夹中来创建或加强两个资源之间的关系。这导致了对构建资源、类别和使用社交注释的人的网络的技术的探索。为了使这些技术从实验室走向现实世界,有效地建立和维护这些潜在的大型网络仍然是一个主要障碍。收集和索引这些大型网络的方法将允许研究人员对他们提出的技术进行更严格的评估。为了实现这一目标,我们从稀疏矩阵文献中探索了一种方法,并将其应用于我们的系统GiveALink.org。我们还研究了程序集的分布,允许我们使用资源、注释和用户主体来扩展网络。划分网络对于构建全局网络是有效的,其中隐式链接依赖于全局属性。此外,我们还探索了其他隐式链接措施,这些措施消除了全球依赖性,从而允许全球网络逐步组装,因为每个参与者都做出了独立的贡献。最后,我们评估了三种可扩展的相似性度量,其中两种需要修改我们的社交注释的数据模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信