On the public citation graph

P3C: A Robust Projected Clustering Algorithm

https://doi.org/10.1109/icdm.2006.123

0 signed · 97 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.1073/pnas.96.12.6745openalex-snapshot

Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays

inferredcites →https://doi.org/10.1080/01621459.1990.10474920openalex-snapshot

Unmasking Multivariate Outliers and Leverage Points

inferredcites →https://doi.org/10.1109/icde.2005.96openalex-snapshot

On Discovery of Extremely Low-Dimensional Clusters Using Semi-Supervised Projected Clustering

inferredcites →https://doi.org/10.1109/tcbb.2004.2openalex-snapshot

Biclustering algorithms for biological data analysis: a survey

inferredcites →https://doi.org/10.1109/tkde.2004.74openalex-snapshot

HARP: a practical projected clustering algorithm

inferredcites →https://doi.org/10.1109/tkde.2005.47openalex-snapshot

Projective clustering by histograms

inferredcites →https://doi.org/10.1111/j.2517-6161.1977.tb01600.xopenalex-snapshot

Maximum Likelihood from Incomplete Data Via the EM Algorithm

inferredcites →https://doi.org/10.1145/1007730.1007731openalex-snapshot

Subspace clustering for high dimensional data

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/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.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

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.4666280openalex-extracted

Modeling and Analyzing Social Networks of Games

inferred← citeshttps://doi.org/10.1002/sam.10062openalex-snapshot

Efficient mining of distance‐based subspace clusters

inferred← citeshttps://doi.org/10.1002/spe.2341openalex-snapshot

Iterative big data clustering algorithms: a review

inferred← citeshttps://doi.org/10.1007/978-1-4471-4890-6_2openalex-snapshot

Related Work and Concepts

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-4890-6_7openalex-snapshot

Conclusion

inferred← citeshttps://doi.org/10.1007/978-3-030-33778-0_6openalex-snapshot

A Sampling-Based Approach for Discovering Subspace Clusters

inferred← citeshttps://doi.org/10.1007/978-3-030-55187-2_42openalex-snapshot

Big Data Clustering Using MapReduce Framework: A Review

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-02821-7_32openalex-snapshot

SE-Stream: Dimension Projection for Evolution-Based Clustering of High Dimensional Data Streams

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-24282-8_24openalex-snapshot

Benchmarking Stream Clustering for Churn Detection in Dynamic Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-46562-3_32openalex-snapshot

Dynamic Stream Clustering Using Ants

inferred← citeshttps://doi.org/10.1007/978-3-319-97864-2_2openalex-snapshot

Overview of Efficient Clustering Methods for High-Dimensional Big Data Streams

inferred← citeshttps://doi.org/10.1007/978-3-540-87481-2_44openalex-snapshot

Pleiades: Subspace Clustering and Evaluation

inferred← citeshttps://doi.org/10.1007/978-3-662-43984-5_11openalex-snapshot

Efficient Streaming Detection of Hidden Clusters in Big Data Using Subspace Stream Clustering

inferred← citeshttps://doi.org/10.1007/978-81-322-2196-8_26openalex-snapshot

An Efficient Kernelized Fuzzy Possibilistic C-Means for High-Dimensional Data Clustering

inferred← citeshttps://doi.org/10.1007/s00500-021-05973-1openalex-snapshot

A meta-heuristic density-based subspace clustering algorithm for high-dimensional data

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-018-0585-7openalex-snapshot

Explaining anomalies in groups with characterizing subspace rules

inferred← citeshttps://doi.org/10.1007/s10618-024-01086-zopenalex-snapshot

A comparative evaluation of clustering-based outlier detection

inferred← citeshttps://doi.org/10.1007/s10844-014-0319-2openalex-snapshot

Subspace clustering of data streams: new algorithms and effective evaluation measures

inferred← citeshttps://doi.org/10.1007/s11277-017-5044-zopenalex-snapshot

Machine Learning Based Big Data Processing Framework for Cancer Diagnosis Using Hidden Markov Model and GM Clustering

inferred← citeshttps://doi.org/10.1007/s41060-022-00327-yopenalex-snapshot

RASCL: a randomised approach to subspace clusters

inferred← citeshttps://doi.org/10.1016/j.datak.2019.05.003openalex-snapshot

SubspaceDB : In-database subspace clustering for analytical query processing

inferred← citeshttps://doi.org/10.1016/j.knosys.2013.08.015openalex-snapshot

Finding multiple global linear correlations in sparse and noisy data sets

inferred← citeshttps://doi.org/10.1016/j.knosys.2017.09.034openalex-snapshot

Local graph based correlation clustering

inferred← citeshttps://doi.org/10.1016/j.neucom.2015.08.094openalex-snapshot

PTS: Projected Topological Stream clustering algorithm

inferred← citeshttps://doi.org/10.1016/j.patcog.2020.107748openalex-snapshot

Projected fuzzy C-means clustering with locality preservation

inferred← citeshttps://doi.org/10.1016/j.procs.2015.08.111openalex-snapshot

An Iterative Projective Clustering Method

inferred← citeshttps://doi.org/10.1109/fskd.2010.5569369openalex-snapshot

Frequent patterns-based subspace clustering

inferred← citeshttps://doi.org/10.1109/fskd.2013.6816286openalex-snapshot

An efficient projected partition algorithm based on the order among genes

inferred← citeshttps://doi.org/10.1109/icdm.2008.46openalex-snapshot

INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy

inferred← citeshttps://doi.org/10.1109/icdm.2009.10openalex-snapshot

Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data

inferred← citeshttps://doi.org/10.1109/icdm.2010.49openalex-snapshot

Multi-dimensional Mass Estimation and Mass-based Clustering

