A simple approach to sparse clustering-Reference-Cited by-同舟云学术

A simple approach to sparse clustering

Published:2017-01 Issue: Volume:105 Page:217-228
ISSN:0167-9473
Container-title:Computational Statistics & Data Analysis
language:en
Short-container-title:Computational Statistics & Data Analysis

Author:

Arias-Castro Ery,Pu Xiao

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Statistics and Probability

Reference28 articles.

1. Fast algorithms for projected clustering;Aggarwal,1999

2. k-means++: The advantages of careful seeding;Arthur,2007

3. Azizyan, M., Singh, A., Wasserman, L., 2013. Minimax theory for high-dimensional Gaussian mixtures with sparse mean separation, in: Neural Information Processing Systems (NIPS).

4. Hill-climbing finds random planted bisections;Carson,2001

5. Using evidence of mixed populations to select variables for clustering very high-dimensional data;Chan;J. Amer. Statist. Assoc.,2010

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards a semi-supervised ensemble clustering framework with flexible weighting mechanism and constraints information;Engineering Applications of Artificial Intelligence;2024-10

2. Sparse clustering for customer segmentation with high-dimensional mixed-type data;The Annals of Applied Statistics;2024-09-01

3. FKML0: A Matlab Routine for Sparse Fuzzy Clustering;2024 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE);2024-06-30

4. The Effect of K - Means Clustering on Collaborative Filtering in Book Recommendation;2024 12th International Conference on Information and Education Technology (ICIET);2024-03-18

5. Sparse kernel k-means for high-dimensional data;Pattern Recognition;2023-12