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

探索大型轮廓图中的社区

Exploring Communities in Large Profiled Graphs

Yankai Chen, Yixiang Fang, Reynold Cheng, Yun Li, Xiaojun Chen, Jie Zhang

摘要:

给定一个图$G$和一个顶点$q\in G$,社团搜索(CS)问题的目标是有效地找到$G$的一个子图,该子图的顶点与$q$密切相关。社区普遍存在于社会和生物网络中,可以用于产品广告和社会事件推荐。在本文中,我们研究了轮廓社区搜索(PCS),其中CS上进行轮廓图。这是一个图,其中每个顶点都有以分层方式排列的标签。大量的实验表明,PCS可以识别社区的主题是共同的顶点,是更有效的比现有的CS方法。由于PCS的简单解决方案非常昂贵,我们还开发了一个树索引,它有助于PCS的高效和在线解决方案。

英文摘要:

Given a graph $G$ and a vertex $q\in G$, the community search (CS) problem aims to efficiently find a subgraph of $G$ whose vertices are closely related to $q$. Communities are prevalent in social and biological networks, and can be used in product advertisement and social event recommendation. In this paper, we study profiled community search (PCS), where CS is performed on a profiled graph. This is a graph in which each vertex has labels arranged in a hierarchical manner. Extensive experiments show that PCS can identify communities with themes that are common to their vertices, and is more effective than existing CS approaches. As a naive solution for PCS is highly expensive, we have also developed a tree index, which facilitate efficient and online solutions for PCS.

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

↑