Categorical data clustering using a minimum message length criterion

Research on cluster analysis for categorical data continues to develop, new clustering algorithms being proposed. However, in this context, the determination of the number of clusters is rarely addressed. We propose a new approach in which clustering and the estimation of the number of clusters is done simultaneously for categorical data. We assume that the data originate from a finite mixture of multinomial distributions and use a minimum message length criterion (MML) to select the number of clusters (Wallace and Bolton, 1986). For this purpose, we implement an EM-type algorithm (Silvestre et al., 2008) based on the (Figueiredo and Jain, 2002) approach. The novelty of the approach rests on the integration of the model estimation and selection of the number of clusters in a single algorithm, rather than selecting this number based on a set of pre-estimated candidate models. The performance of our approach is compared with the use of Bayesian Information Criterion (BIC) (Schwarz, 1978) and Integrated Completed Likelihood (ICL) (Biernacki et al., 2000) using synthetic data. The obtained results illustrate the capacity of the proposed algorithm to attain the true number of cluster while outperforming BIC and ICL since it is faster, which is especially relevant when dealing with large data sets.

Clustering and selecting categorical features

In data clustering, the problem of selecting the subset of most relevant features from the data has been an active research topic. Feature selection for clustering is a challenging task due to the absence of class labels for guiding the search for relevant features. Most methods proposed for this goal are focused on numerical data. In this work, we propose an approach for clustering and selecting categorical features simultaneously. We assume that the data originate from a finite mixture of multinomial distributions and implement an integrated expectation-maximization (EM) algorithm that estimates all the parameters of the model and selects the subset of relevant features simultaneously. The results obtained on synthetic data illustrate the performance of the proposed approach. An application to real data, referred to official statistics, shows its usefulness.

Besnoitia besnoiti and Toxoplasma gondii: two apicomplexan strategies to manipulate the host cell centrosome and Golgi apparatus

Besnoitia besnoiti and Toxoplasma gondii are two closely related parasites that interact with the host cell microtubule cytoskeleton during host cell invasion. Here we studied the relationship between the ability of these parasites to invade and to recruit the host cell centrosome and the Golgi apparatus. We observed that T. gondii recruits the host cell centrosome towards the parasitophorous vacuole (PV), whereas B. besnoiti does not. Notably, both parasites recruit the host Golgi apparatus to the PV but its organization is affected in different ways. We also investigated the impact of depleting and over-expressing the host centrosomal protein TBCCD1, involved in centrosome positioning and Golgi apparatus integrity, on the ability of these parasites to invade and replicate. Toxoplasma gondii replication rate decreases in cells over-expressing TBCCD1 but not in TBCCD1-depleted cells; while for B. besnoiti no differences were found. However, B. besnoiti promotes a reorganization of the Golgi ribbon previously fragmented by TBCCD1 depletion. These results suggest that successful establishment of PVs in the host cell requires modulation of the Golgi apparatus which probably involves modifications in microtubule cytoskeleton organization and dynamics. These differences in how T. gondii and B. besnoiti interact with their host cells may indicate different evolutionary paths.

Fuzzy clustering applied to a demand response model in a smart grid contingency scenario

This paper focus on a demand response model analysis in a smart grid context considering a contingency scenario. A fuzzy clustering technique is applied on the developed demand response model and an analysis is performed for the contingency scenario. Model considerations and architecture are described. The demand response developed model aims to support consumers decisions regarding their consumption needs and possible economic benefits.

ECG Analysis Using Consensus Clustering

Biosignals analysis has become widespread, upstaging their typical use in clinical settings. Electrocardiography (ECG) plays a central role in patient monitoring as a diagnosis tool in today's medicine and as an emerging biometric trait. In this paper we adopt a consensus clustering approach for the unsupervised analysis of an ECG-based biometric records. This type of analysis highlights natural groups within the population under investigation, which can be correlated with ground truth information in order to gain more insights about the data. Preliminary results are promising, for meaningful clusters are extracted from the population under analysis. © 2014 EURASIP.

Fuzzy clustering applied to a demand response model in a smatr grid contingency scenario

This paper focus on a demand response model analysis in a smart grid context considering a contingency scenario. A fuzzy clustering technique is applied on the developed demand response model and an analysis is performed for the contingency scenario. Model considerations and architecture are described. The demand response developed model aims to support consumers decisions regarding their consumption needs and possible economic benefits.

Enhancing the selection of a model-based clustering with external categorical variables

In cluster analysis, it can be useful to interpret the partition built from the data in the light of external categorical variables which are not directly involved to cluster the data. An approach is proposed in the model-based clustering context to select a number of clusters which both fits the data well and takes advantage of the potential illustrative ability of the external variables. This approach makes use of the integrated joint likelihood of the data and the partitions at hand, namely the model-based partition and the partitions associated to the external variables. It is noteworthy that each mixture model is fitted by the maximum likelihood methodology to the data, excluding the external variables which are used to select a relevant mixture model only. Numerical experiments illustrate the promising behaviour of the derived criterion. © 2014 Springer-Verlag Berlin Heidelberg.

Paired indices for clustering evaluation correction for agreement by chance

In the present paper we focus on the performance of clustering algorithms using indices of paired agreement to measure the accordance between clusters and an a priori known structure. We specifically propose a method to correct all indices considered for agreement by chance - the adjusted indices are meant to provide a realistic measure of clustering performance. The proposed method enables the correction of virtually any index - overcoming previous limitations known in the literature - and provides very precise results. We use simulated datasets under diverse scenarios and discuss the pertinence of our proposal which is particularly relevant when poorly separated clusters are considered. Finally we compare the performance of EM and KMeans algorithms, within each of the simulated scenarios and generally conclude that EM generally yields best results.

