4.7 Article

The soft-margin Support Vector Machine with ordered weighted average

期刊

KNOWLEDGE-BASED SYSTEMS
卷 237, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.knosys.2021.107705

关键词

Data science; Classification; Support Vector Machine; OWA operators; Mixed integer quadratic programming

资金

  1. Spanish Ministry of Science and Innovation [PID2019-110886RB-I00]
  2. Agencia Estatal de Investigacion (AEI) [PID2020-114594GB-C21/C22]
  3. European Regional Development's funds (ERDF) [PID2020-114594GB-C21/C22]
  4. Regional Government of Andalusia [FEDER-UCA18-106895, FEDER-US1256951, P18-FR-1422]
  5. Subprograma Juan de la Cierva Formacion 2019 [FJC2019039023-I]
  6. PAIDI 2020 postdoctoral fellowship - European Social Fund
  7. Junta de Andalucia

向作者/读者索取更多资源

This paper introduces an exact method for a cost sensitive extension of the standard SVM, which outperforms classical models and previous heuristic solutions, especially when utilizing nonlinear kernel functions.
This paper deals with a cost sensitive extension of the standard Support Vector Machine (SVM) using an ordered weighted sum of the deviations of misclassified individuals with respect to their corresponding supporting hyperplanes. In contrast with previous heuristic approaches, an exact method that applies the ordered weighted average operator in the classical SVM model is proposed. Specifically, when weights are sorted in non-decreasing order, a quadratic continuous formulation is developed. For general weights, a mixed integer quadratic formulation is proposed. In addition, our results prove that nonlinear kernel functions can be also applied to these new models extending its applicability beyond the linear case. Extensive computational results reported in the paper show that the predictive performance provided by the proposed exact solution approaches are better than the ones provided by the classical models (linear and nonlinear kernel) and similar or better than the previous ones provided by the heuristic solution by Maldonado et al. (2018). (c) 2021 The Authors. Published by Elsevier B.V.This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by- nc- nd/4.0/).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Statistics & Probability

Robust optimal classification trees under noisy labels

Victor Blanco, Alberto Japon, Justo Puerto

Summary: This paper introduces a new methodology for constructing Optimal Classification Trees that takes into account noisy labels in the training sample. The approach combines margin based classifiers and outlier detection techniques, aiming to maximize separation margin between classes and detect label noise during tree construction. A Mixed Integer Non Linear Programming formulation is presented and tested on standard datasets, showing improved accuracy and AUC compared to existing benchmarks.

ADVANCES IN DATA ANALYSIS AND CLASSIFICATION (2022)

Article Management

A branch-and-price approach for the continuous multifacility monotone ordered median problem

Victor Blanco, Ricardo Gazquez, Diego Ponce, Justo Puerto

Summary: This paper addresses the Continuous Multifacility Monotone Ordered Median Problem and proposes a new branch-and-price procedure and three families of matheuristics. The study shows that the branch-and-price approach outperforms the compact formulation in medium-sized instances, while the matheuristics yield satisfactory results for larger instances.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Management

Dynamically second-preferred p-center problem

Yolanda Hinojosa, Alfredo Marin, Justo Puerto

Summary: This paper focuses on the Dynamically Second-preferred p-center Problem (DSpP), considering customers' preferences and subsets of acceptable service centers. It proposes three mixed-integer linear programming formulations and a heuristic algorithm to solve the NP-hard problem, aiming to minimize the distances and evaluate the usefulness of the formulations with extensive computational experiments. The research provides valuable insights for solving DSpP efficiently.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Computer Science, Artificial Intelligence

Using the l(1)-norm for Image-based tomographic reconstruction

Jose J. Calvino, Elena Fernandez, Miguel Lopez-Haro, Juan M. Munoz-Ocana, Antonio M. Rodriguez-Chia

Summary: This paper introduces an l(1)-norm model based on Total Variation Minimization for tomographic reconstruction. The reconstructions produced by this model are more accurate than classical reconstruction models based on the l(2)-norm. The model can be linearized and solved using linear programming, and the dimension of the formulation can be further reduced by exploiting complementary slackness conditions.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Article Computer Science, Interdisciplinary Applications

Facility location problems on graphs with non-convex neighborhoods

I. Espejo, R. Paez, J. Puerto, A. M. Rodriguez-Chia

