103 search results - page 2 / 21 » Projective ART for clustering data sets in high dimensional ... |
DIS
2006
Springer
13 years 9 months ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
APWEB
2006
Springer
13 years 9 months ago
2006
Springer
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
IV
2007
IEEE
13 years 11 months ago
2007
IEEE
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...