On the public citation graph

Minimum spanning tree‐based cluster analysis: A new algorithm for determining inconsistent edges

0 signed · 59 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/cpe.4690openalex-snapshot
An approach to custom privacy policy violation detection problems using big social provenance data
inferredcites →https://doi.org/10.1002/cpe.4793openalex-snapshot
Detecting misinformation in social networks using provenance data
inferredcites →https://doi.org/10.1002/cpe.4894openalex-snapshot
Application of provenance in social computing: A case study
inferredcites →https://doi.org/10.1007/978-3-642-16248-0_76openalex-snapshot
A Neighborhood Density Estimation Clustering Algorithm Based on Minimum Spanning Tree
inferredcites →https://doi.org/10.1007/s10586-017-0868-6openalex-snapshot
Optimizing the minimum spanning tree-based extracted clusters using evolution strategy
inferredcites →https://doi.org/10.1016/j.compbiomed.2015.03.031openalex-snapshot
Clustering high throughput biological data with B-MST, a minimum spanning tree based heuristic
inferredcites →https://doi.org/10.1016/j.csda.2015.03.008openalex-snapshot
An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
inferredcites →https://doi.org/10.1016/j.dsp.2013.03.009openalex-snapshot
Enhancing minimum spanning tree-based clustering by removing density-based outliers
inferredcites →https://doi.org/10.1016/j.eswa.2019.03.051openalex-snapshot
A new data clustering algorithm based on critical distance methodology
inferredcites →https://doi.org/10.1016/j.eswa.2019.04.048openalex-snapshot
A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree
inferredcites →https://doi.org/10.1016/j.knosys.2018.08.012openalex-snapshot
An improved path-based clustering algorithm
inferredcites →https://doi.org/10.1016/j.neucom.2017.07.038openalex-snapshot
Fast approximate minimum spanning tree based clustering algorithm
inferredcites →https://doi.org/10.1016/j.patcog.2008.09.015openalex-snapshot
A multi-prototype clustering algorithm
inferredcites →https://doi.org/10.1016/j.patcog.2009.07.010openalex-snapshot
A graph-theoretical clustering method based on two rounds of minimum spanning trees
inferredcites →https://doi.org/10.1016/j.patcog.2017.06.023openalex-snapshot
Fast density clustering strategies based on the k-means algorithm
inferredcites →https://doi.org/10.1016/j.physa.2013.01.015openalex-snapshot
Minimum spanning trees for community detection
inferredcites →https://doi.org/10.1016/j.procs.2017.12.099openalex-snapshot
Empirical Analysis of Data Clustering Algorithms
inferredcites →https://doi.org/10.1016/s0031-3203(96)00188-4openalex-snapshot
Minimal spanning tree based clustering technique: Relationship with Bayes Classifier
inferredcites →https://doi.org/10.1016/s0306-4379(01)00008-4openalex-snapshot
Cure: an efficient clustering algorithm for large databases
inferredcites →https://doi.org/10.1021/ja047109hopenalex-snapshot
Protein NMR Recall, Precision, and F -measure Scores (RPF Scores): Structure Quality Assessment Measures Based on Information Retrieval Statistics
inferredcites →https://doi.org/10.1093/bioinformatics/18.4.536openalex-snapshot
Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees
inferredcites →https://doi.org/10.1103/physrevlett.96.148702openalex-snapshot
Transport in Weighted Networks: Partition into Superhighways and Roads
inferredcites →https://doi.org/10.1109/2.781637openalex-snapshot
Chameleon: hierarchical clustering using dynamic modeling
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/ictai.2006.83openalex-snapshot
Minimum Spanning Tree Based Clustering Algorithms
inferredcites →https://doi.org/10.1109/skg.2018.00009openalex-snapshot
Provenance Collection Platform for the Weather Research and Forecasting Model
inferredcites →https://doi.org/10.1109/t-c.1971.223083openalex-snapshot
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
inferredcites →https://doi.org/10.1109/tetc.2014.2330519openalex-snapshot
A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis
inferredcites →https://doi.org/10.1109/tevc.2006.877146openalex-snapshot
An Evolutionary Approach to Multiobjective Clustering
inferredcites →https://doi.org/10.1109/tkde.2005.112openalex-snapshot
Minimum spanning tree partitioning algorithm for microaggregation
inferredcites →https://doi.org/10.1109/tkde.2005.21openalex-snapshot
Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging
inferredcites →https://doi.org/10.1109/tnn.2009.2015974openalex-snapshot
Semi-Supervised Learning (Chapelle, O. et al., Eds.; 2006) [Book reviews]
inferredcites →https://doi.org/10.1109/tpami.2003.1190577openalex-snapshot
Path-based clustering for grouping of smooth curves and texture segmentation
inferredcites →https://doi.org/10.1109/tpami.2003.1240115openalex-snapshot
Bagging for path-based clustering
inferredcites →https://doi.org/10.1109/tpami.2005.237openalex-snapshot
Clustering ensembles: models of consensus and weak partitions
inferredcites →https://doi.org/10.1109/tpami.2007.1138openalex-snapshot
Cumulative Voting Consensus Method for Partitions with Variable Number of Clusters
inferredcites →https://doi.org/10.1126/science.1242072openalex-snapshot
Clustering by fast search and find of density peaks
inferredcites →https://doi.org/10.1145/1217299.1217303openalex-snapshot
Clustering aggregation
inferredcites →https://doi.org/10.1145/235968.233324openalex-snapshot
BIRCH
inferredcites →https://doi.org/10.1145/568574.568575openalex-snapshot
Why so many clustering algorithms
inferredcites →https://doi.org/10.1155/2018/8451796openalex-snapshot
CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers
inferredcites →https://doi.org/10.2307/1217562openalex-snapshot
THE PRINCIPLES AND PRACTICE OF NUMERICAL TAXONOMY

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.6972openalex-snapshot
Special issue on High Performance Computing Conference ( BASARIM ‐2020)
inferred← citeshttps://doi.org/10.1007/978-3-031-92747-8_24openalex-snapshot
Unsupervised Granular-Ball Partitioning Algorithm Based on KL Divergence
inferred← citeshttps://doi.org/10.1007/s00521-023-08386-3openalex-snapshot
MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters
inferred← citeshttps://doi.org/10.1007/s11192-026-05749-0openalex-snapshot
Centralized versus distributed innovation: mapping corporate R&D collaboration backbones through vibrant inventor and MST analysis
inferred← citeshttps://doi.org/10.1016/j.aej.2024.03.039openalex-snapshot
Implicit unscented particle filter based indoor fusion positioning algorithms for sensor networks
inferred← citeshttps://doi.org/10.1016/j.ejrs.2026.04.004openalex-snapshot
A graph learning framework for prediction of missing landmines using airborne magnetometry in IoT environment
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.127767openalex-snapshot
Block-diagonal structure learning for subspace clustering
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120380openalex-snapshot
PaVa: A novel path-based valley-seeking clustering algorithm
inferred← citeshttps://doi.org/10.1016/j.knosys.2026.115999openalex-snapshot
Clustering structure identification with ordering graph
inferred← citeshttps://doi.org/10.1109/tsp63128.2024.10605927openalex-snapshot
Robust and Secure Watermarking Algorithm Based on High Frequencies of Integer Wavelet Transform
inferred← citeshttps://doi.org/10.1145/3580305.3599283openalex-snapshot
Connecting the Dots -- Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering
inferred← citeshttps://doi.org/10.14254/2071-789x.2024/17-1/9openalex-snapshot
Hospital distribution in Polish provinces as a factor of smart living
inferred← citeshttps://doi.org/10.3390/app14178018openalex-snapshot
Optimizing Agricultural Data Analysis Techniques through AI-Powered Decision-Making Processes
inferred← citeshttps://doi.org/10.3390/foods13020271openalex-snapshot
Development of Gluten-Free Bread Production Technology with Enhanced Nutritional Value in the Context of Kazakhstan
inferred← citeshttps://doi.org/10.3934/mbe.2023705openalex-snapshot
Fast clustering algorithm based on MST of representative points
inferred← citeshttps://doi.org/10.4018/ijswis.346377openalex-snapshot
Neighboring-Aware Hierarchical Clustering
inferred← citeshttps://doi.org/10.58853/dumad.1231116openalex-snapshot
MİNİMUM KAPSAMA AĞACI YÖNTEMİ İLE KAMPÜS ALANINDA AĞ PLANLAMASI
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.