The paper exposes a non-parametric approach to latent and co-latent modeling of bivariate data, based upon alternating minimization of the Kullback-Leibler divergence (EM algorithm) for complete log-linear models. For categorical data, the iterative algorithm generates a soft clustering of both rows and columns of the contingency table. Well-known results are systematically revisited, and some ...

Amodel based clustering procedure for data of mixed type, clustMD, is developed using a latent variable model. It is proposed that a latent variable, following a mixture of Gaussian distributions, generates the observed data of mixed type. The observed data may be any combination of continuous, binary, ordinal or nominal variables. clustMD employs a parsimonious covariance structure for the lat...

A model based clustering procedure for data of mixed type, termed clustMD, is developed using a latent variable model. It is proposed that a latent variable, following a mixture of Gaussian distributions, generates the observed data of mixed type. The observed data may be any combination of continuous, binary, ordinal or nominal variables. The model employs a parsimonious covariance structure f...

Complex networks and networked data mining p. 10 In-depth data mining and its application in stock market p. 13 Relevance of counting in data mining tasks p. 14 Term graph model for text classification p. 19 A latent usage approach for clustering Web transaction and building user profile p. 31 Mining quantitative association rules on overlapped intervals p. 43 An approach to mining local causal...