paper-with-me

홈 › Papers

The effect of measurement error on clustering algorithms

2020-05-24 · Paulina Pankowska, Daniel L. Oberski

Clustering consists of a popular set of techniques used to separate data into interesting groups for further analysis. Many data sources on which clustering is performed are well-known to contain random and systematic measurement errors. Such errors may adversely affect clustering. While several techniques have been developed to deal with this problem, little is known about the effectiveness of these solutions. Moreover, no work to-date has examined the effect of systematic errors on clustering solutions. In this paper, we perform a Monte Carlo study to investigate the sensitivity of two common clustering algorithms, GMMs with merging and DBSCAN, to random and systematic error. We find that measurement error is particularly problematic when it is systematic and when it affects all variables in the dataset. For the conditions considered here, we also find that the partition-based GMM with merged components is less sensitive to measurement error than the density-based DBSCAN procedure.

📄 PDF Abstract BibTeX arXiv:2005.11743

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Comparison three methods of clustering: k-means, spectral clustering and hierarchical clustering

2013-12-19 · Kamran Kowsari

Comparison of three kind of the clustering and find cost function and loss function and calculate them. Error rate of the clustering methods and how to calculate the error percentage always be one on the important factor…

AttributeClustering

Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms

2018-01-21 · Waleed Alomoush, Ayat Alrosan

Fuzzy clustering is a famous unsupervised learning method used to collecting similar data elements within cluster according to some similarity measurement. But, clustering algorithms suffer from some drawbacks. Among the…

Clustering

Autoencoder Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm

2022-09-09 · Jonas Köhne, Lars Henning, Clemens Gühmann

This paper introduces an algorithm for the detection of change-points and the identification of the corresponding subsequences in transient multivariate time-series data (MTSD). The analysis of such data has become more …

ClusteringClustering Algorithms EvaluationClustering Multivariate Time SeriesTime Series+1

LSTM based Similarity Measurement with Spectral Clustering for Speaker Diarization

2019-07-23 · Qingjian Lin, Ruiqing Yin, Ming Li, Hervé Bredin 외

More and more neural network approaches have achieved considerable improvement upon submodules of speaker diarization system, including speaker change detection and segment-wise speaker embedding extraction. Still, in th…

Change DetectionClusteringspeaker-diarizationSpeaker Diarization

Efficient model selection in switching linear dynamic systems by graph clustering

2020-12-08 · Parisa Karimi, Mark Butala, Zhizhen Zhao, Farzad Kamalabadi

The computation required for a switching Kalman Filter (SKF) increases exponentially with the number of system operation modes. In this paper, a computationally tractable graph representation is proposed for a switching …

ClusteringGraph ClusteringModel Selection