Low-rank bilinear classification: efficient convex optimization and extensions
type: Item
instance of: scholarly article
title: Low-rank bilinear classification: efficient convex optimization and extensions
zbMATH Open document ID: 1328.68183
author: Takumi Kobayashi
published in: International Journal of Computer Vision
publication date: 2016-01-06T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T45
zbMATH DE Number: 6526817
zbMATH Keywords: bilinear classifier
zbMATH Keywords: low-rank matrix
zbMATH Keywords: convex optimization
zbMATH Keywords: multiple kernel learning
zbMATH Keywords: cross modal learning
describes a project that uses: LIBSVM
describes a project that uses: LIBLINEAR
describes a project that uses: SimpleMKL
describes a project that uses: PASCAL VOC
MaRDI profile type: Publication
full work available at URL: s11263-014-0709-5
OpenAlex ID: W2020956195
cites work: Q4783930
cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
cites work: Q4821526
cites work: Choosing multiple parameters for support vector machines
cites work: Q3096204
cites work: Foundations of bilevel programming
cites work: Pattern classification.
cites work: Q3093324
cites work: Q3096176
cites work: Learning the parts of objects by non-negative matrix factorization
cites work: Q3093181
cites work: Numerical Optimization
cites work: Advances in large-margin classifiers
cites work: Q4261789
DOI: 10.1007/S11263-014-0709-5
description: scientific article; zbMATH DE number 6526817