首页 > 最新文献

International Journal of Uncertainty Fuzziness and Knowledge-Based Systems最新文献

英文 中文
An OWA Based MCDM Framework for Analyzing Multidimensional Twitter Data: A Case Study on the Citizen-Government Engagement During COVID-19 基于 OWA 的多维度推特数据分析框架:COVID-19 期间公民-政府参与案例研究
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-27 DOI: 10.1142/s0218488524500144
Ankit Gupta, Sarabjeet Singh, Harmesh Rana, Vinay Kumar Prashar, Rajan Yadav

In this global pandemic caused by coronavirus, the role of social media is found to be vital for spreading awareness and faultless news about various aspects of the pandemic. Governments across the world are constantly using available social media platforms to communicate crisis information efficiently to the public, which ultimately making citizens aware about the prevailing conditions. This study systematically investigates how Indian government agencies used social media platform-Twitter to disseminate the relevant information, and to reach out to the citizens during COVID 19 crisis. Spread across various parameters over many days, the twitter data was scrapped from the official Twitter accounts of different government officials. To aggregate and summarize this multi-dimensional data and to process it further, a novel multi-criteria decision making based framework that makes the use of Clustering and Ordered weighted operators is being introduced in this study. Many OWA operators have been introduced in the recent past after their introduction in late 90s, and are used successfully for aggregation purposes in many domains. The summarized values received as an output of the framework are then used to analyze the government response towards COVID 19 situation across various parameters.

