A theoretical and empirical analysis of support vector machine methods for multiple-instance classification

DOI10.1007/s10994-013-5429-5zbMath1319.68173OpenAlexW2050243593MaRDI QIDQ2512897

Gary Doran, Soumya Ray

Publication date: 2 February 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5429-5

zbMATH Keywords

kernel methodssupport vector machinesmultiple-instance learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Multiple instance classification via quadratic programming ⋮ Theory and Algorithms for Shapelet-Based Multiple-Instance Learning ⋮ Instance-level accuracy versus bag-level accuracy in multi-instance learning ⋮ A \textit{fingerprint} of a heterogeneous data set

Uses Software

• UCI-ml
• CVXOPT
• NumPy
• Python
• MISVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multiple-instance learning of halfspaces
• Multiple instance classification via successive linear programming
• Multiple instance learning via margin maximization
• A note on learning from multiple-instance examples
• Solving the multiple instance problem with axis-parallel rectangles.
• Instance-level accuracy versus bag-level accuracy in multi-instance learning
• Lectures on Modern Convex Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A Hilbert Space Embedding for Distributions