4.7 Article

Multiobjective Support Vector Machines: Handling Class Imbalance With Pareto Optimality

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2018.2869298

关键词

Class imbalance; classification; multiobjective optimization; radial boundary intersection (RBI); support vector machines (SVMs)

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

Support vector machines (SVMs) seek to optimize three distinct objectives: maximization of margin, minimization of regularization from the positive class, and minimization of regularization from the negative class. The right choice of weightage for each of these objectives is critical to the quality of the classifier learned, especially in case of the class imbalanced data sets. Therefore, costly parameter tuning has to be undertaken to find a set of suitable relative weights. In this brief, we propose to train SVMs, on two-class as well as multiclass data sets, in a multiobjective optimization framework called radial boundary intersection to overcome this shortcoming. The experimental results suggest that the radial boundary intersection-based scheme is indeed effective in finding the best tradeoff among the objectives compared with parameter-tuning schemes.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

Article Computer Science, Artificial Intelligence

A black-box adversarial attack strategy with adjustable sparsity and generalizability for deep image classifiers

Arka Ghosh, Sankha Subhra Mullick, Shounak Datta, Swagatam Das, Asit Kr Das, Rammohan Mallipeddi

Summary: This study introduces the DEceit algorithm, which constructs effective universal pixel-restricted perturbations using only black-box feedback from the target network. Through empirical investigations, it is found that perturbing around 10% of the pixels in an image achieves a highly transferable Fooling Rate while maintaining visual quality. Furthermore, DEceit shows success in image-dependent attacks and outperforms several state-of-the-art methods.

PATTERN RECOGNITION (2022)

Article Computer Science, Artificial Intelligence

Selective Nearest Neighbors Clustering

Souhardya Sengupta, Swagatam Das

Summary: This paper proposes a simple data clustering technique that uses a graph created on nearest neighbors to identify clusters. The algorithm incorporates border detection and outlier detection techniques to construct the graph. The authors also introduce a novel outlier detection technique suitable for their implementation. Comparisons with state-of-the-art clustering techniques and experiments on various aspects of datasets are conducted.

PATTERN RECOGNITION LETTERS (2022)

Article Energy & Fuels

Benchmarking Optimization-Based Energy Disaggregation Algorithms

Oladayo S. Ajani, Abhishek Kumar, Rammohan Mallipeddi, Swagatam Das, Ponnuthurai Nagaratnam Suganthan

Summary: Energy disaggregation is an effective method to promote energy efficiency, but it faces challenges such as device similarity and measurement errors. In order to develop optimization algorithms for energy disaggregation, standard datasets and evaluation metrics are needed. This paper proposes a dataset with multiple instances and summarizes the performance indicators and baseline results of different optimization algorithms.

ENERGIES (2022)

Article Computer Science, Artificial Intelligence

Detecting Meaningful Clusters From High-Dimensional Data: A Strongly Consistent Sparse Center-Based Clustering Approach

Saptarshi Chakraborty, Swagatam Das

Summary: In this paper, a simple and efficient sparse clustering algorithm called LW-k-means is proposed for high-dimensional data. The algorithm incorporates feature weighting to enable feature selection and has a time complexity similar to traditional algorithms. The strong consistency of the LW-k-means procedure is also established. Experimental results on synthetic and real-life datasets demonstrate that LW-k-means performs competitively in terms of clustering accuracy and computational time compared to existing methods for center-based high-dimensional clustering.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2022)

Article Computer Science, Information Systems

Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis

Ivan Zelinka, Quoc Bao Diep, Vaclav Snasel, Swagatam Das, Giacomo Innocenti, Alberto Tesi, Fabio Schoen, Nikolay V. Kuznetsov

Summary: This paper discusses the alternative applications of pseudo-random processes and deterministic chaos in evolutionary algorithms, and proposes the use of a specific class of deterministic processes based on deterministic chaos to improve the performance of evolutionary algorithms, through comparing the performance of evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators. New research questions are also proposed based on the findings.

INFORMATION SCIENCES (2022)

Article Computer Science, Information Systems

On efficient model selection for sparse hard and fuzzy center-based clustering algorithms

Avisek Gupta, Swagatam Das

Summary: This paper proposes an improved approach for model selection in sparse clustering by using the BIC expressions derived from center-based clustering methods. The derived BIC expressions significantly reduce computation costs and enable the comparison and selection of suitable sparse clusterings.

INFORMATION SCIENCES (2022)

Article Statistics & Probability

On strong consistency of kernel k-means: A Rademacher complexity approach

Anish Chakrabarty, Swagatam Das

Summary: By treating the underlying problem as a risk minimization task, this study provides uniform concentration bounds on the kernel k-means clustering objective based on Rademacher complexity, leading to state-of-the-art convergence rates on excess risk and strong consistency of cluster centers.

STATISTICS & PROBABILITY LETTERS (2022)

Article Automation & Control Systems

GEN: Generative Equivariant Networks for Diverse Image-to-Image Translation

Pourya Shamsolmoali, Masoumeh Zareapoor, Swagatam Das, Salvador Garcia, Eric Granger, Jie Yang