Summary: This paper investigates variants of classical facility location problems on graphs with non-convex neighborhoods for customers and facilities. The p-median, p-center, and p-maximal covering versions of this problem are analyzed. The lengths of arcs depend on the locations of points in the neighborhoods, and different mixed-integer non-linear programming formulations are proposed assuming the neighborhoods are Mixed-Integer Second Order Cone representable. Solution procedures providing bounds and a preprocessing phase are developed to reduce variables and constraints. Extensive computational experiments are reported.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Computer Science, Interdisciplinary Applications

The profit-oriented hub line location problem with elastic demand

Brenda Cobena, Ivan Contreras, Luisa I. Martinez-Merino, Antonio M. Rodriguez-Chia

Summary: This paper presents an extension of the hub line location problem that takes into account demand elasticity. The proposed model aims to capture the impact of the hub network topology on demand and maximize revenue generated by each unit of demand. Nonlinear and linear programming formulations are presented to solve the problem, with computational results comparing the proposed formulations and demonstrating the advantages of the model. Additionally, a sensitivity analysis study is conducted using real data from Montreal, Canada, to showcase the added value of incorporating demand elasticity in the proposed model for public transportation planning.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Computer Science, Interdisciplinary Applications

A new formulation and branch-and-cut method for single-allocation hub location problems

Inmaculada Espejo, Alfredo Marin, Juan M. Munoz-Ocana, Antonio M. Rodriguez-Chia

Summary: This article introduces a new compact formulation for uncapacitated single-allocation hub location problems, which has fewer variables than the previous Integer Linear Programming formulations in the literature. This formulation can handle costs that are not based on distances and do not satisfy triangle inequality. The authors also develop different families of valid inequalities to strengthen the formulation, and design a branch-and-cut algorithm based on a relaxed version of the formulation. Extensive computational results demonstrate the efficiency of their methodology in solving large-scale instances in competitive times when compared to the most recent and efficient exact algorithms for single-allocation hub location problems.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Computer Science, Interdisciplinary Applications

A multiple-drone arc routing and mothership coordination problem

Lavinia Amorosi, Justo Puerto, Carlos Valverde

Summary: This paper addresses the optimization problems in coordinating a mothership vehicle and a fleet of drones. The goal is to minimize the mothership's overall travel time while satisfying requirements in terms of fractions of visits to target graphs. Exact formulations and a matheuristic algorithm are developed and compared on test instances, demonstrating the usefulness of the methodology in different scenarios.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Computer Science, Hardware & Architecture

Connected graph partitioning with aggregated and non-aggregated gap objective functions

Elena Fernandez, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari

Summary: This article addresses the problem of partitioning a graph into p connected components by optimizing balancing objective functions related to vertex weights. It introduces the notion of aggregated gap, which is the sum of the differences between vertex weights and the minimum weight of a vertex in a component. New connected p-partitioning problems based on aggregated gap are studied, and their NP-hardness results on general graphs are given. Mathematical programming formulations, adopting flow-based constraints for connectivity modeling, are proposed for these problems. Extensive computational tests on squared grids and randomly generated graphs are conducted to compare the performance of different formulations.

NETWORKS (2023)

Article Management

The biobjective minimum-cost perfect matching problem and Chinese postman problem

Miguel A. Pozo, Justo Puerto, Ignacio Roldan

Summary: This paper addresses the biobjective versions of the perfect matching problem (PMP) and the Chinese postman problem (CPP). It solves both problems using integer formulations or separating blossom inequalities, taking advantage of the PMP relationship with the CPP. The authors first find the set of supported nondominated solutions and use them to obtain the nonsupported ones. The supported nondominated solutions are obtained by solving scalarized integer formulations. To obtain the nonsupported solutions, lexicographic problems based on adding additional linear constraints to the original problems are solved.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2023)

Article Computer Science, Artificial Intelligence

A Mathematical Programming Approach to Sparse Canonical Correlation Analysis

Lavinia Amorosi, Tullia Padellini, Justo Puerto, Carlos Valverde

Summary: This article discusses recent developments in the interplay between Operational Research and Statistics and how it utilizes advances in Mixed-Integer Optimisation solvers to improve the quality of statistical analysis. The authors propose a new technique for encoding sparsity in Canonical Correlation Analysis and evaluate its performance on multiple datasets. The results highlight that the proposed approach outperforms other conventional methods in finding optimal solutions.