Synthesis of organometallic Ruthenium(II) complexes with strong activity against several human canceer cell lines

A new family of "RuCp" (Cp=eta(5)-C5H5) derivatives with bidentate N,O and N,N'-heteroaromatic ligands revealed outstanding cytotoxic properties against several human cell lines namely, A2780, A2780CisR, HT29, MCF7, MDAMB231, and PD. IC50 values were much lower than those found for cisplatin. Crystal structure of compound 4 was determined by X-ray diffraction studies. Density functional theory (DFT) calculations performed for compound 1 showed electronic flow from the ruthenium center to the coordinated bidentate ligand, in agreement with the electrochemical studies and the existence of a metal-to-ligand charge-transfer (MLCT) band evidenced by spectroscopic data.

Probabilistic consensus clustering using evidence accumulation

Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence accumulation clustering (EAC) paradigm, the clustering ensemble is transformed into a pairwise co-association matrix, thus avoiding the label correspondence problem, which is intrinsic to other clustering ensemble schemes. In this paper, we propose a consensus clustering approach based on the EAC paradigm, which is not limited to crisp partitions and fully exploits the nature of the co-association matrix. Our solution determines probabilistic assignments of data points to clusters by minimizing a Bregman divergence between the observed co-association frequencies and the corresponding co-occurrence probabilities expressed as functions of the unknown assignments. We additionally propose an optimization algorithm to find a solution under any double-convex Bregman divergence. Experiments on both synthetic and real benchmark data show the effectiveness of the proposed approach.

Enhancing the selection of a model-based clustering with external categorical variables

In cluster analysis, it can be useful to interpret the partition built from the data in the light of external categorical variables which are not directly involved to cluster the data. An approach is proposed in the model-based clustering context to select a number of clusters which both fits the data well and takes advantage of the potential illustrative ability of the external variables. This approach makes use of the integrated joint likelihood of the data and the partitions at hand, namely the model-based partition and the partitions associated to the external variables. It is noteworthy that each mixture model is fitted by the maximum likelihood methodology to the data, excluding the external variables which are used to select a relevant mixture model only. Numerical experiments illustrate the promising behaviour of the derived criterion.

Molecular fingerprint of human gastric cell line infected by Helicobacter pylori

Helicobacter pylori infection represents a serious health problem, given its association with serious gastric diseases as gastric ulcers, cancer and MALT lymphoma. Currently no vaccine exists and antibiotic-based eradication therapy is already failing in more than 20% of cases. To increase the knowledge on the infection process diverse gastric cell lines, e.g. the adenocarcinona gastric (AGS) cell line, are routinely used has in vitro models of gastric epithelia. In the present work the molecular fingerprint of infected and non-infected AGS cell lines, by diverse H. pylori strains, was acquired using vibrational infrared spectroscopy. These molecular fingerprints enabled to discriminate infected from non-infected AGS cells, and infection due to different strains, by performing Principal Component Analysis. It was also possible to estimate, from the AGS cells molecular fingerprint, the effect of the infection on diverse biochemical and metabolic cellular status. In resume infra-red spectroscopy enabled the acquisition of infected AGS cells molecular fingerprint with minimal sample preparation, in a rapid, high-throughput, economic process yielding highly sensitive and informative data, most useful for promoting critical knowledge on the H. pylori infection process. © 2015 IEEE.

A MAP approach to evidence accumulation clustering

The Evidence Accumulation Clustering (EAC) paradigm is a clustering ensemble method which derives a consensus partition from a collection of base clusterings obtained using different algorithms. It collects from the partitions in the ensemble a set of pairwise observations about the co-occurrence of objects in a same cluster and it uses these co-occurrence statistics to derive a similarity matrix, referred to as co-association matrix. The Probabilistic Evidence Accumulation for Clustering Ensembles (PEACE) algorithm is a principled approach for the extraction of a consensus clustering from the observations encoded in the co-association matrix based on a probabilistic model for the co-association matrix parameterized by the unknown assignments of objects to clusters. In this paper we extend the PEACE algorithm by deriving a consensus solution according to a MAP approach with Dirichlet priors defined for the unknown probabilistic cluster assignments. In particular, we study the positive regularization effect of Dirichlet priors on the final consensus solution with both synthetic and real benchmark data.

Comparing clustering solutions: the use of adjusted paired indices

In the present paper we compare clustering solutions using indices of paired agreement. We propose a new method - IADJUST - to correct indices of paired agreement, excluding agreement by chance. This new method overcomes previous limitations known in the literature as it permits the correction of any index. We illustrate its use in external clustering validation, to measure the accordance between clusters and an a priori known structure. The adjusted indices are intended to provide a realistic measure of clustering performance that excludes agreement by chance with ground truth. We use simulated data sets, under a range of scenarios - considering diverse numbers of clusters, clusters overlaps and balances - to discuss the pertinence and the precision of our proposal. Precision is established based on comparisons with the analytical approach for correction specific indices that can be corrected in this way are used for this purpose. The pertinence of the proposed correction is discussed when making a detailed comparison between the performance of two classical clustering approaches, namely Expectation-Maximization (EM) and K-Means (KM) algorithms. Eight indices of paired agreement are studied and new corrected indices are obtained.