查询在线团体网络中的隐藏属性

Azade Nazi, Saravanan Thirumuruganathan, Vagelis Hristidis, Nan Zhang, Gautam Das
{"title":"查询在线团体网络中的隐藏属性","authors":"Azade Nazi, Saravanan Thirumuruganathan, Vagelis Hristidis, Nan Zhang, Gautam Das","doi":"10.1109/MASS.2015.74","DOIUrl":null,"url":null,"abstract":"An online community network such as Twitter, Yelp or amazon.com links entities (e.g., Users, products) with various relationships (e.g., Friendship, co-purchase, co-review) and make such information available for access through a web interface. Often, these community networks act as \"social sensors\" in which users sense information in the real world and mention them online. The web interfaces of these networks often support features such as keyword search that allow an user to quickly find entities of interest. While these interfaces are adequate for regular users, they are often too restrictive to answer complex queries such as (1) find 100 Twitter users from California with at least 100 followers who talked about earthquakes last year or (2) find 25 restaurants in Yelp with at least 10 5-star reviews with 10 or more 'useful' points. In this paper, we investigate the problem of answering complex queries that involve non-searchable attributes through the web interface of an online community network. We model such a network as a heterogeneous graph with two access channels, Content Search and Local Search. We propose a number of efficient algorithms that leverage properties of the heterogeneous graph and also propose a strategy selection algorithm based on the concept of multi-armed bandits. We conduct comprehensive experiments over popular social sensing websites such as Twitter and amazon.com which demonstrate the efficacy of our proposed algorithms.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Querying Hidden Attributes in an Online Community Network\",\"authors\":\"Azade Nazi, Saravanan Thirumuruganathan, Vagelis Hristidis, Nan Zhang, Gautam Das\",\"doi\":\"10.1109/MASS.2015.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An online community network such as Twitter, Yelp or amazon.com links entities (e.g., Users, products) with various relationships (e.g., Friendship, co-purchase, co-review) and make such information available for access through a web interface. Often, these community networks act as \\\"social sensors\\\" in which users sense information in the real world and mention them online. The web interfaces of these networks often support features such as keyword search that allow an user to quickly find entities of interest. While these interfaces are adequate for regular users, they are often too restrictive to answer complex queries such as (1) find 100 Twitter users from California with at least 100 followers who talked about earthquakes last year or (2) find 25 restaurants in Yelp with at least 10 5-star reviews with 10 or more 'useful' points. In this paper, we investigate the problem of answering complex queries that involve non-searchable attributes through the web interface of an online community network. We model such a network as a heterogeneous graph with two access channels, Content Search and Local Search. We propose a number of efficient algorithms that leverage properties of the heterogeneous graph and also propose a strategy selection algorithm based on the concept of multi-armed bandits. We conduct comprehensive experiments over popular social sensing websites such as Twitter and amazon.com which demonstrate the efficacy of our proposed algorithms.\",\"PeriodicalId\":436496,\"journal\":{\"name\":\"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASS.2015.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS.2015.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在线社区网络,如Twitter、Yelp或amazon.com,将具有各种关系(如友谊、共同购买、共同评论)的实体(如用户、产品)链接起来,并使这些信息可通过网络界面访问。通常,这些社区网络充当“社会传感器”,用户在其中感知现实世界中的信息并在网上提及它们。这些网络的web界面通常支持关键字搜索等功能,允许用户快速找到感兴趣的实体。虽然这些界面对于普通用户来说是足够的,但它们往往过于限制,无法回答复杂的查询,比如(1)找到100个来自加利福尼亚的Twitter用户,其中至少有100个粉丝谈论了去年的地震,或者(2)在Yelp上找到25家餐馆,至少有10个5星评论,10个或更多的“有用”点。在本文中,我们研究了通过在线社区网络的web界面回答涉及不可搜索属性的复杂查询的问题。我们将这种网络建模为具有两个访问通道(内容搜索和本地搜索)的异构图。我们提出了一些利用异构图特性的高效算法,并提出了一种基于多臂强盗概念的策略选择算法。我们在流行的社会传感网站(如Twitter和amazon.com)上进行了全面的实验,证明了我们提出的算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Querying Hidden Attributes in an Online Community Network
An online community network such as Twitter, Yelp or amazon.com links entities (e.g., Users, products) with various relationships (e.g., Friendship, co-purchase, co-review) and make such information available for access through a web interface. Often, these community networks act as "social sensors" in which users sense information in the real world and mention them online. The web interfaces of these networks often support features such as keyword search that allow an user to quickly find entities of interest. While these interfaces are adequate for regular users, they are often too restrictive to answer complex queries such as (1) find 100 Twitter users from California with at least 100 followers who talked about earthquakes last year or (2) find 25 restaurants in Yelp with at least 10 5-star reviews with 10 or more 'useful' points. In this paper, we investigate the problem of answering complex queries that involve non-searchable attributes through the web interface of an online community network. We model such a network as a heterogeneous graph with two access channels, Content Search and Local Search. We propose a number of efficient algorithms that leverage properties of the heterogeneous graph and also propose a strategy selection algorithm based on the concept of multi-armed bandits. We conduct comprehensive experiments over popular social sensing websites such as Twitter and amazon.com which demonstrate the efficacy of our proposed algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic Provisioning for High Energy Efficiency and Resource Utilization in Cloud RANs An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks MQCC: Maximum Queue Congestion Control for Multipath Networks with Blockage Context-Aware Crowd-Sensing in Opportunistic Mobile Social Networks Study of Hadoop-MapReduce on Google N-Gram Datasets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1