Search results for "cluster analysis"

MPWCA-L: A New Clustering Algorithm to Improve Stability and QoS in MANETs

2013

Fully automatic multispectral MR image segmentation of prostate gland based on the fuzzy C-means clustering algorithm

2017

Prostate imaging is a very critical issue in the clinical practice, especially for diagnosis, therapy, and staging of prostate cancer. Magnetic Resonance Imaging (MRI) can provide both morphologic and complementary functional information of tumor region. Manual detection and segmentation of prostate gland and carcinoma on multispectral MRI data is not easily practicable in the clinical routine because of the long times required by experienced radiologists to analyze several types of imaging data. In this paper, a fully automatic image segmentation method, exploiting an unsupervised Fuzzy C-Means (FCM) clustering technique for multispectral T1-weighted and T2-weighted MRI data processing, is…

Design of composite measure schemes for comparative severity assessment in animal-based neuroscience research: A case study focussed on rat epilepsy …

2020

PLOS ONE 15(5), e0230141 (2020). doi:10.1371/journal.pone.0230141

Statistical Methods for the Geographical Analysis of Rare Diseases

2010

In this chapter we provide a summary of different methods for the detection of disease clusters. First of all, we give a summary of methods for computing estimates of the relative risk. These estimates provide smoothed values of the relative risks that can account for its spatial variation. Some methods for assessing spatial autocorrelation and general clustering are also discussed to test for significant spatial variation of the risk. In order to find the actual location of the clusters, scan methods are introduced. The spatial scan statistic is discussed as well as its extension by means of Generalised Linear Models that allows for the inclusion of covariates and cluster effects. In this …

Interpretable machine learning models for single-cell ChIP-seq imputation

2019

AbstractMotivationSingle-cell ChIP-seq (scChIP-seq) analysis is challenging due to data sparsity. High degree of data sparsity in biological high-throughput single-cell data is generally handled with imputation methods that complete the data, but specific methods for scChIP-seq are lacking. We present SIMPA, a scChIP-seq data imputation method leveraging predictive information within bulk data from ENCODE to impute missing protein-DNA interacting regions of target histone marks or transcription factors.ResultsImputations using machine learning models trained for each single cell, each target, and each genomic region accurately preserve cell type clustering and improve pathway-related gene i…

An evolutionary restricted neighborhood search clustering approach for PPI networks

2014

Protein-protein interaction networks have been broadly studied in the last few years, in order to understand the behavior of proteins inside the cell. Proteins interacting with each other often share common biological functions or they participate in the same biological process. Thus, discovering protein complexes made of a group of proteins strictly related can be useful to predict protein functions. Clustering techniques have been widely employed to detect significant biological complexes. In this paper, we integrate one of the most popular network clustering techniques, namely the Restricted Neighborhood Search Clustering (RNSC), with evolutionary computation. The two cost functions intr…

SOM-Based Class Discovery for Emotion Detection Based on DEAP Dataset

2018

This paper investigates the possibility of identifying classes by clustering. This study includes employing Self-Organizing Maps (SOM) in identifying clusters from EEG signals that could then be mapped to emotional classes. Beginning by training varying sizes of SOM with the EEG data provided from the public dataset: DEAP. The produced graphs showing Neighbor Distance, Sample Hits, and Weight Position are examined. Following that, the ground-truth label provided in DEAP is tested, in order to identify correlations between the label and the clusters produced by the SOM. The results show that there is a potential of class discovery using SOM-based clustering. It is then concluded that by eval…

Three-domain image representation for personal photo album management

2010

In this paper we present a novel approach for personal photo album management. Pictures are analyzed and described in three representation spaces, namely, faces, background and time of capture. Faces are automatically detected and rectified using a probabilistic feature extraction technique. Face representation is then produced by computing PCA (Principal Component Analysis). Backgrounds are represented with low-level visual features based on RGB histogram and Gabor filter bank. Temporal data is obtained through the extraction of EXIF (Exchangeable image file format) data. Each image in the collection is then automatically organized using a mean-shift clustering technique. While many system…

Maximum Common Subgraph based locally weighted regression

2012

This paper investigates a simple, yet effective method for regression on graphs, in particular for applications in chem-informatics and for quantitative structure-activity relationships (QSARs). The method combines Locally Weighted Learning (LWL) with Maximum Common Subgraph (MCS) based graph distances. More specifically, we investigate a variant of locally weighted regression on graphs (structures) that uses the maximum common subgraph for determining and weighting the neighborhood of a graph and feature vectors for the actual regression model. We show that this combination, LWL-MCS, outperforms other methods that use the local neighborhood of graphs for regression. The performance of this…

Three-dimensional Fuzzy Kernel Regression framework for registration of medical volume data

2013

Abstract In this work a general framework for non-rigid 3D medical image registration is presented. It relies on two pattern recognition techniques: kernel regression and fuzzy c-means clustering. The paper provides theoretic explanation, details the framework, and illustrates its application to implement three registration algorithms for CT/MR volumes as well as single 2D slices. The first two algorithms are landmark-based approaches, while the third one is an area-based technique. The last approach is based on iterative hierarchical volume subdivision, and maximization of mutual information. Moreover, a high performance Nvidia CUDA based implementation of the algorithm is presented. The f…