Maximum volume clustering: a new discriminative clustering approach

MaRDI QIDQ2933909zbMATH OpenFDO

Authors Gang Niu, Bo Dai, Lin Shang, Masashi Sugiyama

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v14/niu13a.html

zbMATH Keywords

sequential quadratic programmingsemi-definite programmingdiscriminative clusteringclustering error boundfinite sample stabilitylarge volume principle

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Applications of mathematical programming (90C90)

Recommendations

• Large margin vs. large volume in transductive learning
• scientific article; zbMATH DE number 1810276
• scientific article; zbMATH DE number 1931853
• Robust discriminative clustering with sparse regularizers
• Discriminative clustering via extreme learning machine

Cited in

(5)

• Large margin vs. large volume in transductive learning
• Functional data clustering via information maximization
• Robust discriminative clustering with sparse regularizers
• Information-maximization clustering based on squared-loss mutual information
• Discriminative clustering via extreme learning machine

This page was built for publication: Maximum volume clustering: a new discriminative clustering approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933909)