Convex clustering for binary data
From MaRDI portal
Publication:2303059
DOI10.1007/s11634-018-0350-1zbMath1459.62109OpenAlexW2901954102MaRDI QIDQ2303059
Publication date: 2 March 2020
Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11634-018-0350-1
Related Items (2)
Convex clustering method for compositional data modeling ⋮ A novel convex clustering method for high-dimensional data using semiproximal ADMM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Sparse logistic principal components analysis for binary data
- A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
- Multinomial logistic regression algorithm
- Proximal algorithms in statistics and machine learning
- Principal component analysis.
- Least angle regression. (With discussion)
- A unified view on clustering binary data
- Simultaneous supervised clustering and feature selection over a graph
- Fast Alternating Direction Optimization Methods
- A Framework for Feature Selection in Clustering
- Grouping Pursuit Through a Regularization Solution Surface
This page was built for publication: Convex clustering for binary data