Fast clustering for signed graphs based on random walk gap
Lists
Only you see this
Abstract
Highlights•We first propose a mechanism, called random walk gap, which can extract more cluster structure information.•We then propose a fast clustering algorithm for signed graphs (FCSG) based on random walk gap.•The proposed FCSG algorithm can be scaled for handling large-scale signed networks.•Experimental and comparison results demonstrate the efficiency and usefulness of the proposed FCSG algorithm.
BibTeX
@inproceedings{hua2020fast,
author = {Jialin Hua and Jian Yu and Miin-Shen Yang},
title = {{Fast clustering for signed graphs based on random walk gap}},
booktitle = {Soc. Networks},
year = {2020},
url = {https://openreview.net/forum?id=rJXE15l2xU},
}Loading related content...