An efficient algorithm for maximal margin clustering

DOI10.1007/S10898-011-9691-4zbMATH Open1230.90133OpenAlexW2105120842MaRDI QIDQ656840FDOQ656840

Authors Jiming Peng, Lopamudra Mukherjee, D. Schuurmans, Linli Xu, V. V. Singh 

Publication date 13 January 2012

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-011-9691-4

zbMATH Keywords

clusteringunsupervisedSDPmaximum margin

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• An Efficient Clustering Algorithm
• An efficient clustering scheme using support vector methods
• Maximum margin model for subspace clustering
• An efficient enhanced \(k\)-means clustering algorithm
• scientific article; zbMATH DE number 2113999
• A Max-Min clustering method for \(k\)-means algorithm of data clustering

Cites Work

• scientific article; zbMATH DE number 5957371 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
• A global optimization RLT-based approach for solving the fuzzy clustering problem
• A global optimization RLT-based approach for solving the hard clustering problem
• An optimization-based approach for data classification
• Extensions of Lipschitz mappings into a Hilbert space
• Semidefinite Programming
• Structural, Syntactic, and Statistical Pattern Recognition
• \(k\)-plane clustering

Cited In (3)

• Convex decomposition based cluster labeling method for support vector clustering
• Multiclass maximum margin clustering via immune evolutionary algorithm for automatic diagnosis of electrocardiogram arrhythmias
• Ensemble clustering using semidefinite programming with applications

This page was built for publication: An efficient algorithm for maximal margin clustering

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