English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we propose a robust projection twin support vector machine (RPTSVM), where a new truncated-norm distance measure is applied to the with-class scatter to boost the robustness of the classifier when encountering a large number of outliers. In order to further improve the robustness of the model, chance constraints are employed to specify the lower bound of the probability that the distance from the projected samples to the projection of the other class centre is at least one. RPTSVM considers a pair of non-convex non-smooth problems with chance constraints. To solve these difficult problems, a newly designed method based on the difference of convex functions (DC) programs approach is presented. Extensive experiments on artificial datasets and benchmark datasets demonstrate the robustness and feasibility of our proposed RPTSVM.

Robust projection twin support vector machine via DC programming