2008 · 77 citations · 17 references
Natural SciencesComputer ScienceMathematicsData MiningMachine LearningOptimizationConstrained OptimizationConvex AnalysisConvex OptimizationLinear ProgrammingNonlinear ProgrammingOptimization For Machine LearningConvex RelaxationsCutting PlanesLarge-scale Convex OptimizationMaximum Margin ClassificationMulticlass Classification
This paper presents a cutting plane algorithm for multiclass maximum margin clustering (MMC). The proposed algorithm constructs a nested sequence of successively tighter relaxations of the original MMC problem, and each optimization problem in this sequence could be efficiently solved using the constrained concave-convex procedure (CCCP). Experimental evaluations on several real world datasets show that our algorithm converges much faster than existing MMC methods with guaranteed accuracy, and can thus handle much larger datasets efficiently.
17
RCV1: A New Benchmark Collection for Text Categorization Research
David Lewis, Yiming Yang, Tony Rose et al. · Goldsmiths (University of London) · 2004 · 2.6K citations · Full text
Training linear SVMs in linear time
Thorsten Joachims · 2006 · 2K citations