{"title":"Robust Attribute Reduction Exploring Class-Separability and Attribute-Correlation for Ordered Decision Systems","authors":"Binbin Sang;Lei Yang;Hongmei Chen;Tianrui Li;Weihua Xu","doi":"10.1109/TSMC.2025.3547972","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547972","url":null,"abstract":"Robust knowledge acquisition approaches are one of the research hotspots in data mining. The fuzzy dominance rough sets (FDRS) model is an important knowledge acquisition tool for ordinal classification tasks. However, it has been proved in practice that this model usually performs poorly fault tolerance, and only one noisy sample can cause huge interference in acquiring knowledge. Attribute reduction is one of the nontrivial applications of the FDRS. At present, most attribute reduction methods for ordinal classification tasks mainly focus on the dependence of decision to attributes, while ignoring the information provided by the separability of classes and the correlation of attributes for ordinal classification. In view of these two issues, this article first proposes a robust FDRS model with filterable noise samples. Then, the class-separability and attribute-correlation are explored in robust fuzzy dominance rough approximation space, and corresponding attribute evaluation index is designed. Finally, an attribute reduction algorithm is designed to select the attribute subset with the highest classification performance. The experimental results show that the proposed algorithm has better robustness and classification performance.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3941-3953"},"PeriodicalIF":8.6,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extended Zero-Gradient-Sum Approach for Constrained Distributed Optimization With Free Initialization","authors":"Xinli Shi;Xinghuo Yu;Guanghui Wen;Xiangping Xu","doi":"10.1109/TSMC.2025.3547335","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547335","url":null,"abstract":"This article proposes an extended zero-gradient-sum (EZGS) approach for solving constrained distributed optimization with free initialization and desired convergence properties. A Newton-based continuous-time algorithm is first designed for general constrained optimization, which is adapted to handle inequality constraints by using log-barrier penalty functions. Then, a general class of EZGS dynamics is developed to address equation-constrained distributed optimization, where an auxiliary dynamics is introduced to ensure the final ZGS property from any initialization. It is demonstrated that for typical consensus protocols and auxiliary dynamics, the proposed EZGS dynamics can achieve the performance with exponential/finite/fixed/prescribed-time (PT) convergence. Particularly, the nonlinear consensus protocols for finite-time EZGS algorithms allow for heterogeneous power coefficients. Significantly, the proposed PT EZGS dynamics is continuous, uniformly bounded, and capable of reaching the optimal solution in a single stage. Furthermore, the barrier method is employed to handle the inequality constraints effectively. Finally, the efficiency and performance of the proposed algorithms are validated through numerical examples, highlighting their superiority over existing methods. In particular, by selecting appropriate protocols, the proposed EZGS dynamics can achieve desired convergence performance.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3824-3834"},"PeriodicalIF":8.6,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal Linear Stealthy Attacks on Remote State Estimation: A Colored Noise-Based Approach","authors":"Pengyu Li;Dan Ye","doi":"10.1109/TSMC.2025.3548601","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548601","url":null,"abstract":"This article focuses on the design of optimal linear stealthy (OLS) attacks with colored noises for linear cyber-physical systems (CPSs). Unlike existing linear attacks that neglect the autocorrelation of attack signals, OLS attacks with colored noises are more destructive while eliminating their impact on the residuals. By leveraging eigendecomposition and matrix splitting methods, explicit solutions for optimal attacks are derived by solving two distinct optimization problems. To illustrate the superiority of such attack behaviors, we further investigate OLS attacks with colored noises and historical innovations, where the leverage of historical data is maximized to enhance attack performances. Finally, we provide an illustration of the effectiveness of these attacks through an example of an uncrewed aerial vehicle (UAV).","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4042-4051"},"PeriodicalIF":8.6,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144090802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Biomechanics-Based Collaborative Manipulation Method for an Ultrasound-Guided Puncture Robot","authors":"Zheng Liu;Shuang Wang;Qianlin Dai;Zhenggang Cao;Li Lin;Le Xie","doi":"10.1109/TSMC.2025.3547574","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547574","url":null,"abstract":"Percutaneous puncture surgery is commonly used for effective diagnosis and treatment. However, the popular manual manipulation brings in positional unsteadiness which increases the suffering of patients. In this study, a collaborative method is proposed by taking into the surgeon’s skills and the robotic stable operation. In this scheme, a modified compliance controller with a biomechanics-based activation condition is designed. This controller excludes positional undulations resulting from force disturbances. In addition, a breakthrough detector and regulator based on the human force reaction process are advised to repress the positional overshooting deriving from force jump at the moment of tissue breakthrough. This method enhances the manipulating smoothness and suppresses puncture needle overshooting. The overshooting is compensated accordingly by the proposed regulator and surgical risk is lowered. A collaborative puncture robot was constructed. Then, model and animal experiments on this robot verified the effectiveness and feasibility of the proposed method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4029-4041"},"PeriodicalIF":8.6,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144090751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Adaptive Federated Fuzzy C-Means Clustering With Nonindependently and Identically Distributed Data","authors":"Longmei Li;Wei Lu;Witold Pedrycz","doi":"10.1109/TSMC.2025.3547350","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547350","url":null,"abstract":"Federated Fuzzy C-Means (FCM) has received considerable attention due to the increasing need for privacy-conscious data analysis across diverse domains and sources in many real-world applications. Recent developments in federated FCM, however, are still in their infancy and largely unexplored. These methods struggle to handle nonindependent and identically distributed (non-iid) data. Moreover, critical hyperparameters, such as the number of iterations for local updates, are typically set manually, which can significantly affect the performance of federated clustering. To address these challenges, we introduce an Adaptive Federated FCM with an auxiliary model, named AF-FCM. In this approach, prior information from the auxiliary model, along with a proximal term in the local objective, mitigates the effects of the non-iid environment, enhancing both model robustness and effectiveness. Critical hyperparameters are adaptively adjusted using a proposed adaptive particle swarm optimization (APSO) algorithm, guided by a carefully designed fitness function. Within APSO, a nonlinear regression function adjusts the inertia weight, reducing the risk of convergence to local optima. In AF-FCM, global prototypes are refined using momentum gradient descent (MGD). Numerical experiments highlight the effectiveness and generalization performance of AF-FCM across various conditions, including heterogeneity variations, the number of clients, and the number of clusters. Comparative analysis against state-of-the-art federated clustering baseline methods validates the competitive performance of AF-FCM.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4015-4028"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jun Hu;Bing Xu;Raquel Caballero-Águila;Chaoqing Jia;Hongli Dong
{"title":"Distributed State Estimation for Nonlinear Dynamical Networks With Stochastic Topological Structures Subject to Random Deception Attacks and Bit-Rate Constraints","authors":"Jun Hu;Bing Xu;Raquel Caballero-Águila;Chaoqing Jia;Hongli Dong","doi":"10.1109/TSMC.2025.3547926","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547926","url":null,"abstract":"In this article, the issue of distributed optimized state estimation under bit-rate constraints (SEBRCs) is studied for nonlinear complex dynamical networks (NCDNs) with stochastic topological structures and deception attacks. The information of each node is transmitted to the remote estimator through shared digital communication networks. Taking the bandwidth-limited situation into account, the model of bit-rate constraints and the encoding-decoding strategy are employed to reflect the principles of resource allocation and data schedule. Moreover, two Bernoulli sequences are adopted to depict the topologies switched stochastically and the deception attacks occurred randomly. A novel optimized SEBRCs method for NCDNs is proposed such that, for both stochastic topological structures and deception attacks, the covariance upper bound of estimation error can be derived and the estimator parameter can be determined accordingly. It is worth mentioning that both the related effects caused by attack probability and bit-rate constraints onto estimation performance are clarified from the monotonicity analysis perspectives, where new analysis method is given. Besides, a sufficient criterion is given to guarantee the uniform mean-square boundedness of the obtained covariance upper bound. Finally, the applicability of the presented SEBRCs method is demonstrated via solving the indoor localization problem with multiple mobile robots.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3976-3988"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interval Type-2 Fuzzy Dynamic Event-Triggered H ∞ Consensus of Multiagent Systems","authors":"Zhenbin Du;Xiangpeng Xie;Yonggui Kao;Xudong Zhao","doi":"10.1109/TSMC.2025.3546994","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3546994","url":null,"abstract":"This study considers a dynamic event-triggered fuzzy <inline-formula> <tex-math>${mathcal {H}}_{infty }$ </tex-math></inline-formula> consensus problem for multiagent systems (MAS) characterized by parameter uncertainties and external disturbances in interval type-2 (IT2) fuzzy form. The proposed control strategy aims to minimize data transmission by triggering control events dynamically. Stability analysis is conducted by Lyapunov stability theory, and more mathematical tools are introduced to relax the sufficient condition and demonstrate the <inline-formula> <tex-math>${mathcal {H}}_{infty }$ </tex-math></inline-formula> consensus. The developed control scheme ensures the consensus among agents, enhancing the overall system performance in the presence of uncertainties and disturbances. Finally, three examples exhibit the validity of the suggested controller.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3954-3963"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shan Zhong;Bei Peng;Ziyi Wang;Jiacheng He;Kun Zhang;Gang Wang
{"title":"Outlier-Aware Recursive Instantaneous Minimum Error Entropy Algorithm","authors":"Shan Zhong;Bei Peng;Ziyi Wang;Jiacheng He;Kun Zhang;Gang Wang","doi":"10.1109/TSMC.2025.3547378","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547378","url":null,"abstract":"The minimum error entropy (MEE) criterion closely relies on the quadratic information potential (QIP) estimates of Renyi’s entropy. Nevertheless, the conventional obtained QIP estimates are numerically unstable, especially when the error samples contain outliers, resulting in the optimal solution of the MEE criterion deviating from the target vector to a certain extent. To address this problem, we introduce the M-estimate method from robust statistics into the QIP estimation process; thus, a robust estimation method called instantaneous M-estimate QIP (IM-QIP) is proposed, and several important properties of IM-QIP are presented. The proposed IM-QIP estimates could be implemented simply while ensuring great robustness. Naturally, we further propose the corresponding instantaneous M-estimate MEE (IM-MEE) criterion and apply it to adaptive filtering. A robust recursive adaptive filtering algorithm, called the recursive IM-MEE (RIM-MEE) algorithm, is proposed and analyzed in this article, along with its stability and theoretical steady-state performance. Additionally, we demonstrate that the RIM-MEE algorithm achieves a smaller theoretical bound compared to the traditional MEE algorithm under heavy-tailed and skewed noise conditions. The simulation results revealed the robustness of the IM-QIP estimates and verified the theoretical expectations and superior performance of the RIM-MEE algorithm.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4076-4090"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144090750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TechRxiv: Share Your Preprint Research With the World!","authors":"","doi":"10.1109/TSMC.2025.3551175","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3551175","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 4","pages":"3074-3074"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10933815","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143654857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems Publication Information","authors":"","doi":"10.1109/TSMC.2025.3551102","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3551102","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 4","pages":"C2-C2"},"PeriodicalIF":8.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10933816","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143654864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}