Functional data clustering via information maximization
From MaRDI portal
Abstract: A new method for clustering functional data is proposed via information maximization. The proposed method learns a probabilistic classifier in an unsupervised manner so that mutual information (or squared loss mutual information) between data points and cluster assignments is maximized. A notable advantage of this proposed method is that it only involves continuous optimization of model parameters, which is simpler than discrete optimization of cluster assignments and avoids the disadvantages of generative models. Unlike some existing methods, the proposed method does not require estimating the probability densities of Karhunen-Lo`eve expansion scores under different clusters and also does not require the common eigenfunction assumption. The empirical performance and the applications of the proposed methods are demonstrated by simulation studies and real data analyses. In addition, the proposed method allows for out-of-sample clustering, and its effect is comparable with that of some supervised classifiers.
Cites work
- A Functional Data—Analytic Approach to Signal Discrimination
- A new distance with derivative information for functional \(k\)-means clustering algorithm
- A Quantitative Study of Gene Regulation Involved in the Immune Response of Anopheline Mosquitoes
- Algorithm AS 136: A K-Means Clustering Algorithm
- Biclustering analysis of functionals via penalized fusion
- CATS
- Cluster non‐Gaussian functional data
- Clustering for Sparsely Sampled Functional Data
- Clustering Functional Data into Groups by Using Projections
- Clustering with Bregman divergences.
- Crisp and fuzzy k-means clustering algorithms for multivariate functional data
- Defining probability density for a distribution of random functions
- Distance-based clustering of sparsely observed stochastic processes, with applications to online auctions
- Elements of Information Theory
- Estimating the dimension of a model
- Functional cluster analysis via orthonormalized Gaussian basis expansions and its application
- Functional Clustering and Identifying Substructures of Longitudinal Data
- Functional data clustering: a survey
- Functional Logistic Discrimination Via Regularized Basis Expansions
- High-dimensional data clustering
- scientific article; zbMATH DE number 469124 (Why is no real title available?)
- scientific article; zbMATH DE number 3252891 (Why is no real title available?)
- Information-maximization clustering based on squared-loss mutual information
- Maximum volume clustering: a new discriminative clustering approach
- Model-based clustering of time series in group-specific functional subspaces
- Nonparametric functional data analysis. Theory and practice.
- On Information and Sufficiency
- On the limited memory BFGS method for large scale optimization
- Robust clustering for functional data based on trimming and constraints
- Smooth LASSO estimator for the function-on-function linear regression model
- Sparse clustering of functional data
- The discriminative functional mixture model for a comparative analysis of bike sharing systems
- The naive Bayes classifier for functional data
- Unsupervised Curve Clustering using B‐Splines
- Wavelet‐Based Clustering for Mixed‐Effects Functional Models in High Dimension
Cited in
(2)
This page was built for publication: Functional data clustering via information maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141461)