在这场由冠状病毒引发的全球大流行中,社交媒体在传播有关大流行各方面的意识和准确无误的新闻方面发挥着至关重要的作用。世界各国政府都在不断利用现有的社交媒体平台向公众有效传达危机信息,最终使公民了解当前的状况。本研究系统地调查了印度政府机构如何在 COVID 19 危机期间利用社交媒体平台 Twitter 传播相关信息,并与公民取得联系。这些 twitter 数据来自不同政府官员的官方 Twitter 账户,涵盖了多日来的各种参数。为了聚合和汇总这些多维数据并对其进行进一步处理,本研究引入了一种基于聚类和有序加权算子的新型多标准决策框架。自上世纪 90 年代末引入有序加权运算符以来,许多有序加权运算符已被成功用于许多领域的汇总目的。该框架输出的汇总值可用于分析政府对 COVID 19 情况的各种参数响应。
{"title":"An OWA Based MCDM Framework for Analyzing Multidimensional Twitter Data: A Case Study on the Citizen-Government Engagement During COVID-19","authors":"Ankit Gupta, Sarabjeet Singh, Harmesh Rana, Vinay Kumar Prashar, Rajan Yadav","doi":"10.1142/s0218488524500144","DOIUrl":"https://doi.org/10.1142/s0218488524500144","url":null,"abstract":"<p>In this global pandemic caused by coronavirus, the role of social media is found to be vital for spreading awareness and faultless news about various aspects of the pandemic. Governments across the world are constantly using available social media platforms to communicate crisis information efficiently to the public, which ultimately making citizens aware about the prevailing conditions. This study systematically investigates how Indian government agencies used social media platform-Twitter to disseminate the relevant information, and to reach out to the citizens during COVID 19 crisis. Spread across various parameters over many days, the twitter data was scrapped from the official Twitter accounts of different government officials. To aggregate and summarize this multi-dimensional data and to process it further, a novel multi-criteria decision making based framework that makes the use of Clustering and Ordered weighted operators is being introduced in this study. Many OWA operators have been introduced in the recent past after their introduction in late 90s, and are used successfully for aggregation purposes in many domains. The summarized values received as an output of the framework are then used to analyze the government response towards COVID 19 situation across various parameters.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"29 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Homogenous Ensembles of Neuro-Fuzzy Classifiers using Hyperparameter Tuning for Medical Data 使用超参数调整的神经模糊分类器同质集合用于医疗数据
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-27 DOI: 10.1142/s0218488524500119
Hafsaa Ouifak, Zaineb Afkhkhar, Alain Thierry Iliho Manzi, Ali Idri

Neuro-fuzzy techniques have been widely used in many applications due to their ability to generate interpretable fuzzy rules. Ensemble learning, on the other hand, is an emerging paradigm in artificial intelligence used to improve performance results by combining multiple single learners. This paper aims to develop and evaluate a set of homogeneous ensembles over four medical datasets using hyperparameter tuning of four neuro-fuzzy systems: adaptive neuro-fuzzy inference system (ANFIS), Dynamic evolving neuro-fuzzy system (DENFIS), Hybrid fuzzy inference system (HyFIS), and neuro-fuzzy classifier (NEFCLASS). To address the interpretability challenges and to reduce the complexity of high-dimensional data, the information gain filter was used to identify the most relevant features. After that, the performance of the neuro-fuzzy single learners and ensembles was evaluated using four performance metrics: accuracy, precision, recall, and f1 score. To decide which single learners/ensembles perform better, the Scott-Knott and Borda count techniques were used. The Scott-Knott first groups the models based on the accuracy to find the classifiers appearing in the best cluster, while the Borda count ranks the models based on all the four performance metrics without favoring any of the metrics. Results showed that: (1) The number of the combined single learners positively impacts the performance of the ensembles, (2) Single neuro-fuzzy classifiers demonstrate better or similar performance to the ensembles, but the ensembles still provide better stability of predictions, and (3) Among the ensembles of different models, ANFIS provided the best ensemble results.

神经模糊技术由于能够生成可解释的模糊规则,已被广泛应用于许多领域。另一方面,集合学习是人工智能领域的一种新兴范式,用于通过组合多个单一学习器来提高性能结果。本文旨在利用四种神经模糊系统(自适应神经模糊推理系统(ANFIS)、动态演化神经模糊系统(DENFIS)、混合模糊推理系统(HyFIS)和神经模糊分类器(NEFCLASS))的超参数调整,在四个医学数据集上开发和评估一组同质集合。为了解决可解释性难题并降低高维数据的复杂性,使用了信息增益过滤器来识别最相关的特征。之后,使用四个性能指标评估了神经模糊单一学习器和集合的性能:准确度、精确度、召回率和 f1 分数。为了确定哪个单一学习器/集合表现更好,使用了 Scott-Knott 和 Borda 计数技术。Scott-Knott 首先根据准确率对模型进行分组,以找出出现在最佳分组中的分类器,而 Borda 计数则根据所有四个性能指标对模型进行排名,不偏向任何一个指标。结果显示(1) 组合单一学习器的数量对集合的性能有积极影响;(2) 单一神经模糊分类器的性能优于或类似于集合,但集合仍能提供更好的预测稳定性;(3) 在不同模型的集合中,ANFIS 提供了最佳的集合结果。
{"title":"Homogenous Ensembles of Neuro-Fuzzy Classifiers using Hyperparameter Tuning for Medical Data","authors":"Hafsaa Ouifak, Zaineb Afkhkhar, Alain Thierry Iliho Manzi, Ali Idri","doi":"10.1142/s0218488524500119","DOIUrl":"https://doi.org/10.1142/s0218488524500119","url":null,"abstract":"<p>Neuro-fuzzy techniques have been widely used in many applications due to their ability to generate interpretable fuzzy rules. Ensemble learning, on the other hand, is an emerging paradigm in artificial intelligence used to improve performance results by combining multiple single learners. This paper aims to develop and evaluate a set of homogeneous ensembles over four medical datasets using hyperparameter tuning of four neuro-fuzzy systems: adaptive neuro-fuzzy inference system (ANFIS), Dynamic evolving neuro-fuzzy system (DENFIS), Hybrid fuzzy inference system (HyFIS), and neuro-fuzzy classifier (NEFCLASS). To address the interpretability challenges and to reduce the complexity of high-dimensional data, the information gain filter was used to identify the most relevant features. After that, the performance of the neuro-fuzzy single learners and ensembles was evaluated using four performance metrics: accuracy, precision, recall, and f1 score. To decide which single learners/ensembles perform better, the Scott-Knott and Borda count techniques were used. The Scott-Knott first groups the models based on the accuracy to find the classifiers appearing in the best cluster, while the Borda count ranks the models based on all the four performance metrics without favoring any of the metrics. Results showed that: (1) The number of the combined single learners positively impacts the performance of the ensembles, (2) Single neuro-fuzzy classifiers demonstrate better or similar performance to the ensembles, but the ensembles still provide better stability of predictions, and (3) Among the ensembles of different models, ANFIS provided the best ensemble results.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"6 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Model Predictive Control for Interval Type-2 Fuzzy Systems with Unknown Time-Varying Delay in States and Input Vector 具有未知时变状态延迟和输入向量的间隔型-2 模糊系统的模型预测控制
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-27 DOI: 10.1142/s0218488524500156
Mohammad Sarbaz

The time-varying delay is a peculiar phenomenon that occurs in almost all systems. It can cause numerous problems and instability during system operation. In this paper, the time-varying delay is considered in both the states and input vectors, which is a significant distinction between the proposed method here and previous algorithms. Furthermore, the time-varying delay is unknown but bounded. To address this issue, the Razumikhin approach is applied to the proposed method, as it incorporates a Lyapunov function with the original non-augmented state space of the system models, in contrast to the Krasovskii formula. Moreover, the Razumikhin method performs better and avoids the inherent complexity of the Krasovskii method, particularly when dealing with large delays and disturbances. For achieving output stabilization, the model predictive control (MPC) is designed for the system. The considered system in this paper is an interval type-2 (IT2) fuzzy T-S model, which provides a more accurate estimation of the dynamic model of the system. The online optimization problems are solved using linear matrix inequalities (LMIs), which reduces the computational burden and online computational costs compared to offline and non-LMI approaches. Finally, an example is provided to illustrate the effectiveness of the proposed approach.

时变延迟是几乎所有系统中都会出现的一种特殊现象。在系统运行过程中,时变延迟会导致许多问题和不稳定性。本文在状态和输入向量中都考虑了时变延迟,这是本文提出的方法与以往算法的显著区别。此外,时变延迟是未知的,但有界。为了解决这个问题,Razumikhin 方法被应用到了所提出的方法中,因为与 Krasovskii 公式不同的是,它将 Lyapunov 函数与系统模型的原始非增量状态空间结合在一起。此外,Razumikhin 方法性能更好,避免了 Krasovskii 方法固有的复杂性,尤其是在处理大延迟和干扰时。为了实现输出稳定,本文设计了模型预测控制(MPC)系统。本文所考虑的系统是一个区间型-2(IT2)模糊 T-S 模型,它能更精确地估计系统的动态模型。在线优化问题采用线性矩阵不等式(LMI)求解,与离线和非 LMI 方法相比,减轻了计算负担,降低了在线计算成本。最后,我们提供了一个示例来说明所提方法的有效性。
{"title":"Model Predictive Control for Interval Type-2 Fuzzy Systems with Unknown Time-Varying Delay in States and Input Vector","authors":"Mohammad Sarbaz","doi":"10.1142/s0218488524500156","DOIUrl":"https://doi.org/10.1142/s0218488524500156","url":null,"abstract":"<p>The time-varying delay is a peculiar phenomenon that occurs in almost all systems. It can cause numerous problems and instability during system operation. In this paper, the time-varying delay is considered in both the states and input vectors, which is a significant distinction between the proposed method here and previous algorithms. Furthermore, the time-varying delay is unknown but bounded. To address this issue, the Razumikhin approach is applied to the proposed method, as it incorporates a Lyapunov function with the original non-augmented state space of the system models, in contrast to the Krasovskii formula. Moreover, the Razumikhin method performs better and avoids the inherent complexity of the Krasovskii method, particularly when dealing with large delays and disturbances. For achieving output stabilization, the model predictive control (MPC) is designed for the system. The considered system in this paper is an interval type-2 (IT2) fuzzy T-S model, which provides a more accurate estimation of the dynamic model of the system. The online optimization problems are solved using linear matrix inequalities (LMIs), which reduces the computational burden and online computational costs compared to offline and non-LMI approaches. Finally, an example is provided to illustrate the effectiveness of the proposed approach.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"22 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Structure-Enhanced Heterogeneous Graph Representation Learning with Attention-Supplemented Embedding Fusion 利用注意力补充嵌入融合进行结构增强型异构图表示学习
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-27 DOI: 10.1142/s0218488524500132
Phu Pham

In recent years, heterogeneous network/graph representation learning/embedding (HNE) has drawn tremendous attentions from research communities in multiple disciplines. HNE has shown its outstanding performances in various networked data analysis and mining tasks. In fact, most of real-world information networks in multiple fields can be modelled as the heterogeneous information networks (HIN). Thus, the HNE-based techniques can sufficiently capture rich-structured and semantic latent features from the given information network in order to facilitate for different task-driven learning tasks. This is considered as fundamental success of HNE-based approach in comparing with previous traditional homogeneous network/graph based embedding techniques. However, there are recent studies have also demonstrated that the heterogeneous network/graph modelling and embedding through graph neural network (GNN) is not usually reliable. This challenge is original come from the fact that most of real-world heterogeneous networks are considered as incomplete and normally contain a large number of feature noises. Therefore, multiple attempts have proposed recently to overcome this limitation. Within this approach, the meta-path-based heterogeneous graph-structured latent features and GNN-based parameters are jointly learnt and optimized during the embedding process. However, this integrated GNN and heterogeneous graph structure (HGS) learning approach still suffered a challenge of effectively parameterizing and fusing different graph-structured latent features from both GNN- and HGS-based sides into better task-driven friendly and noise-reduced embedding spaces. Therefore, in this paper we proposed a novel attention-supplemented heterogeneous graph structure embedding approach, called as: AGSE. Our proposed AGSE model supports to not only achieve the combined rich heterogeneous structural and GNN-based aggregated node representations but also transform achieved node embeddings into noise-reduced and task-driven friendly embedding space. Extensive experiments in benchmark heterogeneous networked datasets for node classification task showed the effectiveness of our proposed AGSE model in comparing with state-of-the-art network embedding baselines.

近年来,异构网络/图表示学习/嵌入(HNE)引起了多学科研究界的极大关注。HNE 在各种网络数据分析和挖掘任务中表现出了卓越的性能。事实上,现实世界中多个领域的大多数信息网络都可以建模为异构信息网络(HIN)。因此,基于 HNE 的技术可以从给定的信息网络中充分捕捉丰富的结构和语义潜在特征,以促进不同任务驱动的学习任务。与以往传统的基于同构网络/图的嵌入技术相比,这被认为是基于 HNE 方法的基本成功之处。然而,最近的一些研究也表明,通过图神经网络(GNN)进行异构网络/图建模和嵌入通常并不可靠。这一挑战的根源在于,现实世界中的大多数异构网络都被认为是不完整的,通常包含大量的特征噪声。因此,最近有人提出了多种尝试来克服这一局限性。在这种方法中,基于元路径的异构图结构潜特征和基于 GNN 的参数在嵌入过程中被联合学习和优化。然而,这种集成 GNN 和异构图结构(HGS)的学习方法仍然面临着一个挑战,即如何有效地将基于 GNN 和 HGS 的不同图结构潜特征参数化并融合到更好的任务驱动型友好降噪嵌入空间中。因此,我们在本文中提出了一种新颖的注意力补充异构图结构嵌入方法,即 AGSE:AGSE。我们提出的 AGSE 模型不仅能实现丰富的异构结构和基于 GNN 的聚合节点表示,还能将已实现的节点嵌入转化为降噪和任务驱动友好的嵌入空间。在用于节点分类任务的基准异构网络数据集上进行的广泛实验表明,与最先进的网络嵌入基线相比,我们提出的 AGSE 模型非常有效。
{"title":"A Structure-Enhanced Heterogeneous Graph Representation Learning with Attention-Supplemented Embedding Fusion","authors":"Phu Pham","doi":"10.1142/s0218488524500132","DOIUrl":"https://doi.org/10.1142/s0218488524500132","url":null,"abstract":"<p>In recent years, heterogeneous network/graph representation learning/embedding (HNE) has drawn tremendous attentions from research communities in multiple disciplines. HNE has shown its outstanding performances in various networked data analysis and mining tasks. In fact, most of real-world information networks in multiple fields can be modelled as the heterogeneous information networks (HIN). Thus, the HNE-based techniques can sufficiently capture rich-structured and semantic latent features from the given information network in order to facilitate for different task-driven learning tasks. This is considered as fundamental success of HNE-based approach in comparing with previous traditional homogeneous network/graph based embedding techniques. However, there are recent studies have also demonstrated that the heterogeneous network/graph modelling and embedding through graph neural network (GNN) is not usually reliable. This challenge is original come from the fact that most of real-world heterogeneous networks are considered as incomplete and normally contain a large number of feature noises. Therefore, multiple attempts have proposed recently to overcome this limitation. Within this approach, the meta-path-based heterogeneous graph-structured latent features and GNN-based parameters are jointly learnt and optimized during the embedding process. However, this integrated GNN and heterogeneous graph structure (HGS) learning approach still suffered a challenge of effectively parameterizing and fusing different graph-structured latent features from both GNN- and HGS-based sides into better task-driven friendly and noise-reduced embedding spaces. Therefore, in this paper we proposed a novel attention-supplemented heterogeneous graph structure embedding approach, called as: AGSE. Our proposed AGSE model supports to not only achieve the combined rich heterogeneous structural and GNN-based aggregated node representations but also transform achieved node embeddings into noise-reduced and task-driven friendly embedding space. Extensive experiments in benchmark heterogeneous networked datasets for node classification task showed the effectiveness of our proposed AGSE model in comparing with state-of-the-art network embedding baselines.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"20 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PSO Based Constraint Optimization of Intuitionistic Fuzzy Shortest Path Problem in an Undirected Network 基于 PSO 的无向网络中直觉模糊最短路径问题的约束优化
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-27 DOI: 10.1142/s0218488524500120
Chanchal Dudeja

Shortest Path Problem (SPP) is mainly used in network optimization; also, it has a wide range of applications such as routing, scheduling, communication and transportation. The main objective of this work is to find the shortest path between two specified nodes by satisfying certain constraints. This modified version of SP is called Constraint Shortest Path (CSP), which establishes a certain limit on selected constraints for the path. The limit for constraint values is precisely specified in traditional CSP problems. But, the precise data may vary due to environmental conditions, traffic and payload. To resolve this, the proposed CSP uses intuitionistic fuzzy numbers to deal with imprecise data. Also, finding an optimal solution in the complex search space of an undirected network is difficult. Hence, Particle Swarm Optimization (PSO) is used in the proposed work to obtain the optimal global solution within feasible regions. A numerical example and the implementation of the proposed work in Matlab 2016a working environment are also illustrated. The simulation analysis shows that the proposed PSO algorithm takes 1.8s to find the CSP in a specified undirected network graph, which is comparatively lower than the existing Genetic Algorithm (2.4s) and without optimization (5.6s).

最短路径问题(SPP)主要用于网络优化,在路由、调度、通信和运输等领域也有广泛的应用。这项工作的主要目标是通过满足某些约束条件,找到两个指定节点之间的最短路径。这种改进版的 SP 被称为 "约束最短路径(CSP)",它为路径所选的约束条件设定了一定的限制。在传统的 CSP 问题中,约束值的限制是精确指定的。但是,由于环境条件、交通量和有效载荷的不同,精确数据也可能不同。为了解决这个问题,建议的 CSP 使用直觉模糊数来处理不精确的数据。此外,在无定向网络的复杂搜索空间中寻找最优解也很困难。因此,本文采用了粒子群优化(PSO)技术,以获得可行区域内的全局最优解。此外,还举例说明了在 Matlab 2016a 工作环境中的数值示例和拟议工作的实现。仿真分析表明,拟议的 PSO 算法在指定的无向网络图中找到 CSP 所需的时间为 1.8s,相对低于现有的遗传算法(2.4s)和未优化算法(5.6s)。
{"title":"PSO Based Constraint Optimization of Intuitionistic Fuzzy Shortest Path Problem in an Undirected Network","authors":"Chanchal Dudeja","doi":"10.1142/s0218488524500120","DOIUrl":"https://doi.org/10.1142/s0218488524500120","url":null,"abstract":"<p>Shortest Path Problem (SPP) is mainly used in network optimization; also, it has a wide range of applications such as routing, scheduling, communication and transportation. The main objective of this work is to find the shortest path between two specified nodes by satisfying certain constraints. This modified version of SP is called Constraint Shortest Path (CSP), which establishes a certain limit on selected constraints for the path. The limit for constraint values is precisely specified in traditional CSP problems. But, the precise data may vary due to environmental conditions, traffic and payload. To resolve this, the proposed CSP uses intuitionistic fuzzy numbers to deal with imprecise data. Also, finding an optimal solution in the complex search space of an undirected network is difficult. Hence, Particle Swarm Optimization (PSO) is used in the proposed work to obtain the optimal global solution within feasible regions. A numerical example and the implementation of the proposed work in Matlab 2016a working environment are also illustrated. The simulation analysis shows that the proposed PSO algorithm takes 1.8<span><math altimg=\"eq-00001.gif\" display=\"inline\"><mspace width=\".17em\"></mspace></math></span><span></span>s to find the CSP in a specified undirected network graph, which is comparatively lower than the existing Genetic Algorithm (2.4<span><math altimg=\"eq-00002.gif\" display=\"inline\"><mspace width=\".17em\"></mspace></math></span><span></span>s) and without optimization (5.6<span><math altimg=\"eq-00003.gif\" display=\"inline\"><mspace width=\".17em\"></mspace></math></span><span></span>s).</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"42 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Hybrid Classifier Based on the Generalized Heronian Mean Operator and Fuzzy Robust PCA Algorithms 基于广义赫伦平均值算子和模糊稳健 PCA 算法的混合分类器
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-19 DOI: 10.1142/s0218488524500077
Onesfole Kurama

We present a new classifier that uses a generalized Heronian mean (GHM) operator, and fuzzy robust principal component analysis (FRPCA) algorithms. The similarity classifier was earlier studied with other aggregation operators, including: the ordered weighted averaging (OWA), generalized mean, arithmetic mean among others. Parameters in the GHM operator makes the new classifier suitable for handling a variety of modeling problems involving parameter settings. Motivated by the nature of the GHM operator, we examine which FRPCA algorithm is suitable for use to achieve optimal performance of the new classifier. The effects of dimensionality reduction and fuzziness variable on classification accuracy are examined. The performance of the new classifier is tested on three real-world datasets: fertility, horse-colic, and Haberman’s survival. Compared with previously studied similarity classifiers, the new method achieved improved classification accuracy for the tested datasets. In fertility dataset, the new classifier achieved improvements in accuracy of 14.60%,19.73%, and 23.00% compared with the OWA, generalized mean, and arithmetic mean based classifiers respectively. The new classifier is simpler to implement since it does not require any weight generation criteria as the case is for the OWA based classifier.

我们提出了一种新的分类器,它使用广义希罗尼均值(GHM)算子和模糊鲁棒主成分分析(FRPCA)算法。此前,我们曾使用其他聚合算子对相似性分类器进行过研究,包括:有序加权平均(OWA)、广义均值、算术平均等。GHM 算子中的参数使新分类器适用于处理各种涉及参数设置的建模问题。受 GHM 算子性质的启发,我们研究了哪种 FRPCA 算法适合用于实现新分类器的最佳性能。我们还考察了降维和模糊变量对分类准确性的影响。新分类器的性能在三个真实世界的数据集上进行了测试:生育率、马的结肠和哈伯曼的存活率。与之前研究的相似性分类器相比,新方法提高了测试数据集的分类准确率。在生育率数据集中,与基于 OWA、广义平均值和算术平均值的分类器相比,新分类器的准确率分别提高了 14.60%、19.73% 和 23.00%。由于新分类器不像基于 OWA 的分类器那样需要任何权重生成标准,因此实施起来更简单。
{"title":"A Hybrid Classifier Based on the Generalized Heronian Mean Operator and Fuzzy Robust PCA Algorithms","authors":"Onesfole Kurama","doi":"10.1142/s0218488524500077","DOIUrl":"https://doi.org/10.1142/s0218488524500077","url":null,"abstract":"<p>We present a new classifier that uses a generalized Heronian mean (GHM) operator, and fuzzy robust principal component analysis (FRPCA) algorithms. The similarity classifier was earlier studied with other aggregation operators, including: the ordered weighted averaging (OWA), generalized mean, arithmetic mean among others. Parameters in the GHM operator makes the new classifier suitable for handling a variety of modeling problems involving parameter settings. Motivated by the nature of the GHM operator, we examine which FRPCA algorithm is suitable for use to achieve optimal performance of the new classifier. The effects of dimensionality reduction and fuzziness variable on classification accuracy are examined. The performance of the new classifier is tested on three real-world datasets: fertility, horse-colic, and Haberman’s survival. Compared with previously studied similarity classifiers, the new method achieved improved classification accuracy for the tested datasets. In fertility dataset, the new classifier achieved improvements in accuracy of <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mn>1</mn><mn>4</mn><mo>.</mo><mn>6</mn><mn>0</mn><mi>%</mi><mo>,</mo><mn>1</mn><mn>9</mn><mo>.</mo><mn>7</mn><mn>3</mn><mi>%</mi></math></span><span></span>, and <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mn>2</mn><mn>3</mn><mo>.</mo><mn>0</mn><mn>0</mn><mi>%</mi></math></span><span></span> compared with the OWA, generalized mean, and arithmetic mean based classifiers respectively. The new classifier is simpler to implement since it does not require any weight generation criteria as the case is for the OWA based classifier.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"29 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140630497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fuzzy Data Association-Towards Better Uncertainty Tracking in Clutter Environments 模糊数据关联--在杂乱环境中实现更好的不确定性跟踪
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-19 DOI: 10.1142/s0218488524500089
Yi Jen Peng, Chun-Ta Lin, Yee Ming Chen

The goal of explainable artificial intelligence (XAI) is to solve problems in a way that humans can understand how it does it. For data association there is growing demand for XAI, in which the measurement uncertainty and target (dynamic or/and measurement) model uncertainty are two fundamental problems in maneuvering target tracking in clutter. It commonly suffers of false alarms and missed detections. These situations focus on enhancing explainability, mitigating bias and creating better outcomes for all. Most the probabilistic data association (PDA) methods are weakly able, or even unable, to explain data association. To overcome these situations, the XAI components employed of two modules of Fuzzy-joint probability data association (FJDA) and Fuzzy maneuver compensator (FMC) are first established. Next, these two modules are further employed to construct maneuver tracking scheme, FJDA is then utilized to evaluate the association degree of measurements belonging to different targets and FMC plays compensation role in accordance with maneuver need. The performances of the proposed maneuver tracking scheme were compared with the PDA method and the joint probabilistic data association (JPDA) method using simulated radar surveillance data under a high cluttered environment. The numerical simulation proposed maneuver tracking scheme embedded XAI components FJDA/FCM having a remarkable improvement, due to fully utilize the useful knowledge information in the data association and reduces the impact of measurement uncertainties of the maneuvering target tracking with changing dynamics.

可解释人工智能(XAI)的目标是以人类能够理解的方式解决问题。在数据关联方面,对 XAI 的需求日益增长,其中测量不确定性和目标(动态或/和测量)模型不确定性是杂波中机动目标跟踪的两个基本问题。这通常会造成误报和漏检。这些情况的重点是提高可解释性、减少偏差并为所有人创造更好的结果。大多数概率数据关联 (PDA) 方法对数据关联的解释能力较弱,甚至无法解释。为了克服这些情况,首先建立了由模糊联合概率数据关联(FJDA)和模糊机动补偿器(FMC)两大模块组成的 XAI 组件。接下来,进一步利用这两个模块构建机动跟踪方案,然后利用 FJDA 评估属于不同目标的测量值的关联度,而 FMC 则根据机动需要发挥补偿作用。利用高杂波环境下的模拟雷达监视数据,比较了所提出的机动跟踪方案与 PDA 方法和联合概率数据关联(JPDA)方法的性能。数值模拟结果表明,嵌入 XAI 组件的 FJDA/FCM 机动跟踪方案由于充分利用了数据关联中的有用知识信息,降低了测量不确定性对动态变化的机动目标跟踪的影响,因而具有显著的改进效果。
{"title":"Fuzzy Data Association-Towards Better Uncertainty Tracking in Clutter Environments","authors":"Yi Jen Peng, Chun-Ta Lin, Yee Ming Chen","doi":"10.1142/s0218488524500089","DOIUrl":"https://doi.org/10.1142/s0218488524500089","url":null,"abstract":"<p>The goal of explainable artificial intelligence (XAI) is to solve problems in a way that humans can understand how it does it. For data association there is growing demand for XAI, in which the measurement uncertainty and target (dynamic or/and measurement) model uncertainty are two fundamental problems in maneuvering target tracking in clutter. It commonly suffers of false alarms and missed detections. These situations focus on enhancing explainability, mitigating bias and creating better outcomes for all. Most the probabilistic data association (PDA) methods are weakly able, or even unable, to explain data association. To overcome these situations, the XAI components employed of two modules of Fuzzy-joint probability data association (FJDA) and Fuzzy maneuver compensator (FMC) are first established. Next, these two modules are further employed to construct maneuver tracking scheme, FJDA is then utilized to evaluate the association degree of measurements belonging to different targets and FMC plays compensation role in accordance with maneuver need. The performances of the proposed maneuver tracking scheme were compared with the PDA method and the joint probabilistic data association (JPDA) method using simulated radar surveillance data under a high cluttered environment. The numerical simulation proposed maneuver tracking scheme embedded XAI components FJDA/FCM having a remarkable improvement, due to fully utilize the useful knowledge information in the data association and reduces the impact of measurement uncertainties of the maneuvering target tracking with changing dynamics.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140629335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cognitive Consistency in Uncertain and Preference Involved Weights Determination 不确定性和涉及偏好的权重确定中的认知一致性
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-19 DOI: 10.1142/s0218488524500107
Lesheng Jin, Ronald R. Yager, Radko Mesiar, Tapan Senapati, Chiranjibe Jana, Chao Ma, Humberto Bustince

In uncertain information environment, bi-polar preferences can be elicited from experts and processed to be exerted over some weights determination for multiple-agents evaluation. Recently, some weighting methodologies and models in uncertain and preference involved environment with multiple opinions from multiple experts are proposed in some literature. However, in that existing method, when collecting different types of preferences from a single expert, sometimes some subtle cognitive inconsistency may occur. To eliminate such inconsistency, this work elaborately analyzes the possible reasons and proposes some amendment together with a new distinguishable set of formulations for modeling. In addition, we further consider two situations of the weighting models for the problem, with one only considering the situation of single expert with no risk of cognitive inconsistency and the other considering the case of multiple experts wherein some inconsistency might occur. Numerical example and comparison are also presented accordingly.

在不确定的信息环境中,可以从专家那里获得两极偏好,并对其进行处理,以确定多方评价的权重。最近,一些文献提出了在不确定和涉及偏好的环境中,由多个专家提供多种意见的一些加权方法和模型。然而,在现有的方法中,当从一个专家那里收集不同类型的偏好时,有时可能会出现一些微妙的认知不一致。为了消除这种不一致性,本文详细分析了可能的原因,并提出了一些修正建议和一套新的可区分的建模公式。此外,我们还进一步考虑了该问题权重模型的两种情况,一种是只考虑单个专家的情况,不存在认知不一致的风险;另一种是考虑多个专家的情况,可能会出现一些不一致。我们还给出了相应的数字示例和比较。
{"title":"Cognitive Consistency in Uncertain and Preference Involved Weights Determination","authors":"Lesheng Jin, Ronald R. Yager, Radko Mesiar, Tapan Senapati, Chiranjibe Jana, Chao Ma, Humberto Bustince","doi":"10.1142/s0218488524500107","DOIUrl":"https://doi.org/10.1142/s0218488524500107","url":null,"abstract":"<p>In uncertain information environment, bi-polar preferences can be elicited from experts and processed to be exerted over some weights determination for multiple-agents evaluation. Recently, some weighting methodologies and models in uncertain and preference involved environment with multiple opinions from multiple experts are proposed in some literature. However, in that existing method, when collecting different types of preferences from a single expert, sometimes some subtle cognitive inconsistency may occur. To eliminate such inconsistency, this work elaborately analyzes the possible reasons and proposes some amendment together with a new distinguishable set of formulations for modeling. In addition, we further consider two situations of the weighting models for the problem, with one only considering the situation of single expert with no risk of cognitive inconsistency and the other considering the case of multiple experts wherein some inconsistency might occur. Numerical example and comparison are also presented accordingly.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"8 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140624505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solution of Uncertain Constrained Multi-Objective Travelling Salesman Problem with Aspiration Level Based Multi Objective Quasi Oppositional Jaya Algorithm 用基于愿望水平的多目标准对立伽亚算法解决不确定约束多目标旅行推销员问题
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-19 DOI: 10.1142/s0218488524500090
Aaishwarya Bajaj, Jayesh Dhodiya

Multi-Objective Travelling Salesman Problem (MOTSP) is one of the most crucial problems in realistic scenarios, and it is difficult to solve by classical methods. However, it can be solved by evolutionary methods. This paper investigates the Constrained Multi-Objective Travelling Salesman Problem (CMOTSP) and the Constrained Multi-Objective Solid Travelling Salesman Problem (CMOSTSP) under an uncertain environment with zigzag uncertain variables. To solve CMOTSP and CMOSTSP models under uncertain environment, the expected value and optimistic value models are developed using two different ranking criteria of uncertainty theory. The models are transformed to their deterministic forms using the fundamentals of uncertainty. The Models are solved using two solution methodologies Aspiration level-based Multi-Objective Quasi Oppositional Jaya Algorithm (AL-based MOQO Jaya) and Fuzzy Programming Technique (FPT) with linear membership function. Further, the numerical illustration is solved using both methodologies to demonstrate its application. The sensitivity of the OVM model’s objective functions regarding confidence levels is also investigated to look at the variation in the objective function. The paper concludes that the developed approach has solved CMOTSP and CMOSTSP efficiently with an effective output and provides alternative solutions for decision-making to DM.

多目标旅行推销员问题(MOTSP)是现实场景中最关键的问题之一,用传统方法很难解决。然而,进化方法可以解决这一问题。本文研究了不确定环境下的受约束多目标旅行推销员问题(CMOTSP)和受约束多目标固体旅行推销员问题(CMOSTSP)。为求解不确定环境下的 CMOTSP 和 CMOSTSP 模型,利用不确定性理论的两种不同排序准则,建立了期望值模型和乐观值模型。利用不确定性的基本原理将模型转换为确定性形式。这些模型采用两种求解方法:基于期望值的多目标准对立伽亚算法(AL-based MOQO Jaya)和具有线性成员函数的模糊编程技术(FPT)。此外,还使用这两种方法进行了数值说明,以展示其应用。此外,还研究了 OVM 模型目标函数对置信度的敏感性,以了解目标函数的变化情况。本文的结论是,所开发的方法以有效的输出高效地解决了 CMOTSP 和 CMOSTSP 问题,并为 DM 的决策提供了替代解决方案。
{"title":"Solution of Uncertain Constrained Multi-Objective Travelling Salesman Problem with Aspiration Level Based Multi Objective Quasi Oppositional Jaya Algorithm","authors":"Aaishwarya Bajaj, Jayesh Dhodiya","doi":"10.1142/s0218488524500090","DOIUrl":"https://doi.org/10.1142/s0218488524500090","url":null,"abstract":"<p>Multi-Objective Travelling Salesman Problem (MOTSP) is one of the most crucial problems in realistic scenarios, and it is difficult to solve by classical methods. However, it can be solved by evolutionary methods. This paper investigates the Constrained Multi-Objective Travelling Salesman Problem (CMOTSP) and the Constrained Multi-Objective Solid Travelling Salesman Problem (CMOSTSP) under an uncertain environment with zigzag uncertain variables. To solve CMOTSP and CMOSTSP models under uncertain environment, the expected value and optimistic value models are developed using two different ranking criteria of uncertainty theory. The models are transformed to their deterministic forms using the fundamentals of uncertainty. The Models are solved using two solution methodologies Aspiration level-based Multi-Objective Quasi Oppositional Jaya Algorithm (AL-based MOQO Jaya) and Fuzzy Programming Technique (FPT) with linear membership function. Further, the numerical illustration is solved using both methodologies to demonstrate its application. The sensitivity of the OVM model’s objective functions regarding confidence levels is also investigated to look at the variation in the objective function. The paper concludes that the developed approach has solved CMOTSP and CMOSTSP efficiently with an effective output and provides alternative solutions for decision-making to DM.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"112 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140624502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive Fuzzy Backstepping and Backstepping Sliding Mode Controllers Based on ICD Observer: A Comparative Study 基于 ICD 观察器的自适应模糊反向和反向滑模控制器:比较研究
IF 1.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-19 DOI: 10.1142/s0218488524500065
Safa Choueikh, Marwen Kermani, Faouzi M’Sahli

This paper develops a Fuzzy Adaptive Backstepping Control (FABC) and a Fuzzy Adaptive Backstepping Sliding Mode Control (FABSMC) for Single-Input Single-Output (SISO) nonlinear-systems with unmeasured states. The proposed adaptive schemes are fully compared. Thus, the Fuzzy Type-2 (FT2) concept and the High-Order Integral-Chain Differentiator (HOICD) are used as two universal approximators. Indeed, the first one is employed to approximate the nonlinear system model’s and the second one to estimate the unknown states. Special attention is paid for the used approximators robustness under unmodeled dynamics, parameter variations and process noise.

It should be noted that the asymptotic stability of both the fuzzy adaptive controls and the observer convergence for each scheme have been proved. In addition, the employed schemes have been simulated on a two-tank coupled nonlinear system. Thus, from simulation results, we can prove that the proposed methods guarantee that all signals for closed loop systems are both regular and bounded. Specifically, it can be shown that the performances of the proposed Fuzzy Interval Type-2 (FIT2) schemes are significantly improved compared with Fuzzy Type-1 (FT1) schemes in presence of external disturbances.

本文针对具有未测量状态的单输入单输出(SISO)非线性系统,开发了模糊自适应后退控制(FABC)和模糊自适应后退滑模控制(FABSMC)。对提出的自适应方案进行了充分比较。因此,模糊 2 型(FT2)概念和高阶积分链微分器(HOICD)被用作两个通用近似器。事实上,前者用于近似非线性系统模型,后者用于估计未知状态。值得注意的是,每个方案的模糊自适应控制和观测器收敛的渐近稳定性都已得到证明。此外,还在双油箱耦合非线性系统上模拟了所采用的方案。因此,从仿真结果来看,我们可以证明所提出的方法能保证闭环系统的所有信号都是正则和有界的。具体而言,可以证明与模糊 1 型(FT1)方案相比,所提出的模糊 2 型(FIT2)方案在外部干扰下的性能有了显著提高。
{"title":"Adaptive Fuzzy Backstepping and Backstepping Sliding Mode Controllers Based on ICD Observer: A Comparative Study","authors":"Safa Choueikh, Marwen Kermani, Faouzi M’Sahli","doi":"10.1142/s0218488524500065","DOIUrl":"https://doi.org/10.1142/s0218488524500065","url":null,"abstract":"<p>This paper develops a Fuzzy Adaptive Backstepping Control (FABC) and a Fuzzy Adaptive Backstepping Sliding Mode Control (FABSMC) for Single-Input Single-Output (SISO) nonlinear-systems with unmeasured states. The proposed adaptive schemes are fully compared. Thus, the Fuzzy Type-2 (FT2) concept and the High-Order Integral-Chain Differentiator (HOICD) are used as two universal approximators. Indeed, the first one is employed to approximate the nonlinear system model’s and the second one to estimate the unknown states. Special attention is paid for the used approximators robustness under unmodeled dynamics, parameter variations and process noise.</p><p>It should be noted that the asymptotic stability of both the fuzzy adaptive controls and the observer convergence for each scheme have been proved. In addition, the employed schemes have been simulated on a two-tank coupled nonlinear system. Thus, from simulation results, we can prove that the proposed methods guarantee that all signals for closed loop systems are both regular and bounded. Specifically, it can be shown that the performances of the proposed Fuzzy Interval Type-2 (FIT2) schemes are significantly improved compared with Fuzzy Type-1 (FT1) schemes in presence of external disturbances.</p>","PeriodicalId":50283,"journal":{"name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","volume":"44 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140629222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Journal of Uncertainty Fuzziness and Knowledge-Based Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1