Problem: unsupervised clustering
represent data in feature space; learn a non-linear mapping from data space X to feature space Z.
Problem formulation: cluster a set of n points into k clusters, each represented by a centroid uj.
PP: Unsupervised deep embedding for clustering analysis
原文：https://www.cnblogs.com/dulun/p/12324544.html