On the public citation graph

A Novel Cluster Ensemble based on a Single Clustering Algorithm

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/sam.10098openalex-snapshot
Bayesian cluster ensembles
inferredcites →https://doi.org/10.1007/s13042-017-0756-7openalex-snapshot
Clustering ensemble method
inferredcites →https://doi.org/10.1016/j.cosrev.2018.01.003openalex-snapshot
Cluster ensembles: A survey of approaches with recent extensions and applications
inferredcites →https://doi.org/10.1016/j.engappai.2019.103307openalex-snapshot
A new multi-objective differential evolution approach for simultaneous clustering and feature selection
inferredcites →https://doi.org/10.1016/j.eswa.2015.04.069openalex-snapshot
A robust unsupervised consensus control chart pattern recognition framework
inferredcites →https://doi.org/10.1016/j.knosys.2005.11.003openalex-snapshot
Clusterer ensemble
inferredcites →https://doi.org/10.1016/j.knosys.2015.10.006openalex-snapshot
Hierarchical cluster ensemble model based on knowledge granulation
inferredcites →https://doi.org/10.1016/j.patcog.2020.107207openalex-snapshot
Auto-weighted multi-view co-clustering via fast matrix factorization
inferredcites →https://doi.org/10.1016/j.patrec.2009.09.011openalex-snapshot
Data clustering: 50 years beyond K-means
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/icdm.2015.145openalex-snapshot
Weighted Spectral Cluster Ensemble
inferredcites →https://doi.org/10.1109/icdmw.2009.46openalex-snapshot
MSRA-MM 2.0: A Large-Scale Web Multimedia Dataset
inferredcites →https://doi.org/10.1109/icecc.2012.782openalex-snapshot
The Method of Cluster Ensemble Based on Minimum Redundancy Feature Subset
inferredcites →https://doi.org/10.1109/icime.2010.5478054openalex-snapshot
Semi-supervised cluster ensemble based on binary similarity matrix
inferredcites →https://doi.org/10.1109/tcyb.2016.2569529openalex-snapshot
Distribution-Based Cluster Structure Selection
inferredcites →https://doi.org/10.1109/tim.2015.2450354openalex-snapshot
Unsupervised Consensus Clustering of Acoustic Emission Time-Series for Robust Damage Sequence Estimation in Composites
inferredcites →https://doi.org/10.1109/tkde.2015.2503743openalex-snapshot
Multi-View Clustering Based on Belief Propagation
inferredcites →https://doi.org/10.1109/tpami.2005.113openalex-snapshot
Combining multiple clusterings using evidence accumulation
inferredcites →https://doi.org/10.1109/tpami.2005.237openalex-snapshot
Clustering ensembles: models of consensus and weak partitions
inferredcites →https://doi.org/10.1109/tsmc.2013.2281963openalex-snapshot
An Ontology-Based Text Mining Method to Develop D-Matrix From Unstructured Text
inferredcites →https://doi.org/10.1109/tsmca.2012.2208186openalex-snapshot
The TFC Model: Tensor Factorization and Tag Clustering for Item Recommendation in Social Tagging Systems
inferredcites →https://doi.org/10.1126/science.1136800openalex-snapshot
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1126/science.1242072openalex-snapshot
Clustering by fast search and find of density peaks
inferredcites →https://doi.org/10.1162/153244303321897735openalex-snapshot
10.1162/153244303321897735
inferredcites →https://doi.org/10.1371/journal.pone.0144059openalex-snapshot
A Comparison Study on Similarity and Dissimilarity Measures in Clustering Continuous Data
inferredcites →https://doi.org/10.15439/2014f258openalex-snapshot
An Optimized Version of the K-Means Clustering Algorithm
inferredcites →https://doi.org/10.15439/2016f231openalex-snapshot
Evaluation of an Optimized K-Means Algorithm Based on Real Data
inferredcites →https://doi.org/10.3233/ifs-141518openalex-snapshot
A hierarchical fuzzy cluster ensemble approach and its application to big data clustering
inferredcites →https://doi.org/10.48550/arxiv.1208.4138openalex-snapshot
Semi-supervised Clustering Ensemble by Voting

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4827273openalex-extracted
Clustering by Constrained Gravitational Law Based on Multiple Sub-Centroids
inferred← citeshttps://doi.org/10.36227/techrxiv.170327363.35625494/v1openalex-snapshot
Gravity Sub-centroids for Optimal Clustering
inferred← citeshttps://doi.org/10.52549/.v11i2.4471openalex-snapshot
Handling Imbalanced Data through Re-sampling: Systematic Review
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.