Download subspace clustering

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Open Database Connectivity wikipedia , lookup

Microsoft Jet Database Engine wikipedia , lookup

Functional Database Model wikipedia , lookup

Relational model wikipedia , lookup

Database wikipedia , lookup

Database model wikipedia , lookup

Clusterpoint wikipedia , lookup

Concurrency control wikipedia , lookup

ContactPoint wikipedia , lookup

Transcript
Dimension Selective Self-Organizing Maps
With Time-Varying Structure for Subspace
and Projected Clustering
Presenter: Jheng, Jian-Jhong
Authors: Hansenclever F. Bassani, Aluizio F. R. Araujo
2015 TNNLS
Intelligent Database Systems Lab
Outlines
Motivation
Objectives
Related Work
Methodology
Experiments
Conclusions
Comments
2
Intelligent Database Systems Lab
Motivation
Intelligent Database Systems Lab
Original
SOM
It was not designed
to deal with subspace
clustering.
subspace clustering
4
Intelligent Database Systems Lab
DSSOM
The fixed topology of SOM and DSSOM
requires deep knowledge of the date to be
defined.
5
Intelligent Database Systems Lab
SOM-TVS
However, certain adaptations to this
approach are required for dealing with
subspace clustering.
6
Intelligent Database Systems Lab
LARFDS
SOM
Important modifications with respect to DSSOM.
7
Intelligent Database Systems Lab
Objectives

Important modifications with respect to DSSOM.
8
Intelligent Database Systems Lab
SUBSPACE AND PROJECTED CLUSTERING
Intelligent Database Systems Lab
SUBSPACE CLUSTERING
Intelligent Database Systems Lab
PROJECTED CLUSTERING
Projected clustering seeks to assign each point to a
unique cluster, but clusters may exist in different
subspaces.
The general approach is to use a special distance
function together with a regular clustering algorithm .
Intelligent Database Systems Lab
Related Work

Generalized Principal Components Analysis (GPCA)

Sparse Subspace Clustering (SSC)

Adaptive Resonance Theory (ART)

Local adaptive receptive field self-organizing map for image
color segmentation (LARFSOM)
12
Intelligent Database Systems Lab
GPCA
PCA
GPCA
GPCA is an algebraic geometric method for clustering data
not necessarily in independent linear subspaces.
Intelligent Database Systems Lab
SSC
SSC is based on the idea of writing a point (x j ) as a linear or
affine combination of neighbor data points. It uses the principle
of sparsity to choose any of the remaining data points as a
possible neighbor.
Intelligent Database Systems Lab
Methodology
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
EXPERIMENTS
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Intelligent Database Systems Lab
Conclusions

The behavior of LARFDSSOM was shown to have led to a
significant improvement over DSSOM in a number of points.

It does not need to know the exact number of clusters.

Improvement entails the computational cost.

Improvement is the clustering quality.
28
Intelligent Database Systems Lab