On the public citation graph
Reducing Redundancy in Subspace Clustering
0 signed · 37 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/3-540-44503-x_27openalex-snapshot
On the Surprising Behavior of Distance Metrics in High Dimensional Space
inferredcites →https://doi.org/10.1007/3-540-49257-7_15openalex-snapshot
When Is “Nearest Neighbor” Meaningful?
inferredcites →https://doi.org/10.1016/b978-012088469-8.50075-9openalex-snapshot
A Framework for Projected Clustering of High Dimensional Data Streams
inferredcites →https://doi.org/10.1109/69.553155openalex-snapshot
Data mining: an overview from a database perspective
inferredcites →https://doi.org/10.1109/csb.2004.1332505openalex-snapshot
Subspace clustering for microarray data analysis:multiple criteria and significance assessment
inferredcites →https://doi.org/10.1109/csb.2004.160openalex-snapshot
Subspace clustering for microarray data analysis:multiple criteria and significance assessment
inferredcites →https://doi.org/10.1109/csbw.2005.66openalex-snapshot
Fractal Clustering for Microarray Data Analysis
inferredcites →https://doi.org/10.1109/icdm.2004.10034openalex-snapshot
Revealing True Subspace Clusters in High Dimensions
inferredcites →https://doi.org/10.1109/tkde.2004.74openalex-snapshot
HARP: a practical projected clustering algorithm
inferredcites →https://doi.org/10.1109/tkde.2005.29openalex-snapshot
Iterative projected clustering by subspace mining
inferredcites →https://doi.org/10.1137/1.9781611972719.7openalex-snapshot
Adaptive Grids for Clustering Massive Data Sets
inferredcites →https://doi.org/10.1137/1.9781611972740.23openalex-snapshot
Density-Connected Subspace Clustering for High-Dimensional Data
inferredcites →https://doi.org/10.1142/9789812702098_0002openalex-snapshot
EMERGING PATTERN BASED SUBSPACE CLUSTERING OF MICROARRAY GENE EXPRESSION DATA USING MIXTURE MODELS
inferredcites →https://doi.org/10.1145/1143844.1143919openalex-snapshot
Combined central and subspace clustering for computer vision applications
inferredcites →https://doi.org/10.1145/1183614.1183739openalex-snapshot
On subspace clustering with density consciousness
inferredcites →https://doi.org/10.1145/276304.276314openalex-snapshot
Automatic subspace clustering of high dimensional data for data mining applications
inferredcites →https://doi.org/10.1145/276305.276314openalex-snapshot
Automatic subspace clustering of high dimensional data for data mining applications
inferredcites →https://doi.org/10.1145/304181.304188openalex-snapshot
Fast algorithms for projected clustering
inferredcites →https://doi.org/10.1145/304182.304188openalex-snapshot
Fast algorithms for projected clustering
inferredcites →https://doi.org/10.1145/312129.312199openalex-snapshot
Entropy-based subspace clustering for mining numerical data
inferredcites →https://doi.org/10.1145/335191.335383openalex-snapshot
Finding generalized projected clusters in high dimensional spaces
inferredcites →https://doi.org/10.1145/342009.335383openalex-snapshot
Finding generalized projected clusters in high dimensional spaces
inferredcites →https://doi.org/10.1145/564691.564739openalex-snapshot
A Monte Carlo algorithm for fast projective clustering
inferredcites →https://doi.org/10.1145/564736.564739openalex-snapshot
A Monte Carlo algorithm for fast projective clustering
inferredcites →https://doi.org/10.5860/choice.49-3305openalex-snapshot
Data mining: concepts and techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.chemolab.2021.104370openalex-snapshot
Cluster analysis of mixed data based on Feature Space Instance Cluster Closeness Metric
inferred← citeshttps://doi.org/10.1016/j.ins.2011.04.013openalex-snapshot
Minimum spanning tree based split-and-merge: A hierarchical clustering method
inferred← citeshttps://doi.org/10.1016/j.jbi.2021.103954openalex-snapshot
Machine learning algorithm for feature space clustering of mixed data with missing information based on molecule similarity
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.02.017openalex-snapshot
A k-means type clustering algorithm for subspace clustering of mixed numeric and categorical datasets
inferred← citeshttps://doi.org/10.1109/cvpr52729.2023.00606openalex-snapshot
Adaptive Graph Convolutional Subspace Clustering
inferred← citeshttps://doi.org/10.1109/icmlc.2011.6016720openalex-snapshot
A hierarchical distributed data mining architecture
inferred← citeshttps://doi.org/10.1109/tkde.2023.3303343openalex-snapshot
Learning Idempotent Representation for Subspace Clustering
inferred← citeshttps://doi.org/10.1109/tnnls.2017.2728138openalex-snapshot
Subspace Clustering of Categorical and Numerical Data With an Unknown Number of Clusters
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3059511openalex-snapshot
Subspace Clustering via Structured Sparse Relation Representation
inferred← citeshttps://doi.org/10.20965/jaciii.2011.p1248openalex-snapshot
An Improvement of Fuzzy Association Rules Mining Algorithm Based on Redundancy of Rules
inferred← citeshttps://doi.org/10.47893/ijcsi.2013.1108openalex-snapshot
Clustering Algorithms For High Dimensional Data – A Survey Of Issues And Existing Approaches
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.