Novel Dual-Constraint-Based Semi-Supervised Deep Clustering Approach.

Semi-supervised clustering methods are applied in various fields. However, these methods have the limitations when the size of data is large. Thus, distributed clustering models are proposed. By separating data set into some parts, distributed models overcome the challenges of big size dataset. In this paper, a novel model, based on semi-supervised fuzzy clustering and distributed mechanism, is proposed. In our research, the method to define distributed additional information is introduced. This additional information is used to implement distributed semi-supervised fuzzy clustering model on three datasets. The main contribution in this paper is the proposal of distributed semi-supervised fuzzy clustering algorithm (denoted as DSSFCM) that performs on Master – Slave model on homogeneous datasets.

ObjectiveCluster analysis of spatio-temporal event-related potential (ERP) data is a promising tool for exploring the measurement time window of ERPs. However, even after preprocessing, the remaining noise can result in uncertain cluster maps followed by unreliable time windows while clustering via conventional clustering methods. MethodsWe designed an ensemble deep clustering pipeline to determine a reliable time window for the ERP of interest from temporal concatenated grand average ERP data. The proposed pipeline includes semi-supervised deep clustering methods initialized by consensus clustering and unsupervised deep clustering methods with end-to-end architectures. Ensemble clustering from those deep clusterings was used by the designed adaptive time window determination to estimate the time window. ResultsAfter applying simulated and real ERP data, our method successfully obtained the time window for identifying the P3 components (as the interest of both ERP studies) while additional noise (e.g., adding 20 dB to −5 dB white Gaussian noise) was added to the prepared data. ConclusionCompared to the state-of-the-art clustering methods, a superior clustering performance was yielded from both ERP data. Furthermore, more stable and precise time windows were elicited as the noise increased. SignificanceOur study provides a complementary understanding of identifying the cognitive process using deep clustering analysis to the existing studies. Our finding suggests that deep clustering can be used to identify the ERP of interest when the data is imperfect after preprocessing.

In this paper, a novel semi-supervised subtractive clustering method using pair wise constraints is proposed. Because the traditional subtractive clustering method cannot obtain the better clustering accuracies, some pair wise constraints regarded as supervised information are applied to aiding the process of the traditional subtractive clustering. Experimental results show that the new presented semi-supervised clustering method can improve the clustering performance significantly compared to the unsupervised subtractive clustering.

Semisupervised clustering extends standard clustering methods to the semisupervised setting, in some cases considering situations when clusters are associated with a given outcome variable that acts as a “noisy surrogate,” that is a good proxy of the unknown clustering structure. In this article, a novel approach to semisupervised clustering associated with an outcome variable named network‐based semisupervised clustering (NeSSC) is introduced. It combines an initialization, a training and an agglomeration phase. In the initialization and training a matrix of pairwise affinity of the instances is estimated by a classifier. In the agglomeration phase the matrix of pairwise affinity is transformed into a complex network, in which a community detection algorithm searches the underlying community structure. Thus, a partition of the instances into clusters highly homogeneous in terms of the outcome is obtained. We consider a particular specification of NeSSC that uses classification or regression trees as classifiers and the Louvain, Label propagation and Walktrap as possible community detection algorithm. NeSSC's stopping criterion and the choice of the optimal partition of the original data are also discussed. Several applications on both real and simulated data are presented to demonstrate the effectiveness of the proposed semisupervised clustering method and the benefits it provides in terms of improved interpretability of results with respect to three alternative semisupervised clustering methods.

Recently, deep clustering methods have achieved remarkable results compared to traditional clustering approaches. However, its performance remains constrained by the absence of annotations. A thought-provoking observation is that there is still a significant gap between deep clustering and semi-supervised classification methods. Even with only a few labeled samples, the accuracy of semi-supervised learning is much higher than that of clustering. Given that we can annotate a small number of samples in a certain unsupervised way, the clustering task can be naturally transformed into a semi-supervised setting, thereby achieving comparable performance. Based on this intuition, we propose ClusMatch, a unified positive and negative pseudo-label learning based semi-supervised learning framework, which is pluggable and can be applied to existing deep clustering methods. Specifically, we first leverage the pre-trained deep clustering network to compute predictions for all samples, and then design specialized selection strategies to pick out a few high-quality samples as labeled samples for supervised learning. For the unselected samples, the novel unified positive and negative pseudo-label learning is introduced to provide additional supervised signals for semi-supervised fine-tuning. We also propose an adaptive positive-negative threshold learning strategy to further enhance the confidence of generated pseudo-labels. Extensive experiments on six widely-used datasets and one large-scale dataset demonstrate the superiority of our proposed ClusMatch. For example, ClusMatch achieves a significant accuracy improvement of 5.4% over the state-of-the-art method ProPos on an average of these six datasets.

