Information Sciences最新文献_第9页

Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning 树状平滑：为可解释的机器学习对树集合进行事后正则化

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-16 DOI: 10.1016/j.ins.2024.121564

Bastian Pfeifer , Arne Gevaert , Markus Loecher , Andreas Holzinger

{"title":"Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning","authors":"Bastian Pfeifer , Arne Gevaert , Markus Loecher , Andreas Holzinger","doi":"10.1016/j.ins.2024.121564","DOIUrl":"10.1016/j.ins.2024.121564","url":null,"abstract":"<div><div>Random Forests (RFs) are powerful ensemble learning algorithms that are widely used in various machine learning tasks. However, they tend to overfit noisy or irrelevant features, which can result in decreased generalization performance. Post-hoc regularization techniques aim to solve this problem by modifying the structure of the learned ensemble after training. We propose a novel <em>post-hoc regularization via tree smoothing</em> for classification tasks to leverage the reliable class distributions closer to the root node whilst reducing the impact of more specific and potentially noisy splits deeper in the tree. Our novel approach allows for a form of pruning that does not alter the general structure of the trees, adjusting the influence of nodes based on their proximity to the root node. We evaluated the performance of our method on various machine learning benchmark data sets and on cancer data from The Cancer Genome Atlas (TCGA). Our approach demonstrates competitive performance compared to the state-of-the-art and, in the majority of cases, and outperforms it in most cases in terms of prediction accuracy, generalization, and interpretability.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121564"},"PeriodicalIF":8.1,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445331","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}

引用次数: 0

Resilient consensus of heterogeneous multi-agent systems under asynchronous optimal DoS attack schedules 异步最佳 DoS 攻击时间表下异构多代理系统的弹性共识

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-16 DOI: 10.1016/j.ins.2024.121550

Yan Xie , Lianghao Ji , Xing Guo , Huaqing Li

引用次数: 0

Evolutionary stochastic configuration networks for industrial data analytics 用于工业数据分析的进化随机配置网络

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-16 DOI: 10.1016/j.ins.2024.121546

Jianjiao Ji , Dianhui Wang

引用次数: 0

Granular fuzzy calculus on time scales and its applications to fuzzy dynamic equations 时间尺度上的粒度模糊微积分及其在模糊动态方程中的应用

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-16 DOI: 10.1016/j.ins.2024.121547

Tri Truong , Martin Bohner , Ewa Girejko , Agnieszka B. Malinowska , Ngo Van Hoa

引用次数: 0

Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm 利用蚁群优化算法的证据框架优化控制参数

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-13 DOI: 10.1016/j.ins.2024.121533

Mlungisi Duma , Bhekisipho Twala , Tshilidzi Marwala

{"title":"Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm","authors":"Mlungisi Duma , Bhekisipho Twala , Tshilidzi Marwala","doi":"10.1016/j.ins.2024.121533","DOIUrl":"10.1016/j.ins.2024.121533","url":null,"abstract":"<div><div>The ant colony optimization (ACO) algorithm is a metaheuristic initially designed to solve the travelling salesman problem (TSP). The design of experiments, finding the suitable ACO algorithm configuration, and calibrating the adaptive control parameters are exhaustive and time-consuming exercises, especially for TSPs where the number of cities can exceed 1000. This paper presents an evidence framework driven control parameter optimisation (EFCPO) algorithm for an ACO algorithm solving TSPs. EFCPO performs auto-tuning of the adaptive control parameters and makes recommendations about the ACO algorithms that are best suited for the TSPs in question using the log evidence. In addition, with this ability, the algorithm can take a solution provided by an ACO algorithm and improve the results. The EFCPO accomplishes this over a number of cycles through auto-tuning of the control parameters and re-running the ACO until the process is completed. The capabilities of EFCPO are compared to another configuration tool, irace, using benchmark ACO algorithms to test the efficiency of the framework. The benchmark algorithms make use of a local search strategy to solve TSPs. The results show that ACO algorithms are able to find new and improved solution tours within reasonable times. The improvements are also significant. In addition, ACO algorithms that are best suited for the TSP in question are preferred, making the EFCPO an effective tool for real-time configuration of ACO algorithms for solving TSPs.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121533"},"PeriodicalIF":8.1,"publicationDate":"2024-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530613","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}

引用次数: 0

Misshaped boundary classifier model for license plate detection in haze weather using entropy CNN 利用熵 CNN 建立用于雾霾天气车牌检测的错形边界分类器模型

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-12 DOI: 10.1016/j.ins.2024.121530

