Search results for "Clustering"
showing 10 items of 446 documents
FPCA Algorithm For Waveform Clustering
2011
Similar features between waveform data recorded for earthquakes at different time instants could suggest similar behavior of the source process of the corresponding source seismic process. In this paper we combine the aim of finding clusters from a set of individual waveform curves with the functional nature of data, applying a variant of a k-means algorithm based on the principal component rotation of data. This approach overcome the limitation of the cross-correlation, and represents an alternative to methods based on the interpolation of data by splines or linear fitting.
Plaid model for microarray data: an enhancement of the pruning step
2010
Microarrays have become a standard tool for studying gene functions. For example, we can investigate if a subset of genes shows a coherent expression pattern under different conditions. The plaid model, a model-based biclustering method, can be used to incorporate the addiction structure used for the microarray experiment. In this paper we describe an enhancement for the plaid model algorithm based on the theory of the false discovery rate.
Simultaneous seismic wave clustering and registration
2012
In this paper we introduce a simple procedure to identify clusters of multivariate waveforms based on a simultaneous assignation and alignment procedure. This approach is aimed at the identification of clusters of earthquakes, assuming that similarities between seismic events with respect to hypocentral parameters and focal mechanism correspond to similarities between waveforms of events. Therefore we define a distance measure between seismic curves in R^d d>=1, in order to interpret and better understand the main features of the generating seismic process.
A New Dissimilarity Measure for Clustering Seismic Signals
2011
Hypocenter and focal mechanism of an earthquake can be determined by the analysis of signals, named waveforms, related to the wave field produced and recorded by a seismic network. Assuming that waveform similarity implies the similarity of focal parameters, the analysis of those signals characterized by very similar shapes can be used to give important details about the physical phenomena which have generated an earthquake. Recent works have shown the effectiveness of cross-correlation and/or cross-spectral dissimilarities to identify clusters of seismic events. In this work we propose a new dissimilarity measure between seismic signals whose reliability has been tested on real seismic dat…
Clustering and Registration of Multidimensional Functional Data
2013
In order to find similarity between multidimensional curves, we consider the application of a procedure that provides a simultaneous assignation to clusters and alignment of such functions. In particular we look for clusters of multivariate seismic waveforms based on EM-type procedure and functional data analysis tools.
Functional Linear Models for the Analysis of Similarity of Waveforms
2023
In seismology methods based on waveform similarity analysis are adopted to identify sequences of events characterized by similar fault mechanism and propagation pattern. Seismic waves can be considered as spatially interdependent, three dimensional curves depending on time and the waveform similarity analysis can be configured as a functional clustering approach, on the basis of which the membership is assessed by the shape of the temporal patterns. For providing qualitative extraction of the most important information from the recorded signals, we propose the use of metadata, related to the waves, as covariates of a functional response regression model. The temporal patterns of this effect…
An integrated fuzzy cells-classifier
2007
This paper introduces a genetic algorithm able to combine different classifiers based on different distance functions. The use of a genetic algorithm is motivated by the fact that the combination phase is based on the optimization of a vote strategy. The method has been applied to the classification of four types of biological cells, results show an improvement of the recognition rate using the genetic algorithm combination strategy compared with the recognition rate of each single classifier.
A Combined Fuzzy and Probabilistic Data Descriptor for Distributed CBIR
2009
With the wide diffusion of digital image acquisition devices, the cost of managing hundreds of digital images is quickly increasing. Currently, the main way to search digital image libraries is by keywords given by the user. However, users usually add ambiguos keywords for large set of images. A content-based system intended to automatically find a query image, or similar images, within the whole collection is needed. In our work we address the scenario where medical image collections, which nowadays are rapidly expanding in quantity and heterogeneity, are shared in a distributed system to support diagnostic and preventive medicine. Our goal is to produce an efficient content-based descript…
Unsupervised tissue classification of brain MR images for voxel-based morphometry analysis
2016
In this article, a fully unsupervised method for brain tissue segmentation of T1-weighted MRI 3D volumes is proposed. The method uses the Fuzzy C-Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro-radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial-and-error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro-Spinal Fluid in …
Distance-constrained data clustering by combined k-means algorithms and opinion dynamics filters
2014
Data clustering algorithms represent mechanisms for partitioning huge arrays of multidimensional data into groups with small in–group and large out–group distances. Most of the existing algorithms fail when a lower bound for the distance among cluster centroids is specified, while this type of constraint can be of help in obtaining a better clustering. Traditional approaches require that the desired number of clusters are specified a priori, which requires either a subjective decision or global meta–information knowledge that is not easily obtainable. In this paper, an extension of the standard data clustering problem is addressed, including additional constraints on the cluster centroid di…