Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering Alexander Hinneburg Daniel A. Keim

First Page		Document Content
Date: 2002-10-04 04:14:41 Multivariate statistics Data mining Geostatistics Clustering high-dimensional data Hierarchical clustering BIRCH K-means clustering DBSCAN K-medoids Statistics Cluster analysis Data analysis		Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering Alexander Hinneburg Daniel A. Keim Add to Reading List Source URL: fusion.cs.uni-magdeburg.de Download Document from Source Website File Size: 1,42 MB Share Document on Facebook

	Dimensionality-reduced subspace clustering Reinhard Heckel, Michael Tschannen, and Helmut B¨olcskei December 14, 2015 Abstract Subspace clustering refers to the problem of clustering unlabeled high-dimensional data DocID: 1tJCk - View Document
	LUDWIGMAXIMILIANSUNIVERSITY MUNICH DEPARTMENT INSTITUTE FOR INFORMATICS DocID: 1rbUx - View Document
	Discovering Strong Skyline Points in High Dimensional Spaces Zhenjie Zhang Xinyu Guo DocID: 1qXsi - View Document
	The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives Arthur Zimek & Jilles Vreeken DocID: 1pL2J - View Document
	An Interactive Visual Testbed System for Dimension Reduction and Clustering of Large-scale High-dimensional Data Jaegul Choo, Hanseung Lee, Zhicheng Liu, John Stasko, and Haesun Park Georgia Institute of Technology, USA DocID: 1pzSB - View Document