An efficient algorithm for maximal margin clustering

DOI10.1007/s10898-011-9691-4zbMath1230.90133OpenAlexW2105120842MaRDI QIDQ656840

Jiming Peng, Linli Xu, Dale Schuurmans, Lopamudra Mukherjee, Vikas Vikram 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

clusteringSDPunsupervisedmaximum margin

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Convex decomposition based cluster labeling method for support vector clustering ⋮ Ensemble clustering using semidefinite programming with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global optimization RLT-based approach for solving the fuzzy clustering problem
• \(k\)-plane clustering
• A global optimization RLT-based approach for solving the hard clustering problem
• Extensions of Lipschitz mappings into a Hilbert space
• Semidefinite Programming
• Structural, Syntactic, and Statistical Pattern Recognition
• An optimization-based approach for data classification