Support Vector Machines for Dyadic Data

DOI10.1162/NECO.2006.18.6.1472zbMATH Open1101.68762DBLPjournals/neco/HochreiterO06OpenAlexW2064884852WikidataQ31043807 ScholiaQ31043807MaRDI QIDQ5474571FDOQ5474571

Authors: Sepp Hochreiter, Klaus Obermayer 

Publication date: 26 June 2006

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

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

Recommendations

• An SMO Algorithm for the Potential Support Vector Machine
• scientific article; zbMATH DE number 2102035
• Regularization networks and support vector machines
• Statistical performance of support vector machines
• Support vector machines with applications

zbMATH Keywords

regularization schemes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Selection of relevant features and examples in machine learning
• Wrappers for feature subset selection
• 10.1162/153244303322753616
• The control of the false discovery rate in multiple testing under dependency.
• Bilinear Mixed-Effects Models for Dyadic Data
• Soft margins for AdaBoost
• Authoritative sources in a hyperlinked environment
• Structural risk minimization over data-dependent hierarchies

Cited In (5)

• A review on distance based time series classification
• Distance‐based mixture modeling for classification via hypothetical local mapping
• Incremental embedding within a dissimilarity-based framework
• Generative models for similarity-based classification
• An SMO Algorithm for the Potential Support Vector Machine

This page was built for publication: Support Vector Machines for Dyadic Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5474571)