A Monte Carlo algorithm for fast projective clustering
Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2002
We propose a mathematical formulation for the notion of optimal projective cluster, starting from natural requirements on the density of points in subspaces. This allows us to develop a Monte Carlo algorithm for iteratively computing projective clusters. We prove that the computed clusters are good with high probability. We implemented a modified version of the algorithm, using heuristics to speed up computation. Our extensive experiments show that our method is significantly more accurate than previous approaches. In particular, we use our techniques to build a classifier for detecting rotated human faces in cluttered images.
Cited by 340 works. doi:10.1145/564691.564739
Authors
References
- Neural network-based face detection
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- A statistical method for 3D object detection applied to faces and cars
- Efficient and Effective Clustering Methods for Spatial Data Mining
- BIRCH
- Robust real-time object detection.
- Automatic subspace clustering of high dimensional data for data mining applications
- CURE
- An efficient approach to clustering in large multimedia databases with noise
- Fast algorithms for projected clustering