Kernel-Free Nonlinear Support Vector Machines for Multiview Binary Classification Problems

نویسندگان

چکیده

Multiview learning (MVL) frequently uses support vector machine- (SVM-) based models, but it can be difficult to select appropriate kernel functions and corresponding parameters. Then, by introducing kernel-free tricks, two multiview classifiers are proposed, called C -multiview nonlinear machine ( id="M2"> -MKNSVM) its id="M3"> ν -version, namely, id="M4"> -MKNSVM. They try find a quadratic hypersurface under each view classify the sample points employ consistency constraint fuse from views. Both primal dual problems of id="M5"> -MKNSVM id="M6"> do not involve functions; thus, they allowed solved directly. In addition, relationship solutions between is discussed in classifier. For id="M7"> -version id="M8"> MKNSVM, meanings their parameters them analyzed detail. The experimental results artificial benchmark datasets show that our methods superior some traditional MVL like SVM-2K, PSVM-2V, MvTSVM, especially id="M9">

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visualization for Classification Problems, with Examples Using Support Vector Machines

In the simplest form support vector machines (SVM) define a separating hyperplane between classes generated from a subset of cases, called support vectors. The support vectors “mark” the boundary between two classes. The result is an interpretable classifier, where the importance of the variables to the classification, is identified by the coefficients of the variables defining the hyperplane. ...

متن کامل

Kernel/feature Selection for Support Vector Machines

Support Vector Machines are classifiers with architectures determined by kernel functions. In these proceedings we propose a method for selecting the best SVM kernel for a given classification problem. Our method searches for the best kernel by remapping the data via a kernel variant of the classical Gram-Schmidt orthonormalization procedure then using Fisher’s linear discriminant on the remapp...

متن کامل

An Improvement in Support Vector Machines Algorithm with Imperialism Competitive Algorithm for Text Documents Classification

Due to the exponential growth of electronic texts, their organization and management requires a tool to provide information and data in search of users in the shortest possible time. Thus, classification methods have become very important in recent years. In natural language processing and especially text processing, one of the most basic tasks is automatic text classification. Moreover, text ...

متن کامل

A QUADRATIC MARGIN-BASED MODEL FOR WEIGHTING FUZZY CLASSIFICATION RULES INSPIRED BY SUPPORT VECTOR MACHINES

Recently, tuning the weights of the rules in Fuzzy Rule-Base Classification Systems is researched in order to improve the accuracy of classification. In this paper, a margin-based optimization model, inspired by Support Vector Machine classifiers, is proposed to compute these fuzzy rule weights. This approach not only  considers both accuracy and generalization criteria in a single objective fu...

متن کامل

Solving Imbalanced Classification Problems with Support Vector Machines

The Support Vector Machine (SVM) is a powerful learning mechanism and promising results have been obtained in the field of medical diagnostics and textcategorization. However, successful applications to business oriented classification problems are still limited. Most real world data sets exhibit vast class imbalances and an accurate identification of the economical relevant minority class is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Intelligent Systems

سال: 2023

ISSN: ['1098-111X', '0884-8173']

DOI: https://doi.org/10.1155/2023/6259041