LCHI:多个重叠的当地社区

Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics Pub Date : 2017-08-23 DOI:10.1145/3106426.3106438

Moeen Farasat, J. Scripps

{"title":"LCHI:多个重叠的当地社区","authors":"Moeen Farasat, J. Scripps","doi":"10.1145/3106426.3106438","DOIUrl":null,"url":null,"abstract":"Local community finding algorithms are helpful for finding communities around a seed node especially when the network is large and a global method is too slow. Most local methods find only a single community or are required to be run several times over different seed nodes to create multiple communities. In this paper, we present a new algorithm, LCHI that finds multiple, overlapping communities around a single node. Examples and analyses are presented support the effectiveness of LCHI.","PeriodicalId":20685,"journal":{"name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"LCHI: multiple, overlapping local communities\",\"authors\":\"Moeen Farasat, J. Scripps\",\"doi\":\"10.1145/3106426.3106438\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Local community finding algorithms are helpful for finding communities around a seed node especially when the network is large and a global method is too slow. Most local methods find only a single community or are required to be run several times over different seed nodes to create multiple communities. In this paper, we present a new algorithm, LCHI that finds multiple, overlapping communities around a single node. Examples and analyses are presented support the effectiveness of LCHI.\",\"PeriodicalId\":20685,\"journal\":{\"name\":\"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3106426.3106438\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3106426.3106438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

局部社区查找算法有助于在种子节点周围查找社区，特别是当网络较大且全局方法太慢时。大多数本地方法只能找到一个社区，或者需要在不同的种子节点上运行多次才能创建多个社区。在本文中，我们提出了一种新的算法LCHI，它可以在单个节点周围找到多个重叠的社区。实例和分析证明了LCHI的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

LCHI: multiple, overlapping local communities

Local community finding algorithms are helpful for finding communities around a seed node especially when the network is large and a global method is too slow. Most local methods find only a single community or are required to be run several times over different seed nodes to create multiple communities. In this paper, we present a new algorithm, LCHI that finds multiple, overlapping communities around a single node. Examples and analyses are presented support the effectiveness of LCHI.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics

自引率

0.00%

发文量