The multi-walker chain and its application in local community detection

Yuchen Bian, Jingchao Ni, Wei Cheng, Xiang Zhang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Local community detection (or local clustering) is of fundamental importance in large network analysis. Random walk-based methods have been routinely used in this task. Most existing random walk methods are based on the single-walker model. However, without any guidance, a single walker may not be adequate to effectively capture the local cluster. In this paper, we study a multi-walker chain (MWC) model, which allows multiple walkers to explore the network. Each walker is influenced (or pulled back) by all other walkers when deciding the next steps. This helps the walkers to stay as a group and within the cluster. We introduce two measures based on the mean and standard deviation of the visiting probabilities of the walkers. These measures not only can accurately identify the local cluster, but also help detect the cluster center and boundary, which cannot be achieved by the existing single-walker methods. We provide rigorous theoretical foundation for MWC and devise efficient algorithms to compute it. Extensive experimental results on a variety of real-world and synthetic networks demonstrate that MWC outperforms the state-of-the-art local community detection methods by a large margin.

Original languageEnglish (US)
Pages (from-to)1663-1691
Number of pages29
JournalKnowledge and Information Systems
Volume60
Issue number3
DOIs
StatePublished - Sep 1 2019

Fingerprint

Electric network analysis

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Human-Computer Interaction
  • Hardware and Architecture
  • Artificial Intelligence

Cite this

Bian, Yuchen ; Ni, Jingchao ; Cheng, Wei ; Zhang, Xiang. / The multi-walker chain and its application in local community detection. In: Knowledge and Information Systems. 2019 ; Vol. 60, No. 3. pp. 1663-1691.
@article{2797bc4f635847e88dad7853d1ace565,
title = "The multi-walker chain and its application in local community detection",
abstract = "Local community detection (or local clustering) is of fundamental importance in large network analysis. Random walk-based methods have been routinely used in this task. Most existing random walk methods are based on the single-walker model. However, without any guidance, a single walker may not be adequate to effectively capture the local cluster. In this paper, we study a multi-walker chain (MWC) model, which allows multiple walkers to explore the network. Each walker is influenced (or pulled back) by all other walkers when deciding the next steps. This helps the walkers to stay as a group and within the cluster. We introduce two measures based on the mean and standard deviation of the visiting probabilities of the walkers. These measures not only can accurately identify the local cluster, but also help detect the cluster center and boundary, which cannot be achieved by the existing single-walker methods. We provide rigorous theoretical foundation for MWC and devise efficient algorithms to compute it. Extensive experimental results on a variety of real-world and synthetic networks demonstrate that MWC outperforms the state-of-the-art local community detection methods by a large margin.",
author = "Yuchen Bian and Jingchao Ni and Wei Cheng and Xiang Zhang",
year = "2019",
month = "9",
day = "1",
doi = "10.1007/s10115-018-1247-1",
language = "English (US)",
volume = "60",
pages = "1663--1691",
journal = "Knowledge and Information Systems",
issn = "0219-1377",
publisher = "Springer London",
number = "3",

}

The multi-walker chain and its application in local community detection. / Bian, Yuchen; Ni, Jingchao; Cheng, Wei; Zhang, Xiang.

In: Knowledge and Information Systems, Vol. 60, No. 3, 01.09.2019, p. 1663-1691.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The multi-walker chain and its application in local community detection

AU - Bian, Yuchen

AU - Ni, Jingchao

AU - Cheng, Wei

AU - Zhang, Xiang

PY - 2019/9/1

Y1 - 2019/9/1

N2 - Local community detection (or local clustering) is of fundamental importance in large network analysis. Random walk-based methods have been routinely used in this task. Most existing random walk methods are based on the single-walker model. However, without any guidance, a single walker may not be adequate to effectively capture the local cluster. In this paper, we study a multi-walker chain (MWC) model, which allows multiple walkers to explore the network. Each walker is influenced (or pulled back) by all other walkers when deciding the next steps. This helps the walkers to stay as a group and within the cluster. We introduce two measures based on the mean and standard deviation of the visiting probabilities of the walkers. These measures not only can accurately identify the local cluster, but also help detect the cluster center and boundary, which cannot be achieved by the existing single-walker methods. We provide rigorous theoretical foundation for MWC and devise efficient algorithms to compute it. Extensive experimental results on a variety of real-world and synthetic networks demonstrate that MWC outperforms the state-of-the-art local community detection methods by a large margin.

AB - Local community detection (or local clustering) is of fundamental importance in large network analysis. Random walk-based methods have been routinely used in this task. Most existing random walk methods are based on the single-walker model. However, without any guidance, a single walker may not be adequate to effectively capture the local cluster. In this paper, we study a multi-walker chain (MWC) model, which allows multiple walkers to explore the network. Each walker is influenced (or pulled back) by all other walkers when deciding the next steps. This helps the walkers to stay as a group and within the cluster. We introduce two measures based on the mean and standard deviation of the visiting probabilities of the walkers. These measures not only can accurately identify the local cluster, but also help detect the cluster center and boundary, which cannot be achieved by the existing single-walker methods. We provide rigorous theoretical foundation for MWC and devise efficient algorithms to compute it. Extensive experimental results on a variety of real-world and synthetic networks demonstrate that MWC outperforms the state-of-the-art local community detection methods by a large margin.

UR - http://www.scopus.com/inward/record.url?scp=85054556587&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054556587&partnerID=8YFLogxK

U2 - 10.1007/s10115-018-1247-1

DO - 10.1007/s10115-018-1247-1

M3 - Article

AN - SCOPUS:85054556587

VL - 60

SP - 1663

EP - 1691

JO - Knowledge and Information Systems

JF - Knowledge and Information Systems

SN - 0219-1377

IS - 3

ER -