Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality

DOI10.1162/neco_a_01140zbMath1472.68170OpenAlexW2897621223WikidataQ57472008 ScholiaQ57472008MaRDI QIDQ5157277

Hong Zhu, Michael Kwok-Po Ng, Li-Zhi Liao

Publication date: 12 October 2021

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_01140

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A splitting method for orthogonality constrained problems
• Multiple instance classification: review, taxonomy and comparative study
• PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples
• A note on learning from multiple-instance examples
• Solving the multiple instance problem with axis-parallel rectangles.
• Principal component analysis.
• Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
• On sparse linear discriminant analysis algorithm for high-dimensional data classification
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• Variational Analysis
• Multiple Instance Learning
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function

This page was built for publication: Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality