利用关联数据结构进行社会感知搜索应用

André Langer, M. Krug, Luis Moreno, M. Gaedke
{"title":"利用关联数据结构进行社会感知搜索应用","authors":"André Langer, M. Krug, Luis Moreno, M. Gaedke","doi":"10.18420/in2017_190","DOIUrl":null,"url":null,"abstract":"Improving the user experience and conversion rate by means of personalization is of major importance for modern e-commerce applications. Several publications in the past have already dealt with the topic of adaptive search result ranking and appropriate ranking metrics. Newer approaches also took personalized ranking attributes of a connected Social Web platform into account to form so called Social Commerce Applications. However, these approaches were often limited to data silos of closed-platform data providers and none of the contributions discussed the benefits of Linked Data in building social-aware e-commerce applications so far. Therefore, we present a first formalization of a scoring model for a social-aware search approach that takes user interaction from multiple social networks into account. In contrast to other existing solutions, our approach focuses on a Linked Data information management in order to easily combine social data from different social networks. We analyze the possible influence of friend activities to the relevance of a person’s search intent and how it can be combined with other ranking factors in a formalized scoring model. As a result, we implement a first demonstrator built upon RDF data to show how an application can present the user an adaptive search result list depending on the users’ current social context.","PeriodicalId":434189,"journal":{"name":"GI-Jahrestagung","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Utilizing Linked Data Structures for Social-aware Search Applications\",\"authors\":\"André Langer, M. Krug, Luis Moreno, M. Gaedke\",\"doi\":\"10.18420/in2017_190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Improving the user experience and conversion rate by means of personalization is of major importance for modern e-commerce applications. Several publications in the past have already dealt with the topic of adaptive search result ranking and appropriate ranking metrics. Newer approaches also took personalized ranking attributes of a connected Social Web platform into account to form so called Social Commerce Applications. However, these approaches were often limited to data silos of closed-platform data providers and none of the contributions discussed the benefits of Linked Data in building social-aware e-commerce applications so far. Therefore, we present a first formalization of a scoring model for a social-aware search approach that takes user interaction from multiple social networks into account. In contrast to other existing solutions, our approach focuses on a Linked Data information management in order to easily combine social data from different social networks. We analyze the possible influence of friend activities to the relevance of a person’s search intent and how it can be combined with other ranking factors in a formalized scoring model. As a result, we implement a first demonstrator built upon RDF data to show how an application can present the user an adaptive search result list depending on the users’ current social context.\",\"PeriodicalId\":434189,\"journal\":{\"name\":\"GI-Jahrestagung\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GI-Jahrestagung\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18420/in2017_190\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GI-Jahrestagung","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18420/in2017_190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

通过个性化手段提高用户体验和转化率对于现代电子商务应用具有重要意义。过去的一些出版物已经讨论了自适应搜索结果排名和适当排名指标的主题。更新的方法还考虑到连接的社交网络平台的个性化排名属性,形成所谓的社交商务应用程序。然而,这些方法通常局限于封闭平台数据提供商的数据孤岛,迄今为止,没有任何一篇文章讨论关联数据在构建社交意识电子商务应用程序中的好处。因此,我们提出了社会意识搜索方法的评分模型的第一个形式化,该方法将来自多个社交网络的用户交互考虑在内。与其他现有解决方案相比,我们的方法侧重于关联数据信息管理,以便轻松组合来自不同社交网络的社交数据。我们分析了朋友活动对个人搜索意图相关性的可能影响,以及如何将其与形式化评分模型中的其他排名因素结合起来。因此,我们实现了基于RDF数据构建的第一个演示程序,以展示应用程序如何根据用户当前的社会上下文为用户提供自适应搜索结果列表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Utilizing Linked Data Structures for Social-aware Search Applications
Improving the user experience and conversion rate by means of personalization is of major importance for modern e-commerce applications. Several publications in the past have already dealt with the topic of adaptive search result ranking and appropriate ranking metrics. Newer approaches also took personalized ranking attributes of a connected Social Web platform into account to form so called Social Commerce Applications. However, these approaches were often limited to data silos of closed-platform data providers and none of the contributions discussed the benefits of Linked Data in building social-aware e-commerce applications so far. Therefore, we present a first formalization of a scoring model for a social-aware search approach that takes user interaction from multiple social networks into account. In contrast to other existing solutions, our approach focuses on a Linked Data information management in order to easily combine social data from different social networks. We analyze the possible influence of friend activities to the relevance of a person’s search intent and how it can be combined with other ranking factors in a formalized scoring model. As a result, we implement a first demonstrator built upon RDF data to show how an application can present the user an adaptive search result list depending on the users’ current social context.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信