Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

130

Voted

NN
2002
Springer

144views Neural Networks» more NN 2002»

Projective ART for clustering data sets in high dimensional spaces

15 years 2 months ago

Projective ART for clustering data sets in high dimensional spaces

Download www.math.yorku.ca

A new neural network architecture (PART) and the resulting algorithm are proposed to

Yongqiang Cao, Jianhong Wu

Real-time Traffic

Inherent Sparsity | Neural Network Architecture | Neural Networks | NN 2002 | Selective Output |

claim paper

Related Content

» Finding Generalized Projected Clusters In High Dimensional Spaces

» Optimal GridClustering Towards Breaking the Curse of Dimensionality in HighDimensional Clu...

» Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces

» Clustering high dimensional data using subspace and projected clustering algorithms

» On Class Visualisation for High Dimensional Data Exploring Scientific Data Sets

» What Is the Nearest Neighbor in High Dimensional Spaces

» Generalized Projected Clustering in HighDimensional Data Streams

» Targeted Projection Pursuit for Interactive Exploration of High Dimensional Data Sets

» OCluster Scalable Clustering of Large High Dimensional Data Sets

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	NN
Authors	Yongqiang Cao, Jianhong Wu

Comments (0)