For binary pattern recognition problem, the canonical support vector machine put forward by Vapnik didn't distinguish two classification errors appearing in classifying two sample sets. So a new method, asymmetrical support vector machine (A-SVM), is proposed. The optimal separating hyperplane was deviated from the optimal support hyperplane of some kind of sample set by parallel moving the optimal separating hyperplane, and then this kind of sample set could be recognized with higher accuracy. Simulation example shows that A-SVM is similar to SVM for the total recognizing performance of both learning and testing. However, A-SVM is better than SVM when separating the kind of sample set.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    New type of support vector machine by moving separating hyperplane


    Beteiligte:
    Hongsheng Lue, (Autor:in) / Jianmin He, (Autor:in) / Xiaoping Hu, (Autor:in)


    Erscheinungsdatum :

    2006-01-01


    Format / Umfang :

    2233075 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Local Tests for Consistency of Support Hyperplane Data

    Karl, W. C. / Kulkarni, S. R. / Verghese, G. C. et al. | British Library Online Contents | 1996


    Seasonal Autoregressive Integrated Moving Average and Support Vector Machine Models

    Zhang, Ning / Zhang, Yunlong / Lu, Haiting | Transportation Research Record | 2011


    HYPERPLANE SEARCH-BASED VEHICLE TEST

    HRYNIW JAMES | Europäisches Patentamt | 2024

    Freier Zugriff

    Efficient hyperplane tracking by intelligent region selection

    Grassl, C. / Zinsser, T. / Niemann, H. | IEEE | 2004


    Hinging hyperplane trees for hybrid modeling of alternators

    Schmidt, M. / Töpfer, S. | Tema Archiv | 2000