Smart filters for social retrieval

Balaji Vasan Srinivasan, Tanya Goyal, N. M. Nainani, Kartik K. Sreenivasan
{"title":"Smart filters for social retrieval","authors":"Balaji Vasan Srinivasan, Tanya Goyal, N. M. Nainani, Kartik K. Sreenivasan","doi":"10.1145/2888451.2888457","DOIUrl":null,"url":null,"abstract":"Social media platform are increasingly becoming a rich source of information for capturing the views and opinions of online customers. Major brands listen to the social streams to understand the general pulse of their online community. The foremost task here is to construct a \"filter\" to fetch the brand-relevant data from the social streams. Due to the nature of social platforms, simple filters/queries for retrieval yield a lot of noise leading to a need for complicated filters. Constructing such complicated filters is a non-trivial task and requires significant time-investment from a social marketer. In this paper, we propose a method to automate this task by expanding a seed set of watch keywords to maximize the number of retrieved relevant social feeds around the brand and combining them appropriately into a social query. We show the strengths and weaknesses of the proposed approach in the light of real-world social feeds for various brands.","PeriodicalId":136431,"journal":{"name":"Proceedings of the 3rd IKDD Conference on Data Science, 2016","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd IKDD Conference on Data Science, 2016","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2888451.2888457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Social media platform are increasingly becoming a rich source of information for capturing the views and opinions of online customers. Major brands listen to the social streams to understand the general pulse of their online community. The foremost task here is to construct a "filter" to fetch the brand-relevant data from the social streams. Due to the nature of social platforms, simple filters/queries for retrieval yield a lot of noise leading to a need for complicated filters. Constructing such complicated filters is a non-trivial task and requires significant time-investment from a social marketer. In this paper, we propose a method to automate this task by expanding a seed set of watch keywords to maximize the number of retrieved relevant social feeds around the brand and combining them appropriately into a social query. We show the strengths and weaknesses of the proposed approach in the light of real-world social feeds for various brands.
用于社会检索的智能过滤器
社交媒体平台正日益成为捕捉在线客户观点和意见的丰富信息来源。各大品牌通过收听社交流来了解其在线社区的总体脉搏。这里最重要的任务是构建一个“过滤器”,从社交流中获取与品牌相关的数据。由于社交平台的性质,用于检索的简单过滤器/查询会产生大量噪音,从而需要复杂的过滤器。构建如此复杂的过滤器是一项不平凡的任务,需要社会营销人员投入大量时间。在本文中,我们提出了一种自动化这项任务的方法,通过扩展观察关键字的种子集来最大化围绕品牌检索的相关社交提要的数量,并将它们适当地组合到社交查询中。我们将根据各种品牌的真实社交feed来展示所建议方法的优势和劣势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信