EXPERT SYSTEMS WITH APPLICATIONS (2024)

Article Computer Science, Artificial Intelligence

Confidence-based and sample-reweighted test-time adaptation

Hao Yang, Min Wang, Zhengfei Yu, Hang Zhang, Jinshen Jiang, Yun Zhou

Summary: In this paper, a novel method called CSTTA is proposed for test time adaptation (TTA), which utilizes confidence-based optimization and sample reweighting to better utilize sample information. Extensive experiments demonstrate the effectiveness of the proposed method.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

A novel method for generating a canonical basis for decision implications based on object-induced three-way operators

Jin Liu, Ju-Sheng Mi, Dong-Yun Niu

Summary: This article focuses on a novel method for generating a canonical basis for decision implications based on object-induced operators (OE operators). The logic of decision implication based on OE operators is described, and a method for obtaining the canonical basis for decision implications is given. The completeness, nonredundancy, and optimality of the canonical basis are proven. Additionally, a method for generating true premises based on OE operators is proposed.

KNOWLEDGE-BASED SYSTEMS (2024)

Review Computer Science, Artificial Intelligence

Efficient utilization of pre-trained models: A review of sentiment analysis via prompt learning

Kun Bu, Yuanchao Liu, Xiaolong Ju

Summary: This paper discusses the importance of sentiment analysis and pre-trained models in natural language processing, and explores the application of prompt learning. The research shows that prompt learning is more suitable for sentiment analysis tasks and can achieve good performance.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

M-EDEM: A MNN-based Empirical Decomposition Ensemble Method for improved time series forecasting

Xiangjun Cai, Dagang Li

Summary: This paper presents a new decomposition mechanism based on learned decomposition mapping. By using a neural network to learn the relationship between original time series and decomposed results, the repetitive computation overhead during rolling decomposition is relieved. Additionally, extended mapping and partial decomposition methods are proposed to alleviate boundary effects on prediction performance. Comparative studies demonstrate that the proposed method outperforms existing RDEMs in terms of operation speed and prediction accuracy.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Privacy-preserving trust management method based on blockchain for cross-domain industrial IoT

Xu Wu, Yang Liu, Jie Tian, Yuanpeng Li

Summary: This paper proposes a blockchain-based privacy-preserving trust management architecture, which adopts federated learning to train task-specific trust models and utilizes differential privacy to protect device privacy. In addition, a game theory-based incentive mechanism and a parallel consensus protocol are proposed to improve the accuracy of trust computing and the efficiency of consensus.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MV-ReID: 3D Multi-view Transformation Network for Occluded Person Re-Identification

Zaiyang Yu, Prayag Tiwari, Luyang Hou, Lusi Li, Weijun Li, Limin Jiang, Xin Ning

Summary: This study introduces a 3D view-based approach that effectively handles occlusions and leverages the geometric information of 3D objects. The proposed method achieves state-of-the-art results on occluded ReID tasks and exhibits competitive performance on holistic ReID tasks.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

City-scale continual neural semantic mapping with three-layer sampling and panoptic representation

Yongliang Shi, Runyi Yang, Zirui Wu, Pengfei Li, Caiyun Liu, Hao Zhao, Guyue Zhou

Summary: Neural implicit representations have gained attention due to their expressive, continuous, and compact properties. However, there is still a lack of research on city-scale continual implicit dense mapping based on sparse LiDAR input. In this study, a city-scale continual neural mapping system with a panoptic representation is developed, incorporating environment-level and instance-level modeling. A tailored three-layer sampling strategy and category-specific prior are proposed to address the challenges of representing geometric information in city-scale space and achieving high fidelity mapping of instances under incomplete observation.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MDSSN: An end-to-end deep network on triangle mesh parameterization

Ruihan Hu, Zhi-Ri Tang, Rui Yang, Zhongjie Wang

Summary: Mesh data is crucial for 3D computer vision applications worldwide, but traditional deep learning frameworks have struggled with handling meshes. This paper proposes MDSSN, a simple mesh computation framework that models triangle meshes and represents their shape using face-based and edge-based Riemannian graphs. The framework incorporates end-to-end operators inspired by traditional deep learning frameworks, and includes dedicated modules for addressing challenges in mesh classification and segmentation tasks. Experimental results demonstrate that MDSSN outperforms other state-of-the-art approaches.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Semi-supervised learning with missing values imputation