Objective: Churn prediction process on telecom industry is performed using background knowledge such as user information and application oriented constraints with the aim of clustering churn items of telecom communication users. Methods: This paper proposes Semi-supervised Constraint based Churn Clustering (SCCC) method. Semi-supervised learning method identifies different types of churns for labelled data items in telecom industry. PCK Mean based Clusteringwith Expectation Maximization (EM) algorithm finds cluster labels and distance metric for easy grouping of faults set. Similar types of issues are mapped with fast traversal procedure. Constraint based Cluster Membership achieves effective churns clustering by considering relative pairing of users. Findings: The proposed Semi-supervised Constraint based Churn Clustering (SCCC) method is implemented by using JAVA language. This JAVA language uses the code to effectively identify the churns in telecom industry. The SCCC method uses a churn dataset for conducting the experimental work.Experiment is conducted on the factors such as execution time, accuracy, clustering efficiency and support rate on predicting the churns in telecom industry. Experimental results show that the proposed Semi-supervised Constraint based Churn Clustering (SCCC) method out performs than the existing methods. Improvement: Proposed method is able to minimize the execution time, improve accuracy and clustering efficiency and also increase the support rate on predicting churns in telecom industry.Keywords: Cluster Membership, Churn Prediction, Expectation Maximization, Semi-Supervised Clustering

Dental X-ray image segmentation has an important role in practical dentistry and is widely used in the discovery of odontological diseases, tooth archeology and in automated dental identification systems. Enhancing the accuracy of dental segmentation is the main focus of researchers, involving various machine learning methods to be applied in order to gain the best performance. However, most of the currently used methods are facing problems of threshold, curve functions, choosing suitable parameters and detecting common boundaries among clusters. In this paper, we will present a new semi-supervised fuzzy clustering algorithm named as SSFC-FS based on Interactive Fuzzy Satisficing for the dental X-ray image segmentation problem. Firstly, features of a dental X-Ray image are modeled into a spatial objective function, which are then to be integrated into a new semi-supervised fuzzy clustering model. Secondly, the Interactive Fuzzy Satisficing method, which is considered as a useful tool to solve linear and nonlinear multi-objective problems in mixed fuzzy-stochastic environment, is applied to get the cluster centers and the membership matrix of the model. Thirdly, theoretically validation of the solutions including the convergence rate, bounds of parameters, and the comparison with solutions of other relevant methods is performed. Lastly, a new semi-supervised fuzzy clustering algorithm that uses an iterative strategy from the formulae of solutions is designed. This new algorithm was experimentally validated and compared with the relevant ones in terms of clustering quality on a real dataset including 56 dental X-ray images in the period 2014–2015 of Hanoi Medial University, Vietnam. The results revealed that the new algorithm has better clustering quality than other methods such as Fuzzy C-Means, Otsu, eSFCM, SSCMOO, FMMBIS and another version of SSFC-FS with the local Lagrange method named SSFC-SC. We also suggest the most appropriate values of parameters for the new algorithm.

Semi-supervised clustering takes advantage of some labeled data called seeds to bring a great benefit to the clustering of unlabeled data. This paper presents a novel semi-supervised clustering method based on one-class support vector machine, which applies a novel decision rule to assigning the class label to one data point. To investigate the effectiveness of our approach, experiments are done on one artificial data set and two real datasets. Experimental results show that the proposed method can improve the clustering performance significantly compared to other semi-supervised clustering algorithms when using a very small amount of seeds.

Hyperspectral images (HSIs) own inherent complexity, so, clustering for HSIs is a very challenging task. In this paper, we utilized a semi-supervised subspace clustering method based on non-negative low-rank representation (NNLRR) algorithm for HSI clustering. Firstly, NNLRR used Gaussian fields and harmonic functions into the low-rank representation (LRR) model. Secondly, NNLRR guided the affinity matrix construction by the supervision information. Next, finding a non-negative low-rank matrix, the matrix represents each sample by some other linear combination points, and the affinity matrix is obtained by the matrix. Then, accomplishing the affinity matrix construction and subspace clustering simultaneously. Thanks for the unification of the two steps, we can guarantee the overall optimum. Experimental results on classical data set show that, the algorithm is effective for hyperspectral image clustering.

Semi-supervised clustering leverages side information such as pairwise constraints to guide clustering procedures. Despite promising progress, existing semi-supervised clustering approaches overlook the condition of side information being generated sequentially, which is a natural setting arising in numerous real-world applications such as social network and e-commerce system analysis. Given emerged new constraints, classical semi-supervised clustering algorithms need to re-optimize their objectives over all data samples and constraints in availability, which prevents them from efficiently updating the obtained data partitions. To address this challenge, we propose an efficient dynamic semi-supervised clustering framework that casts the clustering problem into a search problem over a feasible convex set, i.e., a convex hull with its extreme points being an ensemble of m data partitions. According to the principle of ensemble clustering, the optimal partition lies in the convex hull, and can thus be uniquely represented by an m-dimensional probability simplex vector. As such, the dynamic semi-supervised clustering problem is simplified to the problem of updating a probability simplex vector subject to the newly received pairwise constraints. We then develop a computationally efficient updating procedure to update the probability simplex vector in O(m2) time, irrespective of the data size n. Our empirical studies on several real-world benchmark datasets show that the proposed algorithm outperforms the state-of-the-art semi-supervised clustering algorithms with visible performance gain and significantly reduced running time.

