Parametric model-based clustering
نویسندگان
چکیده
Parametric, model-based algorithms learn generative models from the data, with each model corresponding to one particular cluster. Accordingly, the model-based partitional algorithm will select the most suitable model for any data object (Clustering step), and will recompute parametric models using data specifically from the corresponding clusters (Maximization step). This Clustering-Maximization framework have been widely used and have shown promising results in many applications including complex variable-length data.
منابع مشابه
A robust wavelet based profile monitoring and change point detection using S-estimator and clustering
Some quality characteristics are well defined when treated as response variables and are related to some independent variables. This relationship is called a profile. Parametric models, such as linear models, may be used to model profiles. However, in practical applications due to the complexity of many processes it is not usually possible to model a process using parametric models.In these cas...
متن کاملNonparametric Information Theoretic Clustering Algorithm
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the data are given in terms of distributions nor impose any parametric model on the within-cluster distribution. Instead, we utilize a non-parametric estimation of the average cluster entropies and search for a clustering t...
متن کاملClustering of financial time series in extreme scenarios
A methodology is presented for clustering financial time series in extreme scenario. The procedure is based on the calculation of some suitable pairwise conditional Spearman’s correlation coefficients. It does not assume any parametric model describing the time series under investigation, but only relies on the assumption that they follows a multivariate copula-GARCH model.
متن کاملA Bayesian semi-parametric approach to cluster heterogeneous time series
Majority of time series clustering research is focused on calculating similarity metrics between individual series, which in conjunction with traditional clustering algorithm partitions the data into similar groups (clusters). A major challenge lies in obtaining partitions when the number of clusters is not known in advance. Another challenge in such a clustering problem is to apply known hiera...
متن کاملA New Parametric Estimation Method for Graph-based Clustering
Relational clustering has received much attention from researchers in the last decade. In this paper we present a parametric method that employs a combination of both hard and soft clustering. Based on the corresponding Markov chain of an affinity matrix, we simulate a probability distribution on the states by defining a conditional probability for each subpopulation of states. This probabilist...
متن کامل