Differentially Private Subspace Clustering
Subspace clustering is an unsupervised learning problem that aims at grouping data points into multiple “clusters” so that data points in a single cluster lie approximately on a low-dimensional linear subspace. It is originally motivated by 3D motion segmentation in computer vision, but has recently...
Saved in:
Main Authors: | WANG, Yining, WANG, Yu-Xiang, SINGH, Aarti |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3469 https://ink.library.smu.edu.sg/context/sis_research/article/4470/viewcontent/149___Differentially_Private_Subspace_Clustering__NIPS2015_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Noisy sparse subspace clustering
by: Wang, Y.-X., et al.
Published: (2014) -
Enhanced subspace clustering
by: Sim, Kelvin Sian Hui.
Published: (2012) -
Deep adversarial subspace clustering
by: ZHOU, Pan, et al.
Published: (2018) -
The use of clustering algorithms to prevent future office-related MSDs
by: Castro, Roselle Franchesca B.
Published: (2021) -
Who should be invited to my party: A size-constrained k-core problem in social networks
by: MA, Yu-Liang, et al.
Published: (2019)