TY - JFULL
AU - Dyah E. Herwindiati
PY - 2012/4/
TI - The Robust Clustering with Reduction Dimension
T2 - International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering
SP - 198
EP - 204
EM - herwindiati@untar.ac.id
VL - 6
SN - 1307-6892
UR - http://waset.org/publications/14058
PU - World Academy of Science, Engineering and Technology
NX - International Science Index 63, 2012
N2 - A clustering is process to identify a homogeneous
groups of object called as cluster. Clustering is one interesting topic
on data mining. A group or class behaves similarly characteristics.
This paper discusses a robust clustering process for data images with
two reduction dimension approaches; i.e. the two dimensional
principal component analysis (2DPCA) and principal component
analysis (PCA). A standard approach to overcome this problem is
dimension reduction, which transforms a high-dimensional data into
a lower-dimensional space with limited loss of information. One of
the most common forms of dimensionality reduction is the principal
components analysis (PCA). The 2DPCA is often called a variant of
principal component (PCA), the image matrices were directly treated
as 2D matrices; they do not need to be transformed into a vector so
that the covariance matrix of image can be constructed directly using
the original image matrices. The decomposed classical covariance
matrix is very sensitive to outlying observations. The objective of
paper is to compare the performance of robust minimizing vector
variance (MVV) in the two dimensional projection PCA (2DPCA)
and the PCA for clustering on an arbitrary data image when outliers
are hiden in the data set. The simulation aspects of robustness and
the illustration of clustering images are discussed in the end of
paper
ER -