Fangfang Ye , Jinming Wang , Congcong Liu

引用次数: 0

Label of a linguistic value in a universe of discourse and the truth values of fuzzy propositions 话语宇宙中语言值的标签和模糊命题的真值

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121545

Zheng Pei , Qiong Liu , Li Yan , Lu Wang

{"title":"Label of a linguistic value in a universe of discourse and the truth values of fuzzy propositions","authors":"Zheng Pei , Qiong Liu , Li Yan , Lu Wang","doi":"10.1016/j.ins.2024.121545","DOIUrl":"10.1016/j.ins.2024.121545","url":null,"abstract":"<div><div>Due to objects described by a linguistic value with unsharp or fuzzy boundary, meaning of a linguistic value means different things to different people, the relation between the linguistic value and membership functions as its meaning is one-to-many rather than one-to-one. How to precisiate meaning of a linguistic value and even determine the truth values of fuzzy propositions remain open problems in computing with words (<em>CW</em>). In the paper, label of a linguistic value in its universe of discourse is proposed to formalize a possible position of objects described by the linguistic value, which is determined by a part of objects that can be and can not be described by the linguistic value via a group of users' commonsense knowledge. Then confidence degree of a membership function relative to a linguistic value is presented by measuring “<em>the membership function is close to label of the linguistic value</em>”, which can be used to precisiate meaning of a linguistic value and determine the truth values of fuzzy propositions. Finally, the truth value approximate reasoning of fuzzy propositions in the framework of the generalized modus ponens is provided and employed to evaluate the students' educational achievement. Comparative analysis with educational achievement based on Aliev's <em>Z</em>-interpolation approach and Zadeh's compositional rule of inference show that label of a linguistic value and confidence degree of a membership function relative to the linguistic value are effective and useful tools for <em>CW</em>.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121545"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422895","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}

引用次数: 0

Finite-time optimal control for a class of nonlinear systems with performance constraints via critic-only ADP: Theory and experiments 通过唯批判 ADP 实现一类性能受限非线性系统的有限时间最优控制：理论与实验

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121542

Haichao Zhang , Haowei Huang , Bing Xiao , Shen Yin , Bo Li

引用次数: 0

Hierarchical Event-RGB Interaction Network for single-eye expression recognition 用于单眼表情识别的分层事件-RGB 交互网络

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121539

Runduo Han , Xiuping Liu , Yi Zhang , Jun Zhou , Hongchen Tan , Xin Li

{"title":"Hierarchical Event-RGB Interaction Network for single-eye expression recognition","authors":"Runduo Han , Xiuping Liu , Yi Zhang , Jun Zhou , Hongchen Tan , Xin Li","doi":"10.1016/j.ins.2024.121539","DOIUrl":"10.1016/j.ins.2024.121539","url":null,"abstract":"<div><div>The Single-eye Expression Recognition task stands as a crucial vision task, aimed at decoding human emotional states through careful examination of the eye region. Nevertheless, traditional cameras face challenges in detecting and capturing relevant biological information, especially under demanding lighting conditions such as dim environments, high exposure scenarios, or when other radiation sources are present. In this regard, we use a new type of sensor data that can resist extreme lighting conditions, namely event camera data, to improve the performance of single-eye expression recognition. To this end, we propose a novel Hierarchical Event-RGB Interaction Network (HI-Net), to fully integrate RGB and event data to overcome the extreme lighting challenges faced by the single-eye expression recognition task. The HI-Net contains two novel designs: Event-RGB Semantic Interaction Mechanism (ER-SIM) and Hierarchical Semantics Modeling (HSM) Scheme. The former aims to achieve interaction between Event and RGB modality semantics, while the latter aims to obtain high-quality modality semantic representations. In the ER-SIM, we employ an effective cross-attention mechanism to facilitate information fusion, to adaptively integrate and complement multi-scale Event and RGB semantics to cope with extreme lighting conditions. In HSM Scheme, we first explore multi-scale contextual semantics for the event modality and the RGB modality respectively. Then, we perform a semantics interaction strategy for these multi-scale contextual semantics, to enhance each modality's semantic representation. Extensive experiments demonstrate that our HI-Net significantly outperforms many state-of-the-art methods on the single-eye expression recognition task, especially under degraded lighting conditions.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121539"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445329","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}

引用次数: 0

Towards scalable topic detection on web via simulating Lévy walks nature of topics in similarity space 通过模拟相似性空间中主题的莱维散步性质，实现可扩展的网络主题检测

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121544

Junbiao Pang , Qingming Huang

引用次数: 0