Buliao Huang, Yunhui Zhu, Muhammad Usman, Huanhuan Chen

Summary: This paper proposes a novel semi-supervised conditional normalizing flow (SSCFlow) algorithm that combines unsupervised imputation and supervised classification. By estimating the conditional distribution of incomplete instances, SSCFlow facilitates imputation and classification simultaneously, addressing the issue of separated tasks ignoring data distribution and label information in traditional methods.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Emotion-and-knowledge grounded response generation in an open-domain dialogue setting

Deeksha Varshney, Asif Ekbal, Erik Cambria

Summary: This paper focuses on the neural-based interactive dialogue system that aims to engage and retain humans in long-lasting conversations. It proposes a new neural generative model that combines step-wise co-attention, self-attention-based transformer network, and an emotion classifier to control emotion and knowledge transfer during response generation. The results from quantitative, qualitative, and human evaluation show that the proposed models can generate natural and coherent sentences, capturing essential facts with significant improvement over emotional content.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MvTS-library: An open library for deep multivariate time series forecasting

Junchen Ye, Weimiao Li, Zhixin Zhang, Tongyu Zhu, Leilei Sun, Bowen Du

Summary: Modeling multivariate time series has long been a topic of interest for scholars in various fields. This paper introduces MvTS, an open library based on Pytorch, which provides a unified framework for implementing and evaluating these models. Extensive experiments on public datasets demonstrate the effectiveness and universality of the models reproduced by MvTS.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

An adaptive hybrid mutated differential evolution feature selection method for low and high-dimensional medical datasets

Reham R. Mostafa, Ahmed M. Khedr, Zaher Al Aghbari, Imad Afyouni, Ibrahim Kamel, Naveed Ahmed

Summary: Feature selection is crucial in classification procedures, but it faces challenges in high-dimensional datasets. To overcome these challenges, this study proposes an Adaptive Hybrid-Mutated Differential Evolution method that incorporates the mechanics of the Spider Wasp Optimization algorithm and the concept of Enhanced Solution Quality. Experimental results demonstrate the effectiveness of the method in terms of accuracy and convergence speed, and it outperforms contemporary cutting-edge algorithms.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

TCM Model for improving track sequence classification in real scenarios with Multi-Feature Fusion and Transformer Block

Ti Xiang, Pin Lv, Liguo Sun, Yipu Yang, Jiuwu Hao

Summary: This paper introduces a Track Classification Model (TCM) based on marine radar, which can effectively recognize and classify shipping tracks. By using a feature extraction network with multi-feature fusion and a dataset production method to address missing labels, the classification accuracy is improved, resulting in successful engineering application in real scenarios.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Language model as an Annotator: Unsupervised context-aware quality phrase generation

Zhihao Zhang, Yuan Zuo, Chenghua Lin, Junjie Wu

Summary: This paper proposes a novel unsupervised context-aware quality phrase mining framework called LMPhrase, which is built upon large pre-trained language models. The framework mines quality phrases as silver labels using a parameter-free probing technique on the pre-trained language model BERT, and formalizes the phrase tagging task as a sequence generation problem by fine-tuning on the Sequence to-Sequence pre-trained language model BART. The results of extensive experiments show that LMPhrase consistently outperforms existing competitors in two different granularity phrase mining tasks.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Stochastic Gradient Descent for matrix completion: Hybrid parallelization on shared- and distributed-memory systems

Kemal Buyukkaya, M. Ozan Karsavuran, Cevdet Aykanat

Summary: The study aims to investigate the hybrid parallelization of the Stochastic Gradient Descent (SGD) algorithm for solving the matrix completion problem on a high-performance computing platform. A hybrid parallel decentralized SGD framework with asynchronous inter-process communication and a novel flexible partitioning scheme is proposed to achieve scalability up to hundreds of processors. Experimental results on real-world benchmark datasets show that the proposed algorithm achieves 6x higher throughput on sparse datasets compared to the state-of-the-art, while achieving comparable throughput on relatively dense datasets.

KNOWLEDGE-BASED SYSTEMS (2024)