inferred← citeshttps://doi.org/10.1109/icdm.2011.70openalex-snapshot

Flexible Fault Tolerant Subspace Clustering for Data with Missing Values

inferred← citeshttps://doi.org/10.1109/icdm.2013.146openalex-snapshot

Cartification: A Neighborhood Preserving Transformation for Mining High Dimensional Data

inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620856openalex-snapshot

Bayesian network-Based Projected Clustering

inferred← citeshttps://doi.org/10.1109/ijcnn.2012.6252416openalex-snapshot

Dimension Selective Self-Organizing Maps for clustering high dimensional data

inferred← citeshttps://doi.org/10.1109/ijcnn.2012.6252668openalex-snapshot

A projective clustering algorithm based on significant local dense areas

inferred← citeshttps://doi.org/10.1109/tcss.2019.2910818openalex-snapshot

A Novel Stream Clustering Framework for Spam Detection in Twitter

inferred← citeshttps://doi.org/10.1109/tip.2017.2789327openalex-snapshot

Clusterability and Clustering of Images and Other “Real” High-Dimensional Data

inferred← citeshttps://doi.org/10.1109/tkde.2008.224openalex-snapshot

Density Conscious Subspace Clustering for High-Dimensional Data

inferred← citeshttps://doi.org/10.1109/tkde.2023.3323580openalex-snapshot

Simultaneous Deep Clustering and Feature Selection via K-Concrete Autoencoder

inferred← citeshttps://doi.org/10.1109/tpwrs.2014.2309697openalex-snapshot

Subspace Projection Method Based Clustering Analysis in Load Profiling

inferred← citeshttps://doi.org/10.1137/1.9781611972795.16openalex-snapshot

DensEst: Density Estimation for Data Mining in High Dimensional Spaces

inferred← citeshttps://doi.org/10.1137/1.9781611972801.34openalex-snapshot

Subspace Clustering for Uncertain Data

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/1401890.1402026openalex-snapshot

Morpheus

inferred← citeshttps://doi.org/10.1145/1458082.1458227openalex-snapshot

EDSC

inferred← citeshttps://doi.org/10.1145/1497577.1497578openalex-snapshot

Clustering high-dimensional data

inferred← citeshttps://doi.org/10.1145/1645953.1646120openalex-snapshot

Detection of orthogonal concepts in subspaces of high dimensional data

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/2063576.2063733openalex-snapshot

Scalable density-based subspace clustering

inferred← citeshttps://doi.org/10.1145/2063576.2063774openalex-snapshot

External evaluation measures for subspace clustering

inferred← citeshttps://doi.org/10.1145/2430456.2430469openalex-snapshot

On the equivalence of PLSI and projected clustering

inferred← citeshttps://doi.org/10.1145/2858657openalex-snapshot

Subspace Frequency Analysis--Based Field Indices Extraction for Electricity Customer Classification

inferred← citeshttps://doi.org/10.11606/t.55.2011.tde-22112011-083653openalex-snapshot

Data mining in large sets of complex data

inferred← citeshttps://doi.org/10.1201/b15027-10openalex-snapshot

Advanced Clustering Analysis

inferred← citeshttps://doi.org/10.14778/1454159.1454223openalex-snapshot

Detecting clusters in moderate-to-high dimensional data

inferred← citeshttps://doi.org/10.14778/1687627.1687770openalex-snapshot

Evaluating clustering in subspace projections of high dimensional data

inferred← citeshttps://doi.org/10.1504/ijscc.2011.042433openalex-snapshot

Hybrid-LWM: A linear-model based hybrid clustering algorithm for supplier categorisation

inferred← citeshttps://doi.org/10.26438/ijcse/v5i10.292301openalex-snapshot

A Brief Account of Iterative Big Data Clustering Algorithms

inferred← citeshttps://doi.org/10.3233/jifs-179372openalex-snapshot

Adapting ClusTree for more challenging data stream environments

inferred← citeshttps://doi.org/10.32469/10355/62341openalex-snapshot

An approach to clustering biological phenotypes

inferred← citeshttps://doi.org/10.4018/978-1-5225-5852-1.ch003openalex-snapshot

Subspace Clustering of High Dimensional Data Using Differential Evolution

inferred← citeshttps://doi.org/10.4018/978-1-60566-010-3.ch247openalex-snapshot

Projected Clustering for Biological Data Analysis

inferred← citeshttps://doi.org/10.48550/arxiv.1708.05929openalex-snapshot

Explaining Anomalies in Groups with Characterizing Subspace Rules

inferred← citeshttps://doi.org/10.48550/arxiv.1806.05297openalex-snapshot

Pattern Dependence Detection using n-TARP Clustering

inferred← citeshttps://doi.org/10.48550/arxiv.1902.03616openalex-snapshot

ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 "Heidelberg"

inferred← citeshttps://doi.org/10.48550/arxiv.2008.09579openalex-snapshot

Clustering small datasets in high-dimension by random projection

inferred← citeshttps://doi.org/10.5120/1468-1983openalex-snapshot

Density Conscious Subspace Clustering for High Dimensional Data using Genetic Algorithms

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.5121/ijcsit.2010.2414openalex-snapshot

Clustering High Dimensional Data Using Subspace and Projected Clustering Algorithms

inferred← citeshttps://doi.org/10.5441/002/edbt.2014.06openalex-snapshot

Projected Clustering for Huge Data Sets in MapReduce

inferred← citeshttps://doi.org/10.70675/9778aca1z6601z4723za496z164c85caa7f9openalex-snapshot

Subspace clustering on static datasets and dynamic data streams using bio-inspired algorithms

inferred← citeshttps://doi.org/10.7939/r3vh5cz0sopenalex-snapshot

A New Method For Semi-Supervised Density-Based Projected 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.