On the public citation graph

Iterative projected clustering by subspace mining

0 signed · 83 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.1007/3-540-49257-7_15openalex-snapshot
When Is “Nearest Neighbor” Meaningful?
inferredcites →https://doi.org/10.1109/2.820041openalex-snapshot
BiolD: a multimodal biometric identification system
inferredcites →https://doi.org/10.1109/icde.2002.994771openalex-snapshot
δ-clusters: capturing subspace correlation in a large data set
inferredcites →https://doi.org/10.1109/icdm.2003.1250928openalex-snapshot
MaPle: a fast algorithm for maximal pattern-based clustering
inferredcites →https://doi.org/10.1109/icdm.2003.1251009openalex-snapshot
Frequent-pattern based iterative projected clustering
inferredcites →https://doi.org/10.1109/ride.1997.583696openalex-snapshot
Evaluation of sampling for data mining of association rules
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/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/335191.335383openalex-snapshot
Finding generalized projected clusters in high dimensional spaces
inferredcites →https://doi.org/10.1145/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335383openalex-snapshot
Finding generalized projected clusters in high dimensional spaces
inferredcites →https://doi.org/10.1145/564691.564737openalex-snapshot
Clustering by pattern similarity in large data sets
inferredcites →https://doi.org/10.1145/564691.564739openalex-snapshot
A Monte Carlo algorithm for fast projective clustering
inferredcites →https://doi.org/10.1145/564736.564737openalex-snapshot
Clustering by pattern similarity in large data sets
inferredcites →https://doi.org/10.1145/564736.564739openalex-snapshot
A Monte Carlo algorithm for fast projective clustering
inferredcites →https://doi.org/10.1145/775047.775110openalex-snapshot
Frequent term-based text clustering
inferredcites →https://doi.org/10.1145/956750.956788openalex-snapshot
Fast vertical mining using diffsets

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470382776.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/sam.10062openalex-snapshot
Efficient mining of distance‐based subspace clusters
inferred← citeshttps://doi.org/10.1002/sam.11161openalex-snapshot
A survey on unsupervised outlier detection in high‐dimensional numerical data
inferred← citeshttps://doi.org/10.1002/widm.1057openalex-snapshot
Subspace clustering
inferred← citeshttps://doi.org/10.1007/978-1-4471-4890-6_3openalex-snapshot
Clustering Methods for Moderate-to-High Dimensionality Data
inferred← citeshttps://doi.org/10.1007/978-1-4471-4890-6_4openalex-snapshot
Halite
inferred← citeshttps://doi.org/10.1007/978-1-4471-4890-6_5openalex-snapshot
BoW
inferred← citeshttps://doi.org/10.1007/978-1-4471-5571-3_9openalex-snapshot
Clustering II: Topics in Clustering
inferred← citeshttps://doi.org/10.1007/978-1-4471-7452-3_10openalex-snapshot
Clustering II: Topics in Clustering
inferred← citeshttps://doi.org/10.1007/978-3-031-24628-9_11openalex-snapshot
Clustering High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/978-3-319-07821-2_16openalex-snapshot
Frequent Pattern Mining Algorithms for Data Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-08979-9_1openalex-snapshot
Efficient Error Setting for Subspace Miners
inferred← citeshttps://doi.org/10.1007/978-3-642-13818-8_34openalex-snapshot
Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?
inferred← citeshttps://doi.org/10.1007/s10115-007-0090-6openalex-snapshot
Robust projected clustering
inferred← citeshttps://doi.org/10.1007/s10115-009-0226-yopenalex-snapshot
Subspace and projected clustering: experimental evaluation and analysis
inferred← citeshttps://doi.org/10.1007/s10115-013-0640-zopenalex-snapshot
GAMer: a synthesis of subspace clustering and dense subgraph mining
inferred← citeshttps://doi.org/10.1007/s10115-017-1031-7openalex-snapshot
Efficient Monte Carlo clustering in subspaces
inferred← citeshttps://doi.org/10.1007/s10618-012-0266-xopenalex-snapshot
Projective clustering ensembles
inferred← citeshttps://doi.org/10.1007/s10994-013-5395-yopenalex-snapshot
Metacluster-based Projective Clustering Ensembles
inferred← citeshttps://doi.org/10.1007/s11771-010-0598-xopenalex-snapshot
Linear manifold clustering for high dimensional data based on line manifold searching and fusing
inferred← citeshttps://doi.org/10.1007/s13042-011-0045-9openalex-snapshot
Combining partially global and local characteristics for improved classification
inferred← citeshttps://doi.org/10.1016/j.bdr.2014.07.004openalex-snapshot
A Near-Linear Time Subspace Search Scheme for Unsupervised Selection of Correlated Features
inferred← citeshttps://doi.org/10.1016/j.datak.2007.10.003openalex-snapshot
Discovering frequent itemsets by support approximation and itemset clustering
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.09.034openalex-snapshot
Local graph based correlation clustering
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.08.021openalex-snapshot
A novel Bayesian logistic discriminant model: An application to face recognition
inferred← citeshttps://doi.org/10.1016/j.patcog.2011.05.004openalex-snapshot
A novel SVM+NDA model for classification with an application to face recognition
inferred← citeshttps://doi.org/10.1016/j.procs.2015.10.077openalex-snapshot
K-Medoid Clustering for Heterogeneous DataSets
inferred← citeshttps://doi.org/10.1109/access.2020.2981265openalex-snapshot
Cluster Density Properties Define a Graph for Effective Pattern Feature Selection
inferred← citeshttps://doi.org/10.1109/bigdata.2013.6691596openalex-snapshot
4S: Scalable subspace search scheme overcoming traditional Apriori processing
inferred← citeshttps://doi.org/10.1109/icde.2010.5447924openalex-snapshot
Finding Clusters in subspaces of very large, multi-dimensional datasets
inferred← citeshttps://doi.org/10.1109/icdim.2010.5664217openalex-snapshot
A new combined KSVM and KFD model for classification and recognition
inferred← citeshttps://doi.org/10.1109/icdm.2009.131openalex-snapshot
Projective Clustering Ensembles
inferred← citeshttps://doi.org/10.1109/icdm.2010.138openalex-snapshot
Enhancing Single-Objective Projective Clustering Ensembles
inferred← citeshttps://doi.org/10.1109/icecds.2017.8390132openalex-snapshot
A novel data clustering through ISSCE framework
inferred← citeshttps://doi.org/10.1109/tkde.2008.162openalex-snapshot
Mining Projected Clusters in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1109/tkde.2008.207openalex-snapshot
Reducing Redundancy in Subspace Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2010.244openalex-snapshot
On the Deep Order-Preserving Submatrix Problem: A Best Effort Approach
inferred← citeshttps://doi.org/10.1109/tkde.2010.256openalex-snapshot
Model-Based Method for Projective Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2011.176openalex-snapshot
Halite: Fast and Scalable Multiresolution Local-Correlation Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2012.73openalex-snapshot
Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory
inferred← citeshttps://doi.org/10.1109/tpami.2007.1165openalex-snapshot
Weighted Pseudometric Discriminatory Power Improvement Using a Bayesian Logistic Regression Model Based on a Variational Method
inferred← citeshttps://doi.org/10.1109/tpami.2023.3237667openalex-snapshot
Transforming Complex Problems into K-means Solutions
inferred← citeshttps://doi.org/10.1137/1.9781611972825.85openalex-snapshot
Density-based Projected Clustering over High Dimensional Data Streams
inferred← citeshttps://doi.org/10.1137/1.9781611974348.36openalex-snapshot
On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach
inferred← citeshttps://doi.org/10.1145/1401890.1401956openalex-snapshot
Finding non-redundant, statistically significant regions in high dimensional data
inferred← citeshttps://doi.org/10.1145/1497577.1497578openalex-snapshot
Clustering high-dimensional data
inferred← citeshttps://doi.org/10.1145/1900008.1900032openalex-snapshot
Mining relaxed closed subspace clusters
inferred← citeshttps://doi.org/10.1145/1989323.1989400openalex-snapshot
Advancing data clustering via projective clustering ensembles
inferred← citeshttps://doi.org/10.1145/2020408.2020516openalex-snapshot
Clustering very large multi-dimensional datasets with MapReduce
inferred← citeshttps://doi.org/10.1145/2023598.2023605openalex-snapshot
An extension of the PMML standard to subspace clustering models
inferred← citeshttps://doi.org/10.1145/2330784.2331010openalex-snapshot
Multiobjective optimization of co-clustering ensembles
inferred← citeshttps://doi.org/10.1145/2484838.2484860openalex-snapshot
RMiCS
inferred← citeshttps://doi.org/10.1155/2015/107650openalex-snapshot
Scalable Clustering of High‐Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence
inferred← citeshttps://doi.org/10.14419/ijet.v7i2.21.12384openalex-snapshot
Mining of high dimensional data using enhanced clustering approach
inferred← citeshttps://doi.org/10.20868/upm.thesis.14703openalex-snapshot
Semi-supervised subspace clustering and applications to neuroscience
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.22044/jadm.2020.7826.1941openalex-snapshot
High-Dimensional Unsupervised Active Learning Method
inferred← citeshttps://doi.org/10.4018/978-1-60566-010-3.ch247openalex-snapshot
Projected Clustering for Biological Data Analysis
inferred← citeshttps://doi.org/10.4304/jmm.6.1.39-47openalex-snapshot
A New KSVM + KFD Model for Improved Classification and Face Recognition
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06771openalex-snapshot
Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation
inferred← citeshttps://doi.org/10.5120/14004-2050openalex-snapshot
A Comparative Analysis of Different Categorical Data Clustering Ensemble Methods in Data Mining
inferred← citeshttps://doi.org/10.5120/6285-8468openalex-snapshot
A Modified Projected K-Means Clustering Algorithm with Effective Distance Measure
inferred← citeshttps://doi.org/10.5220/0003068400450055openalex-snapshot
SIMPLE AND EFFICIENT PROJECTIVE CLUSTERING
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.