Summary: Image-to-image translation is crucial in generative adversarial networks. Convolutional neural networks have limitations in capturing spatial relationships, making them unsuitable for image translation tasks. Capsule networks are proposed as a remedy, capturing hierarchical spatial relationships. In this paper, a new framework for capsule networks is presented, which can be applied to generator-discriminator architectures without computational overhead. A Gromov-Wasserstein distance is used as a loss function to guide the learned distribution. The proposed method, called generative equivariant network, is evaluated on I2I translation and image generation tasks and shows a principled connection between generative and capsule models.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Review Computer Science, Artificial Intelligence

An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges

Kanchan Rajwar, Kusum Deep, Swagatam Das

Summary: As industrialization progresses, solving optimization problems becomes more challenging. More than 500 new metaheuristic algorithms (MAs) have been developed, with over 350 of them emerging in the last decade. This study tracks approximately 540 MAs and provides statistical information. The proliferation of MAs has led to the issue of significant similarities between algorithms with different names. The study categorizes MAs based on the number of control parameters, which is a new taxonomy. Real-world applications of MAs are demonstrated and limitations and open challenges are identified.

ARTIFICIAL INTELLIGENCE REVIEW (2023)

Article Automation & Control Systems

On Consistent Entropy-Regularized k-Means Clustering With Feature Weight Learning: Algorithm and Statistical Analyses

Saptarshi Chakraborty, Debolina Paul, Swagatam Das

Summary: This article introduces a center-based clustering method that incorporates an entropy incentive term to learn feature importance efficiently. A scalable block-coordinate descent algorithm with closed-form updates is used to minimize the objective function. The merits of this method are showcased through detailed experimental analysis.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Can Graph Neural Networks Go Deeper Without Over-Smoothing? Yes, With a Randomized Path Exploration!

Kushal Bose, Swagatam Das

Summary: Graph Neural Networks (GNNs) are powerful for learning on graph-structured data, but they often suffer from over-smoothing, where node features become indistinguishable. This paper identifies the recursive and higher-to-lower order aggregation as the primary causes of over-smoothing and proposes a novel non-recursive aggregation strategy using randomized path exploration. Extensive comparative studies on benchmark datasets demonstrate the efficacy of the proposed method in semi-supervised and fully-supervised learning tasks.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

Robust Principal Component Analysis: A Median of Means Approach

Debolina Paul, Saptarshi Chakraborty, Swagatam Das

Summary: Principal component analysis (PCA) is widely used for data visualization, denoising, and dimensionality reduction, but it is sensitive to outliers and may fail to detect low-dimensional structures. This article proposes a PCA method called MoMPCA based on the Median of Means (MoM) principle, which is computationally efficient and achieves optimal convergence rates. The method is robust to outliers and does not make assumptions about them. The efficacy of the proposed method is demonstrated through simulations and real data applications.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Review Computer Science, Information Systems

Digital Restoration of Cultural Heritage With Data-Driven Computing: A Survey

Arkaprabha Basu, Sandip Paul, Sreeya Ghosh, Swagatam Das, Bhabatosh Chanda, Chakravarthy Bhagvati, Vaclav Snasel

Summary: Digitized methodologies have revolutionized various fields, including the restoration of buildings with historical significance. This interdisciplinary field attracts computer scientists who use computerized tools to reconstruct the values of these structures. The wear of time has endangered significant historical values, but this survey explores the use of 3D reconstruction, image inpainting, IoT-based methods, genetic algorithms, and image processing to restore cultural heritage. Machine Learning, Deep Learning, and Computer Vision-based methods are discussed, offering insights into faster, cheaper, and more beneficial techniques for image reconstruction in the near future.

IEEE ACCESS (2023)

Article Computer Science, Artificial Intelligence

Implicit Annealing in Kernel Spaces: A Strongly Consistent Clustering Approach

Debolina Paul, Saptarshi Chakraborty, Swagatam Das, Jason Xu

Summary: Kernel k-means clustering is a powerful tool for unsupervised learning of non-linearly separable data. In this paper, we propose a novel algorithm called Kernel Power k-Means, which leverages a general family of means to combat sub-optimal local solutions in the kernel and multi-kernel settings. Our algorithm uses majorization-minimization to solve the non-convex problem and implicitly performs annealing in kernel feature space. We rigorously analyze its convergence properties and demonstrate its efficacy through various experiments.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2023)

Article Computer Science, Information Systems

Two-Phase Evolutionary Convolutional Neural Network Architecture Search for Medical Image Classification

Arjun Ghosh, Nanda Dulal Jana, Swagatam Das, Rammohan Mallipeddi

Summary: This study proposes a two-phase evolutionary framework, TPEvo-CNN, for automatically designing CNN models for medical image classification. The framework utilizes differential evolution to determine the number of layers of the CNN architecture and genetic algorithm to fine-tune the hyperparameters. Experimental results demonstrate the superiority of the proposed framework in medical image classification tasks compared to existing CNN models.

IEEE ACCESS (2023)

暂无数据