Back to Results
First PageMeta Content
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

Document Date: 2002-10-04 04:14:41


Open Document

File Size: 1,42 MB

Share Result on Facebook

City

Grid / Edinburgh / /

Country

Scotland / /

Currency

pence / /

/

Facility

University of Halle Kurt-Mothes-Str.1 / Institute of Computer Science / /

IndustryTerm

cient algorithms / erent clustering algorithms / hierarchical clustering algorithms / cient clustering algorithms / ective algorithms / locality-based clustering algorithms / randomised and bounded search strategy / split algorithm / ective available clustering algorithms / /

Organization

University of Halle Kurt-Mothes-Str.1 / Very Large Data Base Endowment / Institute of Computer Science / /

Person

Daniel A. Keim / /

Position

representative / General / /

Product

Pentax K-x Digital Camera / /

Technology

locality-based clustering algorithms / OptiGrid algorithm / condensation / erent clustering algorithms / hierarchical clustering algorithms / split algorithm / cient algorithms / cient clustering algorithms / DBSCAN algorithm / CAD / existing algorithms / /

SocialTag