✦ LIBER ✦

Finding generalized projected clusters in high dimensional spaces

✍ Scribed by Aggarwal, Charu C.; Yu, Philip S.

Book ID: 120805847
Publisher: Association for Computing Machinery
Year: 2000
Tongue: English
Weight: 756 KB
Volume: 29
Category: Article
ISSN: 0163-5808
DOI: 10.1145/335191.335383

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evaluating clustering in subspace projec

Evaluating clustering in subspace projections of high dimensional data

✍ Müller, Emmanuel; Günnemann, Stephan; Assent, Ira; Seidl, Thomas 📂 Article 📅 2009 🏛 VLDB Endowment 🌐 English ⚖ 926 KB

Iterative random projections for high-di

Iterative random projections for high-dimensional data clustering

✍ Ângelo Cardoso; Andreas Wichert 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Direct classification of high-dimensiona

Direct classification of high-dimensional data in low-dimensional projected feature spaces—Comparison of several classification methodologies

✍ R.L. Somorjai; B. Dolenko; M. Mandelzweig 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 874 KB

Subquadratic Approximation Algorithms fo

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

✍ Allan Borodin; Rafail Ostrovsky; Yuval Rabani 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 156 KB

Linear manifold clustering in high dimen

Linear manifold clustering in high dimensional spaces by stochastic search

✍ Robert Haralick; Rave Harpaz 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for classical clustering approaches. In this paper we present a new clustering paradigm in which the cluster center is a linear ma

Tubes in three–dimensional projective sp

Tubes in three–dimensional projective spaces

✍ Edoardo Ballico; Antonio Cossidente 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 69 KB