Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This paper introduces AW-LSSVM, an adaptive weighted Least Squares Support Vector Machine designed to enhance multi-view classification by enforcing global collaboration across diverse data representations. The method iteratively adjusts sample weights based on misclassification errors from other views, offering two strategies that prioritize dissimilar view interactions for improved consensus learning. Experimental results indicate superior performance over existing kernel-based methods on benchmark datasets, advancing the state of machine learning in handling complex multi-source information.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Adaptive Weighted LSSVM for Multi-View Classification

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2512.02653v2 Announce Type: replace Abstract: Multi-view learning integrates diverse representations of the same instances and can improve performance when interactions across views are effectively exploited. Most existing kernel-based multi-view learning methods either rely on fusion techniques without explicitly enforcing a consensus or complementary collaboration across views, or use co-regularization-based loss functions that impose only pairwise interactions, thereby limiting global collaboration. We propose AW-LSSVM, an adaptive weighted LS-SVM that explicitly enforces complementary learning across all views through an iterative global coupling mechanism. At each iteration, each view not only learns from its own data but is also guided to compensate for samples misclassified by other views in previous iterations by assigning adaptive sample weights. We introduce two strategies for computing these weights: (1) based on averaging misclassification errors across other views and, (2) based on a dissimilarity-aware error aggregation that puts more emphasis on errors from more dissimilar views. Experiments demonstrate that AW-LSSVM outperforms existing multi-view methods on most benchmark datasets.

Abstract:Multi-view learning integrates diverse representations of the same instances and can improve performance when interactions across views are effectively exploited. Most existing kernel-based multi-view learning methods either rely on fusion techniques without explicitly enforcing a consensus or complementary collaboration across views, or use co-regularization-based loss functions that impose only pairwise interactions, thereby limiting global collaboration. We propose AW-LSSVM, an adaptive weighted LS-SVM that explicitly enforces complementary learning across all views through an iterative global coupling mechanism. At each iteration, each view not only learns from its own data but is also guided to compensate for samples misclassified by other views in previous iterations by assigning adaptive sample weights. We introduce two strategies for computing these weights: (1) based on averaging misclassification errors across other views and, (2) based on a dissimilarity-aware error aggregation that puts more emphasis on errors from more dissimilar views. Experiments demonstrate that AW-LSSVM outperforms existing multi-view methods on most benchmark datasets.

Machine Learning (cs.LG)

arXiv:2512.02653 [cs.LG]

(or arXiv:2512.02653v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2512.02653 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 247 cuvinte

Subiecte conexe