Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 394

The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.

Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition

Gong, Maoguo, Cai, Qing, Chen, Xiaowei, Ma, Lijia·2014·IEEE Transactions on Evolutionary Computation

Abstract

The field of complex network clustering has been very active in the past several years. In this paper, a discrete framework of the particle swarm optimization algorithm is proposed. Based on the proposed discrete framework, a multiobjective discrete particle swarm optimization algorithm is proposed to solve the network clustering problem. The decomposition mechanism is adopted. A problem-specific population initialization method based on label propagation and a turbulence operator are introduced. In the proposed method, two evaluation objectives termed as kernel k-means and ratio cut are to be minimized. However, the two objectives can only be used to handle unsigned networks. In order to deal with signed networks, they have been extended to the signed version. The clustering performances of the proposed algorithm have been validated on signed networks and unsigned networks. Extensive experimental studies compared with ten state-of-the-art approaches prove that the proposed algorithm is effective and promising.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tevc.2013.2260862

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 60 references

Cited by

See all 394

Metadata

Authors
Gong, M., Cai, Q., Chen, X., & Ma, L.
Venue
IEEE Transactions on Evolutionary Computation
Published
2014-02
Volume
18
Issue
1
Pages
82-97
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2097464974
Cited by
394
References
60
FWCI
18.89
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition. https://app.cochat.ai/papers/10.1109/tevc.2013.2260862
The paper
Gong, M., Cai, Q., Chen, X., & Ma, L. (2014). Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2013.2260862

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.