Facilitated by the powerful feature extraction ability of neural networks, deep clustering has achieved great success in analyzing high-dimensional and complex real-world data. The performance of deep clustering methods is affected by various factors such as network structures and learning objectives. However, as pointed out in this survey, the essence of deep clustering lies in the incorporation and utilization of prior knowledge, which is largely ignored by existing works. From pioneering deep clustering methods based on data structure assumptions to recent contrastive clustering methods based on data augmentation invariances, the development of deep clustering intrinsically corresponds to the evolution of prior knowledge. In this survey, we provide a comprehensive review of deep clustering methods by categorizing them into six types of prior knowledge. We find that in general the prior innovation follows two trends, namely, i) from mining to constructing, and ii) from internal to external. Besides, we provide a benchmark on five widely-used datasets and analyze the performance of methods with diverse priors. By providing a novel prior knowledge perspective, we hope this survey could provide some novel insights and inspire future research in the deep clustering community.

Semi-supervised fuzzy clustering with metric learning and entropy regularization

ABSTRACTThe objective of map regionalization is to group contiguous objects on a map into larger entities sharing similar properties or relationships, resulting in homogeneous regions that are easier to interpret. We propose a strategy to interactively incorporate human perception of homogeneous regions to improve unsupervised regionalization processes. The approach fits within the well-known segmentation/clustering framework. The method operates on a categorical map, introduces a contour detector for boundaries delineation with better resolution power than a regular grid tessellation to initiate a region growing process, and integrates the role of a human analyst for better classification of homogeneous areas through a semi-supervised clustering (SSC) method. This last step is achieved using pairwise clustering constraints on regions identified by the analyst on the monitor. The potential of the proposed strategy is illustrated with data extracted from the Earth Observation for the sustainable development of forests (EOSD) map of Canada. Comparisons with a recently introduced algorithm for map regionalization are provided for three different spatial scales at different steps of the method.

The performances of semisupervised clustering for unlabeled data are often superior to those of unsupervised learning, which indicates that semantic information attached to clusters can significantly improve feature representation capability. In a graph convolutional network (GCN), each node contains information about itself and its neighbors that is beneficial to common and unique features among samples. Combining these findings, we propose a deep clustering method based on GCN and semantic feature guidance (GFDC) in which a deep convolutional network is used as a feature generator, and a GCN with a softmax layer performs clustering assignment. First, the diversity and amount of input information are enhanced to generate highly useful representations for downstream tasks. Subsequently, the topological graph is constructed to express the spatial relationship of features. For a pair of datasets, feature correspondence constraints are used to regularize clustering loss, and clustering outputs are iteratively optimized. Three external evaluation indicators, i.e., clustering accuracy, normalized mutual information, and the adjusted Rand index, and an internal indicator, i.e., the Davidson-Bouldin index (DBI), are employed to evaluate clustering performances. Experimental results on eight public datasets show that the GFDC algorithm is significantly better than the majority of competitive clustering methods, i.e., its clustering accuracy is 20% higher than the best clustering method on the United States Postal Service dataset. The GFDC algorithm also has the highest accuracy on the smaller Amazon and Caltech datasets. Moreover, DBI indicates the dispersion of cluster distribution and compactness within the cluster.

Classifying the pixels of satellite images into homogeneous regions is a very challenging task as different regions have different types of land covers. Some land covers contain more regions, while some contain relatively smaller regions (e.g., bridges, roads). In satellite image segmentation, no prior information is available about the number of clusters. Here, in this paper, we have solved this problem using the concepts of semi-supervised clustering which utilizes the property of unsupervised and supervised classification. Three cluster validity indices are utilized, which are simultaneously optimized using AMOSA, a modern multiobjective optimization technique based on the concepts of simulated annealing. The first two cluster validity indices, symmetry distance based Sym-index, and Euclidean distance based I-index, are based on unsupervised properties. The last one is a supervised information based cluster validity index, Minkowski index. For supervised information, initially fuzzy C-mean clustering technique is used. Thereafter, based on the highest membership values of the data points to their respective clusters, randomly 10 % data points with their class labels are chosen. The effectiveness of this proposed semi-supervised clustering technique is demonstrated on three satellite image data sets of different cities of India. Results are also compared with existing clustering techniques.