arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.7367cs.DBcs.SI
收藏

具有最小熟人约束的地理社会群体规划

Geo-Social Group Queries with Minimum Acquaintance Constraint

Qijun Zhu, Haibo Hu, Cheng Xu, Jianliang Xu, Wang-Chien Lee

摘要:

基于位置的社交网络服务的繁荣使得地理社交群组查询能够用于基于群组的活动规划和营销。本文提出了一种新的家庭的地理社会群体查询与最小熟人约束(GSGQs),这是更有吸引力的比现有的地理社会群体查询方面产生一个有凝聚力的群体,保证最坏情况下的熟人水平。GSGQ,也指定了各种空间约束,比传统的空间查询更复杂,特别是,那些严格的$k$ NN空间约束被证明是NP-难的。为了有效地处理大型基于位置的社交网络上的一般GSGQ查询,我们设计了两个社会感知索引结构,即SaR树和SaR* 树。后者采用了一种新的聚类技术,同时考虑了空间和社会因素。基于SaR树和SaR* 树,提出了处理各种GSGQ的有效算法。在真实世界的Gowalla和大众点评数据集上的大量实验表明,我们提出的方法大大优于基于R树的基线算法。

英文摘要:

The prosperity of location-based social networking services enables geo-social group queries for group-based activity planning and marketing. This paper proposes a new family of geo-social group queries with minimum acquaintance constraint (GSGQs), which are more appealing than existing geo-social group queries in terms of producing a cohesive group that guarantees the worst-case acquaintance level. GSGQs, also specified with various spatial constraints, are more complex than conventional spatial queries; particularly, those with a strict $k$NN spatial constraint are proved to be NP-hard. For efficient processing of general GSGQ queries on large location-based social networks, we devise two social-aware index structures, namely SaR-tree and SaR*-tree. The latter features a novel clustering technique that considers both spatial and social factors. Based on SaR-tree and SaR*-tree, efficient algorithms are developed to process various GSGQs. Extensive experiments on real-world Gowalla and Dianping datasets show that our proposed methods substantially outperform the baseline algorithms based on R-tree.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