The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Robust Ensemble Clustering Using Probability Trajectories
Open accessAbstract
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorporate global information to refine the local links. To address these two limitations, in this paper, we propose a novel ensemble clustering approach based on sparse graph representation and probability trajectory analysis. In particular, we present the elite neighbor selection strategy to identify the uncertain links by locally adaptive thresholds and build a sparse graph with a small number of probably reliable links. We argue that a small number of probably reliable links can lead to significantly better consensus results than using all graph links regardless of their reliability. The random walk process driven by a new transition probability matrix is utilized to explore the global information in the graph. We derive a novel and dense similarity measure from the sparse graph by analyzing the probability trajectories of the random walkers, based on which two consensus functions are further proposed. Experimental results on multiple real-world datasets demonstrate the effectiveness and efficiency of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 1×
“Index Terms—Ensemble clustering, consensus clustering, uncertain links, random walk, probability trajectory F”
Background
Cited by
Locally Weighted Ensemble Clustering
Huang, D., Wang, C.-D., & Lai, J.-H. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2702343 · Cited by 371
Self-citationBlind PRNU-Based Image Clustering for Source Identification
Marra, F., Poggi, G., Sansone, C., & Verdoliva, L. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2701335 · Cited by 84
Metadata
- Authors
- Huang, D., Lai, J.-H., & Wang, C.-D.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2016-05-01
- Volume
- 28
- Issue
- 5
- Pages
- 1312-1326
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W3101747232
- Cited by
- 192
- References
- 2
- FWCI
- 9.38
- Type
- journal article
- Language
- en
- Open access
- green
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: Robust Ensemble Clustering Using Probability Trajectories. https://app.cochat.ai/papers/10.1109/tkde.2015.2503753
- The paper
- Huang, D., Lai, J.-H., & Wang, C.-D. (2016). Robust Ensemble Clustering Using Probability Trajectories. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2015.2503753
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.