On the public citation graph
Non-Redundant Subspace Clusterings with Nr-Kmeans and Nr-DipMeans
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-57454-7_16openalex-snapshot
Information-Theoretic Non-redundant Subspace Clustering
inferredcites →https://doi.org/10.1007/s10618-012-0258-xopenalex-snapshot
A survey on enhanced subspace clustering
inferredcites →https://doi.org/10.1007/s10994-016-5601-9openalex-snapshot
Non-redundant multiple clustering by nonnegative matrix factorization
inferredcites →https://doi.org/10.1016/j.jmva.2006.11.013openalex-snapshot
Comparing clusterings—an information based distance
inferredcites →https://doi.org/10.1109/dsaa.2016.42openalex-snapshot
A Parallel Framework for Grid-Based Bottom-Up Subspace Clustering
inferredcites →https://doi.org/10.1109/icde.2012.128openalex-snapshot
Evaluation of Clusterings -- Metrics and Visual Support
inferredcites →https://doi.org/10.1109/icdm.2006.37openalex-snapshot
COALA: A Novel Approach for the Extraction of an Alternate Clustering of High Quality and High Dissimilarity
inferredcites →https://doi.org/10.1109/icdm.2008.141openalex-snapshot
Finding Alternative Clusterings Using Constraints
inferredcites →https://doi.org/10.1109/icdm.2008.46openalex-snapshot
INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy
inferredcites →https://doi.org/10.1109/icdm.2009.10openalex-snapshot
Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data
inferredcites →https://doi.org/10.1109/icdm.2010.24openalex-snapshot
minCEntropy: A Novel Information Theoretic Approach for the Generation of Alternative Clusterings
inferredcites →https://doi.org/10.1109/icdm.2014.34openalex-snapshot
Finding the Optimal Subspace for Clustering
inferredcites →https://doi.org/10.1109/icdm.2015.101openalex-snapshot
Finding Multiple Stable Clusterings
inferredcites →https://doi.org/10.1109/icdm.2016.0068openalex-snapshot
Generalized Independent Subspace Clustering
inferredcites →https://doi.org/10.1109/icdm.2018.00056openalex-snapshot
DipTransformation: Enhancing the Structure of a Dataset and Thereby Improving Clustering
inferredcites →https://doi.org/10.1109/tsmcb.2012.2223671openalex-snapshot
Knowledge Acquisition and Representation Using Fuzzy Evidential Reasoning and Dynamic Adaptive Fuzzy Petri Nets
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611972801.11openalex-snapshot
Generation of Alternative Clusterings Using the CAMI Approach
inferredcites →https://doi.org/10.1137/1.9781611972801.12openalex-snapshot
Making k -means even faster
inferredcites →https://doi.org/10.1137/1.9781611972832.21openalex-snapshot
k -means–: A unified approach to clustering and outlier detection
inferredcites →https://doi.org/10.1145/1390156openalex-snapshot
Proceedings of the 25th international conference on Machine learning - ICML '08
inferredcites →https://doi.org/10.1145/1401890openalex-snapshot
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/1401890.1401956openalex-snapshot
Finding non-redundant, statistically significant regions in high dimensional data
inferredcites →https://doi.org/10.1145/1497577.1497578openalex-snapshot
Clustering high-dimensional data
inferredcites →https://doi.org/10.1145/1557019.1557115openalex-snapshot
Adapting the right measures for K-means clustering
inferredcites →https://doi.org/10.1145/1835804.1835878openalex-snapshot
A hierarchical information theoretic technique for the discovery of non linear alternative clusterings
inferredcites →https://doi.org/10.1145/2339530.2339553openalex-snapshot
Multi-view clustering using mixture models in subspace projections
inferredcites →https://doi.org/10.1145/3097983.3097989openalex-snapshot
Towards an Optimal Subspace for K-Means
inferredcites →https://doi.org/10.1145/3200947.3201008openalex-snapshot
The Projected Dip-means Clustering Algorithm
inferredcites →https://doi.org/10.1145/3219819.3219945openalex-snapshot
Discovering Non-Redundant K-means Clusterings in Optimal Subspaces
inferredcites →https://doi.org/10.9790/3021-0204719725openalex-snapshot
AN OVERVIEW ON CLUSTERING METHODS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.22770openalex-snapshot
Multipartition clustering of mixed data with Bayesian networks
inferred← citeshttps://doi.org/10.1007/978-3-031-16485-9_12openalex-snapshot
Method of Selecting the Optimal Location of Barrier-Free Bus Stops Using Clustering
inferred← citeshttps://doi.org/10.1016/j.cosrev.2024.100621openalex-snapshot
Multiple clusterings: Recent advances and perspectives
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.129082openalex-snapshot
Inductive multiple clustering based on weakly-supervised salient representation learning
inferred← citeshttps://doi.org/10.1088/1742-6596/3242/1/012006openalex-snapshot
Deep Multi-Modal Non-Redundant Subspace Clustering By Contrastive Affinity Learning
inferred← citeshttps://doi.org/10.1109/dsaa60987.2023.10302468openalex-snapshot
Non-Redundant Image Clustering of Early Medieval Glass Beads
inferred← citeshttps://doi.org/10.1109/icdmw53433.2021.00090openalex-snapshot
Deep Embedded K-Means Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2022.3218693openalex-snapshot
A Diversified Attention Model for Interpretable Multiple Clusterings
inferred← citeshttps://doi.org/10.1137/1.9781611977172.26openalex-snapshot
Automatic Parameter Selection for Non-Redundant Clustering
inferred← citeshttps://doi.org/10.1137/1.9781611977653.ch13openalex-snapshot
Extension of the Dip-test Repertoire - Efficient and Differentiable p-value Calculation for Clustering
inferred← citeshttps://doi.org/10.1145/3534678.3539407openalex-snapshot
The DipEncoder: Enforcing Multimodality in Autoencoders
inferred← citeshttps://doi.org/10.1145/3543507.3583485openalex-snapshot
Semi-Supervised Embedding of Attributed Multiplex Networks
inferred← citeshttps://doi.org/10.1371/journal.pone.0331089openalex-snapshot
ACG-SFE: Adaptive cluster-guided simple, fast, and efficient feature selection for high-dimensional microarray data in binary classification
inferred← citeshttps://doi.org/10.20868/upm.thesis.69344openalex-snapshot
Multidimensional clustering with Bayesian networks
inferred← citeshttps://doi.org/10.2478/ftee-2022-0026openalex-snapshot
Intelligent Recognition of Colour and Contour from Ancient Chinese Embroidery Images
inferred← citeshttps://doi.org/10.3390/math13091535openalex-snapshot
Semi-Supervised Clustering via Constraints Self-Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03785openalex-snapshot
Addressing practical challenges in Active Learning via a hybrid query strategy
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.