Article
Computer Science, Artificial Intelligence
Shuyin Xia, Cheng Wang, Guoyin Wang, Xinbo Gao, Weiping Ding, Jianhang Yu, Yujia Zhai, Zizhong Chen
Summary: This article introduces a granular-ball rough set (GBRS) model based on granular-ball computing, which can process continuous data and use equivalence classes for knowledge representation. Experimental results demonstrate that GBRS outperforms traditional rough set models in terms of learning accuracy and feature selection.
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
(2023)
Article
Computer Science, Information Systems
Jindong Feng, Zengtai Gong
Summary: In this study, a hybrid feature selection model combining neighborhood rough set with an improved particle swarm optimization is proposed. Experimental results demonstrate the model's stronger classification ability and its ability to remove more redundant features in most datasets.
Article
Computer Science, Artificial Intelligence
Keyu Liu, Tianrui Li, Xibei Yang, Xin Yang, Dun Liu
Summary: This paper introduces a novel ensemble feature selection method, which selects features with local significance through cross-class sample granulation and ensemble feature selection strategies.
APPLIED SOFT COMPUTING
(2022)
Article
Computer Science, Artificial Intelligence
Shuyin Xia, Xinyu Bai, Guoyin Wang, Yunlong Cheng, Deyu Meng, Xinbo Gao, Yujia Zhai, Elisabeth Giem
Summary: This paper presents a strong data-mining method based on rough set, which achieves feature selection, classification, and knowledge representation simultaneously. It addresses the efficiency issue by discovering the stability of local redundancy and proposes a theorem to prove it. Furthermore, it solves the accuracy issue by introducing relative importance as a robust measurement for attribute selection. Experimental results demonstrate its superiority over seven state-of-the-art feature-selection methods.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
(2023)
Article
Computer Science, Artificial Intelligence
Ramesh Kumar Huda, Haider Banka
Summary: Feature selection is the process of selecting criterion functions and search strategies to find the best feature subset from a large number of subsets. Algorithms based on particle swarm optimization and fuzzy rough fitness function can effectively select optimal feature subsets from datasets with numerous features.
Review
Computer Science, Information Systems
Nancy Kumari, D. P. Acharjya
Summary: Digitization is important in improving people's physical health, and healthcare organizations are focusing on precise disease diagnosis and patient care to enhance living standards. However, the vast amount of data generated through digitization contains uncertainties and impreciseness, requiring the application of computational intelligence techniques for analysis and processing.
MULTIMEDIA TOOLS AND APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Chuan Luo, Sizhao Wang, Tianrui Li, Hongmei Chen, Jiancheng Lv, Zhang Yi
Summary: This article proposes a novel global search method for numerical feature selection, RH-BPSO, based on the hybridization of the rough hypercuboid approach and binary particle swarm optimization (BPSO) algorithm. Parallelization approaches for large-scale datasets are also presented by decomposing and recombining hypercuboid equivalence partition matrix. The experimental results indicate that RH-BPSO outperforms other feature selection algorithms in terms of classification accuracy, the cardinality of the selected feature subset, and execution efficiency. Moreover, the distributed meta-heuristic optimized rough hypercuboid feature selection algorithm, DiRH-BPSO, is significantly faster than its sequential counterpart and can handle large-scale feature selection tasks on distributed-memory multicore clusters.
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
(2023)
Article
Computer Science, Information Systems
Zhihong Wang, Hongmei Chen, Xiaoling Yang, Jihong Wan, Tianrui Li, Chuan Luo
Summary: Dimensionality reduction is an important step in many learning methods to achieve optimal performance using discriminative features. This study proposes a fuzzy rough dimensionality reduction method that combines feature selection and feature extraction, and compares its performance with other algorithms, showing higher classification performance.
INFORMATION SCIENCES
(2023)
Article
Computer Science, Artificial Intelligence
Shuangjie Li, Kaixiang Zhang, Yali Li, Shuqin Wang, Shaoqiang Zhang
Summary: Feature selection is crucial in many fields, especially in machine learning. The proposed method OFS-Gapknn effectively addresses the challenges of online streaming features by defining a new neighborhood rough set relation and analyzing relevance and redundancy features. Experimental results demonstrate the dominance and significance of this method.
APPLIED SOFT COMPUTING
(2021)
Article
Computer Science, Information Systems
Jihong Wan, Hongmei Chen, Tianrui Li, Xiaoling Yang, Binbin Sang
Summary: Feature selection is a crucial data preprocessing approach in data mining, and the interaction between features and their dynamic changes should be taken into consideration to prevent the loss of useful information.
INFORMATION SCIENCES
(2021)
Article
Computer Science, Information Systems
Xin Yang, Miaomiao Li, Hamido Fujita, Dun Liu, Tianrui Li
Summary: In this paper, a method for improving the performance of attribute reduction in a dynamic data environment is proposed. By combining incremental technology and accelerated reduction strategy, the method utilizes stable attribute groups and matrix-based incremental mechanisms for reduction search and dynamic attribute reduction. Experimental results demonstrate the effectiveness of the proposed method in terms of stability, computational cost, and classification accuracy.
INFORMATION SCIENCES
(2022)
Article
Computer Science, Artificial Intelligence
Shuyin Xia, Shulin Wu, Xinxing Chen, Guoyin Wang, Xinbo Gao, Qinghua Zhang, Elisabeth Giem, Zizhong Chen
Summary: Feature selection is crucial in data mining and pattern recognition. We propose a novel neighborhood rough set model that does not rely on distance measures, resulting in improved accuracy and efficiency compared to traditional NRS algorithms. Experimental results demonstrate that our method outperforms existing NRS algorithms in terms of both accuracy and efficiency.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
(2023)
Article
Computer Science, Information Systems
Zhouming Ma, Jusheng Mi, Yiting Lin, Jinjin Li
Summary: Variable precision rough set (VPRS) has been widely studied as an essential way of knowledge representation and acquisition in uncertainty theory. This paper investigates the corresponding CVPRS model based on a covering-based rough set model, and systematically studies its algebraic structures and properties. An attribute reduction approach is proposed for a covering-based decision information system using the CVPRS model, and the performances of different boundary operators and related indices in these reduction methods are compared. Necessity rules and possibility rules extraction methods corresponding to decision classes are established, and their validity and security are theoretically verified.
INFORMATION SCIENCES
(2022)
Article
Mathematical & Computational Biology
Ying Shi, Hui Qi, Xiaofang Mu, Mingxing Hou
Summary: The traditional fuzzy rough set lacks adjustable ability in attribute reduction, leading to the proposal of a novel adjustable model. By discovering the inner relationship between parameters and reduction results, a nested mechanism is adopted to accelerate the search process. Experiments show that this heuristic algorithm outperforms traditional approaches in terms of computational efficiency and stability.
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE
(2021)
Article
Water Resources
Chaode Yan, Ziwei Li, Muhammad Waseem Boota, Muhammad Zohaib, Xiao Liu, Chunlong Shi, Jikun Xu
Summary: This study focuses on the discrimination of river patterns in the Yellow River using Rough Set theory. A hierarchical structure integrating the boundary and the interior was proposed to describe the morphological feature of river patterns. The main feature factors were selected using Rough Set theory, and river pattern discriminant rules were generated based on the reduced feature subsets. The results demonstrate good performance in expressing the morphological features of different river patterns.
JOURNAL OF HYDROLOGY-REGIONAL STUDIES
(2023)
Article
Computer Science, Information Systems
Xia Liang, Jie Guo, Peide Liu
Summary: This paper investigates a novel consensus model based on social networks to manage manipulative and overconfident behaviors in large-scale group decision-making. By proposing a novel clustering model and improved methods, the consensus reaching is effectively facilitated. The feedback mechanism and management approach are employed to handle decision makers' behaviors. Simulation experiments and comparative analysis demonstrate the effectiveness of the model.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Xiang Li, Haiwang Guo, Xinyang Deng, Wen Jiang
Summary: This paper proposes a method based on class gradient networks for generating high-quality adversarial samples. By introducing a high-level class gradient matrix and combining classification loss and perturbation loss, the method demonstrates superiority in the transferability of adversarial samples on targeted attacks.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Lingyun Lu, Bang Wang, Zizhuo Zhang, Shenghao Liu
Summary: Many recommendation algorithms only rely on implicit feedbacks due to privacy concerns. However, the encoding of interaction types is often ignored. This paper proposes a relation-aware neural model that classifies implicit feedbacks by encoding edges, thereby enhancing recommendation performance.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Jaehong Yu, Hyungrok Do
Summary: This study discusses unsupervised anomaly detection using one-class classification, which determines whether a new instance belongs to the target class by constructing a decision boundary. The proposed method uses a proximity-based density description and a regularized reconstruction algorithm to overcome the limitations of existing one-class classification methods. Experimental results demonstrate the superior performance of the proposed algorithm.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Hui Tu, Shifei Ding, Xiao Xu, Haiwei Hou, Chao Li, Ling Ding
Summary: Border-Peeling algorithm is a density-based clustering algorithm, but its complexity and issues on unbalanced datasets restrict its application. This paper proposes a non-iterative border-peeling clustering algorithm, which improves the clustering performance by distinguishing and associating core points and border points.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Long Tang, Pan Zhao, Zhigeng Pan, Xingxing Duan, Panos M. Pardalos
Summary: In this work, a two-stage denoising framework (TSDF) is proposed for zero-shot learning (ZSL) to address the issue of noisy labels. The framework includes a tailored loss function to remove suspected noisy-label instances and a ramp-style loss function to reduce the negative impact of remaining noisy labels. In addition, a dynamic screening strategy (DSS) is developed to efficiently handle the nonconvexity of the ramp-style loss.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Raghunathan Krishankumar, Sundararajan Dhruva, Kattur S. Ravichandran, Samarjit Kar
Summary: Health 4.0 is gaining global attention for better healthcare through digital technologies. This study proposes a new decision-making framework for selecting viable blockchain service providers in the Internet of Medical Things (IoMT). The framework addresses the limitations in previous studies and demonstrates its applicability in the Indian healthcare sector. The results show the top ranking BSPs, the importance of various criteria, and the effectiveness of the developed model.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Tao Tan, Hong Xie, Liang Feng
Summary: This paper proposes a heterogeneous update idea and designs HetUp Q-learning algorithm to enlarge the normalized gap by overestimating the Q-value corresponding to the optimal action and underestimating the Q-value corresponding to the other actions. To address the limitation, a softmax strategy is applied to estimate the optimal action, resulting in HetUpSoft Q-learning and HetUpSoft DQN. Extensive experimental results show significant improvements over SOTA baselines.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Chao Yang, Xianzhi Wang, Lina Yao, Guodong Long, Guandong Xu
Summary: This paper proposes a dynamic transformer-based architecture called Dyformer for multivariate time series classification. Dyformer captures multi-scale features through hierarchical pooling and adaptive learning strategies, and improves model performance by introducing feature-map-wise attention mechanisms and a joint loss function.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Xiguang Li, Baolu Feng, Yunhe Sun, Ammar Hawbani, Saeed Hammod Alsamhi, Liang Zhao
Summary: This paper proposes an enhanced scatter search strategy, using opposition-based learning, to solve the problem of automated test case generation based on path coverage (ATCG-PC). The proposed ESSENT algorithm selects the path with the lowest path entropy among the uncovered paths as the target path and generates new test cases to cover the target path by modifying the dimensions of existing test cases. Experimental results show that the ESSENT algorithm outperforms other state-of-the-art algorithms, achieving maximum path coverage with fewer test cases.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Shirin Dabbaghi Varnosfaderani, Piotr Kasprzak, Aytaj Badirova, Ralph Krimmel, Christof Pohl, Ramin Yahyapour
Summary: Linking digital accounts belonging to the same user is crucial for security, user satisfaction, and next-generation service development. However, research on account linkage is mainly focused on social networks, and there is a lack of studies in other domains. To address this, we propose SmartSSO, a framework that automates the account linkage process by analyzing user routines and behavior during login processes. Our experiments on a large dataset show that SmartSSO achieves over 98% accuracy in hit-precision.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Renchao Wu, Jianjun He, Xin Li, Zuguo Chen
Summary: This paper proposes a memetic algorithm with fuzzy-based population control (MA-FPC) to solve the joint order batching and picker routing problem (JOBPRP). The algorithm incorporates batch exchange crossover and a two-level local improvement procedure. Experimental results show that MA-FPC outperforms existing algorithms in terms of solution quality.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Guoxiang Zhong, Fagui Liu, Jun Jiang, Bin Wang, C. L. Philip Chen
Summary: In this study, we propose the AMFormer framework to address the problem of mixed normal and anomaly samples in deep unsupervised time-series anomaly detection. By refining the one-class representation and introducing the masked operation mechanism and cost sensitive learning theory, our approach significantly improves anomaly detection performance.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Jin Zhou, Kang Zhou, Gexiang Zhang, Ferrante Neri, Wangyang Shen, Weiping Jin
Summary: In this paper, the authors focus on the issue of multi-objective optimisation problems with redundant variables and indefinite objective functions (MOPRVIF) in practical problem-solving. They propose a dual data-driven method for solving this problem, which consists of eliminating redundant variables, constructing objective functions, selecting evolution operators, and using a multi-objective evolutionary algorithm. The experiments conducted on two different problem domains demonstrate the effectiveness, practicality, and scalability of the proposed method.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Georgios Charizanos, Haydar Demirhan, Duygu Icen
Summary: This article proposes a new fuzzy logistic regression framework that addresses the problems of separation and imbalance while maintaining the interpretability of classical logistic regression. By fuzzifying binary variables and classifying subjects based on a fuzzy threshold, the framework demonstrates superior performance on imbalanced datasets.
INFORMATION SCIENCES
(2024)