Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion. Factorial PD-clustering is based on Probabilistic Distance clustering (PD-clustering). PD-clustering is an iterative, distribution free, probabilistic, clustering method. Factorial PD-clustering make a linear transformation of original variables into a reduced number of orthogonal ones using a common criterion with PD-Clustering. It is demonstrated that Tucker 3 decomposition allows to obtain this transformation. Factorial PD-clustering makes alternatively a Tucker 3 decomposition and a PD-clustering on transformed data until convergence. This method could significantly improve the algorithm performance and allows to work with large dataset, to improve the stability and the robustness of the method.
[1]
Cem Iyigun,et al.
Probabilistic D-Clustering
,
2008,
J. Classif..
[2]
H. Kiers,et al.
Factorial k-means analysis for two-way data
,
2001
.
[3]
Heungsun Hwang,et al.
An Extension of Multiple Correspondence Analysis for Identifying Heterogeneous Subgroups of Respondents
,
2006
.
[4]
M. Shirosaki.
Another proof of the defect relation for moving targets
,
1991
.
[5]
Francesco Palumbo,et al.
Clustering and Dimensionality Reduction to Discover Interesting Patterns in Binary Data
,
2008,
GfKl.
[6]
P. Kroonenberg.
Applied Multiway Data Analysis
,
2008
.