Highly Coherent Pattern Identification Using Graph-based Clustering
نویسندگان
چکیده
This paper presents an enhanced graph based parameter independent clustering technique. The algorithm produces highly coherent clusters in terms of visual representation and cluster validity measures. The technique finds highly coherent patterns of genes having high biological relevance. The method was tested on four real life datasets and the results compared with those of other similar algorithms in terms of various quality measures and found to be significantly better.
منابع مشابه
An effective graph-based clustering technique to identify coherent patterns from gene expression data
This paper presents an effective parameter-less graph based clustering technique (GCEPD). GCEPD produces highly coherent clusters in terms of various cluster validity measures. The technique finds highly coherent patterns containing genes with high biological relevance. Experiments with real life datasets establish that the method produces clusters that are significantly better than other simil...
متن کاملGraph Based Hybrid Clustering With Unbounded Regions
An extension of the hybrid clustering approach is proposed for partitioning data with possibly unbounded polygon regions. Clustering or partitioning data into relatively homogeneous and coherent subpopulations can be an effective pre-processing method to achieve data analysis tasks such as pattern recognition and classification. Our method uses a graph to model the initial manual partition of t...
متن کاملImage Segmentation Using Pairwise Correlation Clustering
A pairwise hypergraph based image segmentation framework is formulated in a supervised manner for various images. The image segmentation is to infer the edge label over the pairwise hypergraph by maximizing the normalized cuts. Correlation clustering which is a graph partitioning algorithm, was shown to be effective in a number of applications such as identification, clustering of documents and...
متن کاملIdentification of individual coherent sets associated with flow trajectories using coherent structure coloring.
We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data are available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze the distance in higher-dimensional eigenspace between a selected reference tr...
متن کاملA Graph-Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction
The fact that clustering is perhaps the most used technique for exploratory data analysis is only a semaphore that underlines its fundamental importance. The general problem statement that broadly describes clustering as the identification and classification of patterns into coherent groups also implicitly indicates it’s utility in other tasks such as supervised learning. In the past decade and...
متن کامل