Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In this paper, we show that cluster ensemble aggregation techniques such as conse...

The aim of this paper is to develop an individual neural network generation and ensemble algorithm based on quotient space granularity clustering. Firstly, we give the characteristics of the quotient space granularity and affinity propagation(AP) clustering. Secondly, we introduce the quotient space concept to the AP clustering analysis, which can find an optimal granularity from all possible g...

We formulate ensemble clustering as a regularization problem over nuclear norm and cluster-wise group norm, and present an efficient optimization algorithm, which we call Robust Convex Ensemble Clustering (RCEC). A key feature of RCEC allows to remove anomalous cluster assignments obtained from component clustering methods by using the group-norm regularization. Moreover, the proposed method is...

the article suggests an algorithm for regular classifier ensemble methodology. the proposed methodology is based on possibilistic aggregation to classify samples. the argued method optimizes an objective function that combines environment recognition, multi-criteria aggregation term and a learning term. the optimization aims at learning backgrounds as solid clusters in subspaces of the high-dim...

Representation learning and unsupervised learning are two central topics of machine learning and signal processing. Deep learning is one of the most effective unsupervised representation learning approach. The main contributions of this paper to the topics are as follows. (i) We propose to view the representative deep learning approaches as special cases of the knowledge reuse framework of clus...

Background: In recent years unsupervised ensemble clustering methods have been successfully applied to DNA microarray data analysis to improve the accuracy and the reliability of clustering results. Nevertheless, a major problem is represented by the fact that classes of functionally correlated examples (e.g. subclasses of diseases characterized at bio-molecular level) are not in general clearl...

MOTIVATION It is far from trivial to select the most effective clustering method and its parameterization, for a particular set of gene expression data, because there are a very large number of possibilities. Although many researchers still prefer to use hierarchical clustering in one form or another, this is often sub-optimal. Cluster ensemble research solves this problem by automatically comb...

The biases of individual algorithms for non-parametric document clustering can lead to non-optimal solutions. Ensemble clustering methods may overcome this limitation, but have not been applied to document collections. This paper presents a comparison of strategies for non-parametric document ensemble clustering.

Clustering ensemble combines some clustering outputs to obtain better results. High robustness, accuracy and stability are the most important characteristics of clustering ensembles. Previous clustering ensembles usually use k-means to generate ensemble members. The main problem of k-means is initial samples which have high effect on final results. Refining initial samples of kmeans increases t...