首页 > 最新文献

Knowledge-Based Systems最新文献

英文 中文
ConUMIP: Continuous-time dynamic graph learning via uncertainty masked mix-up on representation space ConUMIP:通过表征空间上的不确定性掩蔽混合进行连续时间动态图学习
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-15 DOI: 10.1016/j.knosys.2024.112748
Haoyu Zhang, Xuchu Jiang
Representation learning on continuous-time dynamic graphs has garnered substantial attention for its capacity to model evolving entity relationships. However, existing methods exhibit pronounced overfitting, particularly in complex and sparse data scenarios. We empirically substantiate this overfitting through multiple indicators: (1) a significant performance discrepancy between training and validation/test sets, especially for long-term interaction predictions; (2) an inverse correlation between model complexity and generalization performance; (3) a widening temporal generalization gap as the prediction horizons extend; and (4) rapid performance deterioration under data-sparse conditions. These phenomena collectively demonstrate the overfitting issue, limiting the applicability of current approaches in cold-start scenarios and dynamic environments. To address this, we propose Continuous-Time Dynamic Graph Learning via Uncertainty Masked MIx-UP (ConUMIP), a novel data augmentation method operating in the representation space of continuous-time dynamic graphs. Unlike conventional techniques that perturb raw graph data, ConUMIP adaptively captures temporal evolution patterns and generates diverse augmented samples. This approach effectively mitigates overfitting while enhancing long-term dependency modeling. By eschewing predefined time windows and integrating both local and global structures, ConUMIP demonstrates superior adaptation to complex dynamic evolution patterns. Comprehensive evaluations across five real-world datasets validate ConUMIP's efficacy in substantially improving both the performance and generalizability of existing continuous-time dynamic graph models, particularly in long-term predictions and data-sparse scenarios, without incurring additional computational complexity, thus offering a robust solution to the overfitting challenge in this domain.
连续时间动态图的表征学习因其能够模拟不断变化的实体关系而备受关注。然而,现有的方法表现出明显的过拟合,尤其是在复杂和稀疏的数据场景中。我们通过多个指标实证了这种过拟合现象:(1) 训练集和验证/测试集之间存在明显的性能差异,尤其是在长期交互预测方面;(2) 模型复杂性和泛化性能之间存在反相关关系;(3) 随着预测范围的扩大,泛化的时间差距也在扩大;(4) 在数据稀少的条件下,性能迅速下降。这些现象共同表明了过拟合问题,限制了当前方法在冷启动场景和动态环境中的适用性。为了解决这个问题,我们提出了通过不确定性掩蔽 MIx-UP 进行连续时间动态图学习(ConUMIP),这是一种在连续时间动态图表示空间中运行的新型数据增强方法。与扰动原始图数据的传统技术不同,ConUMIP 能够自适应地捕捉时间演化模式并生成多样化的增强样本。这种方法在增强长期依赖性建模的同时,还能有效缓解过度拟合问题。通过摒弃预定义的时间窗口并整合局部和全局结构,ConUMIP 展示了对复杂动态演化模式的卓越适应性。对五个真实数据集的全面评估验证了 ConUMIP 在大幅提高现有连续时间动态图模型的性能和普适性方面的功效,尤其是在长期预测和数据稀缺的情况下,而不会产生额外的计算复杂性,从而为该领域的过拟合挑战提供了一个稳健的解决方案。
{"title":"ConUMIP: Continuous-time dynamic graph learning via uncertainty masked mix-up on representation space","authors":"Haoyu Zhang,&nbsp;Xuchu Jiang","doi":"10.1016/j.knosys.2024.112748","DOIUrl":"10.1016/j.knosys.2024.112748","url":null,"abstract":"<div><div>Representation learning on continuous-time dynamic graphs has garnered substantial attention for its capacity to model evolving entity relationships. However, existing methods exhibit pronounced overfitting, particularly in complex and sparse data scenarios. We empirically substantiate this overfitting through multiple indicators: (1) a significant performance discrepancy between training and validation/test sets, especially for long-term interaction predictions; (2) an inverse correlation between model complexity and generalization performance; (3) a widening temporal generalization gap as the prediction horizons extend; and (4) rapid performance deterioration under data-sparse conditions. These phenomena collectively demonstrate the overfitting issue, limiting the applicability of current approaches in cold-start scenarios and dynamic environments. To address this, we propose <strong>Con</strong>tinuous-Time Dynamic Graph Learning via <strong>U</strong>ncertainty <strong>M</strong>asked M<strong>I</strong>x-U<strong>P</strong> (ConUMIP), a novel data augmentation method operating in the representation space of continuous-time dynamic graphs. Unlike conventional techniques that perturb raw graph data, ConUMIP adaptively captures temporal evolution patterns and generates diverse augmented samples. This approach effectively mitigates overfitting while enhancing long-term dependency modeling. By eschewing predefined time windows and integrating both local and global structures, ConUMIP demonstrates superior adaptation to complex dynamic evolution patterns. Comprehensive evaluations across five real-world datasets validate ConUMIP's efficacy in substantially improving both the performance and generalizability of existing continuous-time dynamic graph models, particularly in long-term predictions and data-sparse scenarios, without incurring additional computational complexity, thus offering a robust solution to the overfitting challenge in this domain.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112748"},"PeriodicalIF":7.2,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142706020","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
CSDD-Net: A cross semi-supervised dual-feature distillation network for industrial defect detection CSDD-Net:用于工业缺陷检测的交叉半监督双特征蒸馏网络
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-13 DOI: 10.1016/j.knosys.2024.112751
Mingle Zhou , Zhanzhi Su , Min Li , Yingjie Wang , Gang Li
Detecting defects in industrial products is crucial to the strict quality control of products. Most current methods focus on supervised learning, relying on large-scale labeled samples. However, the forms of defects in industrial scenarios vary, and the data collection cost is high, which makes it difficult to meet the high requirements of massive labeled data. Therefore, we propose a Cross Semi-Supervised Dual-Feature Distillation Network (CSDD-Net), which aims to cross-use supervised and semi-supervised networks to learn rich feature representations and the distribution of large-scale features, respectively. CSDD-Net can transfer the defect feature distribution learned on partially labeled data in supervised branch to unsupervised branch, achieving simultaneous modeling and distillation based on partially labeled data. Firstly, this paper proposes a cross-local-global feature extraction network. By designing double interaction and ghost linear attention structure, it aims to force the network to be able to focus on local detail texture in global features and local features to perceive global semantics. Secondly, this paper proposes a Closed-Loop Cross-Aggregation Network (CLCA-Net), which considers deep and shallow semantics and fine-grained information. Thirdly, this paper designs a dynamic adaptive distillation loss, which could automatically adjust a more suitable regression loss function according to the defect characteristics, ensuring that the model could accurately locate and regress defects of various scales. Finally, this paper proposes a Glass Bottleneck defect dataset and verifies the feasibility of CSDD-Net in practical industrial applications. CSDD-Net achieved [email protected] of 80.41%, 76.42%, and 97.12% on the Glass Bottleneck, Wood, and Aluminum datasets with only 13.5 GFLOPs.
检测工业产品中的缺陷对于严格控制产品质量至关重要。目前大多数方法都侧重于监督学习,依赖于大规模标记样本。然而,工业场景中的缺陷形式多样,数据收集成本高,难以满足海量标注数据的高要求。因此,我们提出了交叉半监督双特征蒸馏网络(Cross Semi-Supervised Dual-Feature Distillation Network,CSDD-Net),旨在交叉使用监督网络和半监督网络,分别学习丰富的特征表征和大规模特征的分布。CSDD-Net 可以将在有监督分支中部分标注数据上学习到的缺陷特征分布转移到无监督分支中,实现基于部分标注数据的同步建模和提炼。首先,本文提出了一种跨局部-全局特征提取网络。通过设计双重交互和幽灵线性注意结构,迫使网络能够关注全局特征中的局部细节纹理,并通过局部特征感知全局语义。其次,本文提出了一种闭环交叉聚合网络(CLCA-Net),它考虑了深浅语义和细粒度信息。第三,本文设计了动态自适应蒸馏损失,可根据缺陷特征自动调整更合适的回归损失函数,确保模型能准确定位和回归各种规模的缺陷。最后,本文提出了一个玻璃瓶颈缺陷数据集,并验证了 CSDD-Net 在实际工业应用中的可行性。在玻璃瓶颈、木材和铝数据集上,CSDD-Net 仅用 13.5 GFLOPs 就实现了 80.41%、76.42% 和 97.12% 的 [email protected]。
{"title":"CSDD-Net: A cross semi-supervised dual-feature distillation network for industrial defect detection","authors":"Mingle Zhou ,&nbsp;Zhanzhi Su ,&nbsp;Min Li ,&nbsp;Yingjie Wang ,&nbsp;Gang Li","doi":"10.1016/j.knosys.2024.112751","DOIUrl":"10.1016/j.knosys.2024.112751","url":null,"abstract":"<div><div>Detecting defects in industrial products is crucial to the strict quality control of products. Most current methods focus on supervised learning, relying on large-scale labeled samples. However, the forms of defects in industrial scenarios vary, and the data collection cost is high, which makes it difficult to meet the high requirements of massive labeled data. Therefore, we propose a Cross Semi-Supervised Dual-Feature Distillation Network (CSDD-Net), which aims to cross-use supervised and semi-supervised networks to learn rich feature representations and the distribution of large-scale features, respectively. CSDD-Net can transfer the defect feature distribution learned on partially labeled data in supervised branch to unsupervised branch, achieving simultaneous modeling and distillation based on partially labeled data. Firstly, this paper proposes a cross-local-global feature extraction network. By designing double interaction and ghost linear attention structure, it aims to force the network to be able to focus on local detail texture in global features and local features to perceive global semantics. Secondly, this paper proposes a Closed-Loop Cross-Aggregation Network (CLCA-Net), which considers deep and shallow semantics and fine-grained information. Thirdly, this paper designs a dynamic adaptive distillation loss, which could automatically adjust a more suitable regression loss function according to the defect characteristics, ensuring that the model could accurately locate and regress defects of various scales. Finally, this paper proposes a Glass Bottleneck defect dataset and verifies the feasibility of CSDD-Net in practical industrial applications. CSDD-Net achieved [email protected] of 80.41%, 76.42%, and 97.12% on the Glass Bottleneck, Wood, and Aluminum datasets with only 13.5 GFLOPs.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112751"},"PeriodicalIF":7.2,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142706019","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
Multi-agent reinforcement learning with synchronized and decomposed reward automaton synthesized from reactive temporal logic 利用由反应时态逻辑合成的同步和分解奖励自动机进行多代理强化学习
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112703
Chenyang Zhu , Jinyu Zhu , Wen Si , Xueyuan Wang , Fang Wang
Multi-agent systems (MAS) consist of multiple autonomous agents interacting to achieve collective objectives. Multi-agent reinforcement learning (MARL) enhances these systems by enabling agents to learn optimal behaviors through interaction, thus improving their coordination in dynamic environments. However, MARL faces significant challenges in adapting to complex dependencies on past states and actions, which are not adequately represented by the current state alone in reactive systems. This paper addresses these challenges by considering MAS operating under task specifications formulated as Generalized Reactivity of rank 1 (GR(1)). These synthesized strategies are used as a priori knowledge to guide the learning. To tackle the difficulties of handling non-Markovian tasks in reactive systems, we propose a novel synchronized decentralized training paradigm that guides agents to learn within the MARL framework using a reward structure constructed from decomposed synthesized strategies of GR(1). We initially formalize the synthesis of GR(1) strategies as a reachability problem of winning states of the system. Subsequently, we develop a decomposition mechanism that constructs individual reward structures for decentralized MARL, incorporating potential values calculated through value iteration. Theoretical proofs are provided to verify that the safety and liveness properties are preserved. We evaluate our approach against other state-of-the-art methods under various GR(1) specifications and scenario maps, demonstrating superior learning efficacy and optimal rewards per episode. Additionally, we show that the decentralized training paradigm outperforms the centralized training paradigm. The value iteration strategy used to calculate potential values for the reward structure is compared against two other strategies, showcasing its advantages.
多代理系统(MAS)由多个自主代理组成,通过互动实现集体目标。多代理强化学习(MARL)可使代理通过互动学习最佳行为,从而改善它们在动态环境中的协调,从而增强这些系统的功能。然而,MARL 在适应过去状态和行动的复杂依赖性方面面临巨大挑战,而在反应式系统中,仅靠当前状态并不能充分体现这些依赖性。本文通过考虑在任务规范下运行的 MAS,以等级 1 的广义反应性(GR(1))来应对这些挑战。这些综合策略被用作指导学习的先验知识。为了解决在反应式系统中处理非马尔可夫任务的困难,我们提出了一种新颖的同步分散训练范式,利用由 GR(1) 的分解合成策略构建的奖励结构,指导代理在 MARL 框架内学习。我们首先将 GR(1) 策略的合成形式化为系统获胜状态的可达性问题。随后,我们开发了一种分解机制,为分散式 MARL 构建单个奖励结构,并将通过价值迭代计算出的潜在价值纳入其中。我们提供了理论证明,以验证安全性和有效性得到了保留。我们根据不同的 GR(1) 规范和场景图,对我们的方法与其他最先进的方法进行了评估,结果表明我们的方法具有更高的学习效率和每集最佳奖励。此外,我们还证明分散训练范式优于集中训练范式。我们将用于计算奖励结构潜在值的价值迭代策略与其他两种策略进行了比较,从而展示了其优势。
{"title":"Multi-agent reinforcement learning with synchronized and decomposed reward automaton synthesized from reactive temporal logic","authors":"Chenyang Zhu ,&nbsp;Jinyu Zhu ,&nbsp;Wen Si ,&nbsp;Xueyuan Wang ,&nbsp;Fang Wang","doi":"10.1016/j.knosys.2024.112703","DOIUrl":"10.1016/j.knosys.2024.112703","url":null,"abstract":"<div><div>Multi-agent systems (MAS) consist of multiple autonomous agents interacting to achieve collective objectives. Multi-agent reinforcement learning (MARL) enhances these systems by enabling agents to learn optimal behaviors through interaction, thus improving their coordination in dynamic environments. However, MARL faces significant challenges in adapting to complex dependencies on past states and actions, which are not adequately represented by the current state alone in reactive systems. This paper addresses these challenges by considering MAS operating under task specifications formulated as Generalized Reactivity of rank 1 (GR(1)). These synthesized strategies are used as a priori knowledge to guide the learning. To tackle the difficulties of handling non-Markovian tasks in reactive systems, we propose a novel synchronized decentralized training paradigm that guides agents to learn within the MARL framework using a reward structure constructed from decomposed synthesized strategies of GR(1). We initially formalize the synthesis of GR(1) strategies as a reachability problem of winning states of the system. Subsequently, we develop a decomposition mechanism that constructs individual reward structures for decentralized MARL, incorporating potential values calculated through value iteration. Theoretical proofs are provided to verify that the safety and liveness properties are preserved. We evaluate our approach against other state-of-the-art methods under various GR(1) specifications and scenario maps, demonstrating superior learning efficacy and optimal rewards per episode. Additionally, we show that the decentralized training paradigm outperforms the centralized training paradigm. The value iteration strategy used to calculate potential values for the reward structure is compared against two other strategies, showcasing its advantages.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112703"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705015","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
CESDQL: Communicative experience-sharing deep Q-learning for scalability in multi-robot collaboration with sparse reward CESDQL:在奖励稀疏的多机器人协作中利用交流经验共享深度 Q-learning 实现可扩展性
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112714
Muhammad Naveed Abbas , Paul Liston , Brian Lee , Yuansong Qiao
Owing to the massive transformation in industrial processes and logistics, warehouses are also undergoing advanced automation. The application of Autonomous Mobile Robots (a.k.a. multi-robots) is one of the important elements of overall warehousing automation. The autonomous collaborative behaviour of the multi-robots can be considered as employment on a control task and, thus, can be optimised using multi-agent reinforcement learning (MARL). Consequently, an autonomous warehouse is to be represented by an MARL environment. An MARL environment replicating an autonomous warehouse poses the challenge of exploration due to sparse reward leading to inefficient collaboration. This challenge aggravates further with an increase in the number of robots and the grid size, i.e., scalability. This research proposes Communicative Experience-Sharing Deep Q-Learning (CESDQL) based on Q-learning, a novel hybrid multi-robot communicative framework for scalability for MARL collaboration with sparse rewards, where exploration is challenging and makes collaboration difficult. CESDQL makes use of experience-sharing through collective sampling from the Experience (Replay) buffer and communication through Communicative Deep recurrent Q-network (CommDRQN), a Q-function approximator. Through empirical evaluation of CESDQL in a variety of collaborative scenarios, it is established that CESDQL outperforms the baselines in terms of convergence and stable learning. Overall, CESDQL achieves 5%, 69%, 60%, 211%, 171%, 3.8% & 10% more final accumulative training returns than the closest performing baseline by scenario, and, 27%, 10.33% & 573% more final average training returns than the closest performing baseline by the big-scale scenario.
由于工业流程和物流的巨大变革,仓库也在经历着先进的自动化。自主移动机器人(又称多机器人)的应用是整个仓储自动化的重要组成部分之一。多机器人的自主协作行为可视为对控制任务的雇佣,因此可通过多代理强化学习(MARL)进行优化。因此,自主仓库应由 MARL 环境来表示。由于奖励稀少,导致协作效率低下,复制自主仓库的 MARL 环境给探索带来了挑战。随着机器人数量和网格大小(即可扩展性)的增加,这一挑战会进一步加剧。本研究提出了基于 Q-learning 的交流经验共享深度 Q-Learning(CESDQL),这是一种新颖的混合多机器人交流框架,可扩展用于具有稀疏奖励的 MARL 协作,在这种情况下,探索具有挑战性,导致协作困难。CESDQL 通过从经验(回放)缓冲区集体采样来实现经验共享,并通过 Q 函数近似器--交流型深度递归 Q 网络(CommDRQN)来实现交流。通过在各种协作场景中对 CESDQL 进行实证评估,可以确定 CESDQL 在收敛性和稳定学习方面优于基线。总体而言,CESDQL 的最终累积训练回报率分别比不同场景下表现最接近的基线高出 5%、69%、60%、211%、171%、3.8% & 10%,而在大尺度场景下,最终平均训练回报率分别比表现最接近的基线高出 27%、10.33% & 573%。
{"title":"CESDQL: Communicative experience-sharing deep Q-learning for scalability in multi-robot collaboration with sparse reward","authors":"Muhammad Naveed Abbas ,&nbsp;Paul Liston ,&nbsp;Brian Lee ,&nbsp;Yuansong Qiao","doi":"10.1016/j.knosys.2024.112714","DOIUrl":"10.1016/j.knosys.2024.112714","url":null,"abstract":"<div><div>Owing to the massive transformation in industrial processes and logistics, warehouses are also undergoing advanced automation. The application of Autonomous Mobile Robots (a.k.a. multi-robots) is one of the important elements of overall warehousing automation. The autonomous collaborative behaviour of the multi-robots can be considered as employment on a control task and, thus, can be optimised using multi-agent reinforcement learning (MARL). Consequently, an autonomous warehouse is to be represented by an MARL environment. An MARL environment replicating an autonomous warehouse poses the challenge of exploration due to sparse reward leading to inefficient collaboration. This challenge aggravates further with an increase in the number of robots and the grid size, i.e., scalability. This research proposes <strong>C</strong>ommunicative <strong>E</strong>xperience-<strong>S</strong>haring <strong>D</strong>eep <strong>Q</strong>-<strong>L</strong>earning (CESDQL) based on Q-learning, a novel hybrid multi-robot communicative framework for scalability for MARL collaboration with sparse rewards, where exploration is challenging and makes collaboration difficult. CESDQL makes use of experience-sharing through collective sampling from the Experience (Replay) buffer and communication through Communicative Deep recurrent Q-network (CommDRQN), a Q-function approximator. Through empirical evaluation of CESDQL in a variety of collaborative scenarios, it is established that CESDQL outperforms the baselines in terms of convergence and stable learning. Overall, CESDQL achieves 5%, 69%, 60%, 211%, 171%, 3.8% &amp; 10% more final accumulative training returns than the closest performing baseline by scenario, and, 27%, 10.33% &amp; 573% more final average training returns than the closest performing baseline by the big-scale scenario.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112714"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705006","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
Boosting point cloud understanding through graph convolutional network with scale measurement and high-frequency enhancement 通过带有比例测量和高频增强功能的图卷积网络提升点云理解能力
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112715
Yun Bai , Guanlin Li , Xuchao Gong , Kuijie Zhang , Qian Xiao , Chaozhi Yang , Zongmin Li
Graph-based methods have exhibited exceptional performance in point cloud understanding by capturing local geometric relationships. However, existing approaches often struggle to characterize the overall spatial scale of local graphs. In addition, they fail to capture the differences between nodes effectively, which is crucial for distinguishing different classes. This study introduces SM-HFEGCN, a novel graph convolutional network that addresses these limitations through two key innovations: scale measurement and high-frequency enhancement. First, we introduce a spatial scale feature derived from the diagonal vectors of the neighborhood, which serves as a unique graph-specific property related to the geometry and density of the local point cloud. This feature can characterize the overall spatial scale of the local point cloud. Second, we enhance the high-frequency information to capture node variations and integrate it with smoothed information to represent the differences and similarities between nodes simultaneously. Extensive experiments demonstrate the effectiveness of SM-HFEGCN in point cloud classification and segmentation tasks.
基于图形的方法通过捕捉局部几何关系,在点云理解方面表现出卓越的性能。然而,现有的方法往往难以表征局部图的整体空间尺度。此外,它们无法有效捕捉节点之间的差异,而这种差异对于区分不同类别至关重要。本研究介绍的 SM-HFEGCN 是一种新型图卷积网络,它通过两个关键的创新来解决这些局限性:尺度测量和高频增强。首先,我们从邻域的对角向量中引入了空间尺度特征,它是与本地点云的几何形状和密度相关的独特图特定属性。该特征可以描述本地点云的整体空间尺度。其次,我们增强了捕捉节点变化的高频信息,并将其与平滑信息整合,以同时表示节点之间的差异和相似性。大量实验证明了 SM-HFEGCN 在点云分类和分割任务中的有效性。
{"title":"Boosting point cloud understanding through graph convolutional network with scale measurement and high-frequency enhancement","authors":"Yun Bai ,&nbsp;Guanlin Li ,&nbsp;Xuchao Gong ,&nbsp;Kuijie Zhang ,&nbsp;Qian Xiao ,&nbsp;Chaozhi Yang ,&nbsp;Zongmin Li","doi":"10.1016/j.knosys.2024.112715","DOIUrl":"10.1016/j.knosys.2024.112715","url":null,"abstract":"<div><div>Graph-based methods have exhibited exceptional performance in point cloud understanding by capturing local geometric relationships. However, existing approaches often struggle to characterize the overall spatial scale of local graphs. In addition, they fail to capture the differences between nodes effectively, which is crucial for distinguishing different classes. This study introduces SM-HFEGCN, a novel graph convolutional network that addresses these limitations through two key innovations: scale measurement and high-frequency enhancement. First, we introduce a spatial scale feature derived from the diagonal vectors of the neighborhood, which serves as a unique graph-specific property related to the geometry and density of the local point cloud. This feature can characterize the overall spatial scale of the local point cloud. Second, we enhance the high-frequency information to capture node variations and integrate it with smoothed information to represent the differences and similarities between nodes simultaneously. Extensive experiments demonstrate the effectiveness of SM-HFEGCN in point cloud classification and segmentation tasks.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112715"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142706024","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
FourierAugment: Frequency-based image encoding for resource-constrained vision tasks 傅立叶增强:基于频率的图像编码,用于资源受限的视觉任务
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112695
Jiae Yoon , Myeongjin Lee , Ue-Hwan Kim
Resource-constrained vision tasks, such as image classification on low-end devices, put forward significant challenges due to limited computational resources and restricted access to a vast number of training samples. Previous studies have utilized data augmentation that optimizes various image transformations to learn effective lightweight models with few data samples. However, these studies require a calibration step for optimizing data augmentation to specific scenarios or hardly exploit frequency components readily available from Fourier analysis. To address the limitations, we propose a frequency-based image encoding method, namely FourierAugment, which allows lightweight models to learn richer features with a restrained amount of data. Further, we reveal the correlations between the amount of data and frequency components lightweight models learn in the process of designing FourierAugment. Extensive experiments on multiple resource-constrained vision tasks under diverse conditions corroborate the effectiveness of the proposed FourierAugment method compared to baselines.
资源受限的视觉任务,如在低端设备上进行图像分类,由于计算资源有限且无法获得大量训练样本,因此面临着巨大的挑战。以往的研究利用数据增强技术优化各种图像变换,从而在数据样本很少的情况下学习有效的轻量级模型。但是,这些研究需要一个校准步骤,以便根据特定场景优化数据增强,或者很难利用傅立叶分析中现成的频率成分。为了解决这些局限性,我们提出了一种基于频率的图像编码方法,即傅立叶增强(FourierAugment),它允许轻量级模型利用有限的数据量学习更丰富的特征。此外,我们还揭示了轻量级模型在设计 FourierAugment 的过程中所学习的数据量和频率成分之间的相关性。在不同条件下对多个资源受限的视觉任务进行的大量实验证实,与基线方法相比,所提出的 FourierAugment 方法非常有效。
{"title":"FourierAugment: Frequency-based image encoding for resource-constrained vision tasks","authors":"Jiae Yoon ,&nbsp;Myeongjin Lee ,&nbsp;Ue-Hwan Kim","doi":"10.1016/j.knosys.2024.112695","DOIUrl":"10.1016/j.knosys.2024.112695","url":null,"abstract":"<div><div>Resource-constrained vision tasks, such as image classification on low-end devices, put forward significant challenges due to limited computational resources and restricted access to a vast number of training samples. Previous studies have utilized data augmentation that optimizes various image transformations to learn effective lightweight models with few data samples. However, these studies require a calibration step for optimizing data augmentation to specific scenarios or hardly exploit frequency components readily available from Fourier analysis. To address the limitations, we propose a frequency-based image encoding method, namely FourierAugment, which allows lightweight models to learn richer features with a restrained amount of data. Further, we reveal the correlations between the amount of data and frequency components lightweight models learn in the process of designing FourierAugment. Extensive experiments on multiple resource-constrained vision tasks under diverse conditions corroborate the effectiveness of the proposed FourierAugment method compared to baselines.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112695"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142706021","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
Bridging the gap between text-to-SQL research and real-world applications: A unified all-in-one framework for text-to-SQL 缩小文本到 SQL 研究与实际应用之间的差距:统一的文本到 SQL 一体化框架
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112697
Mirae Han , Seongsik Park , Seulgi Kim , Harksoo Kim
Existing text-to-SQL research assumes the availability of gold table when generating SQL queries. It is possible to effectively generate complex and difficult queries by leveraging information from the gold table. However, in real-world scenarios, determining which of the numerous tables in a database should be referenced is challenging. Therefore, existing models reveal a gap in achieving the core objective of practicality in text-to-SQL research. In response, we propose a practical framework that can effectively convert user questions into queries, even in scenarios where reference tables are not provided. By adding a phase to find tables, it can generate queries using only information from questions, mitigating the limitations that arise when restricting reference tables to a single one. We demonstrate that our methods are suitable for practical use in text-to-SQL systems by achieving performances comparable to those of existing models with simple structures.
现有的文本到 SQL 研究假定在生成 SQL 查询时有黄金表。通过利用黄金表中的信息,可以有效地生成复杂而困难的查询。然而,在现实世界中,确定应引用数据库中众多表中的哪些表是一项挑战。因此,现有模型在实现文本到 SQL 研究的实用性这一核心目标方面存在差距。为此,我们提出了一个实用的框架,即使在没有提供参考表的情况下,也能有效地将用户问题转化为查询。通过添加查找表的阶段,它可以仅使用问题中的信息生成查询,从而减轻了将参考表限制为单一参考表时产生的限制。我们证明了我们的方法适用于文本到 SQL 系统的实际应用,其性能可与结构简单的现有模型相媲美。
{"title":"Bridging the gap between text-to-SQL research and real-world applications: A unified all-in-one framework for text-to-SQL","authors":"Mirae Han ,&nbsp;Seongsik Park ,&nbsp;Seulgi Kim ,&nbsp;Harksoo Kim","doi":"10.1016/j.knosys.2024.112697","DOIUrl":"10.1016/j.knosys.2024.112697","url":null,"abstract":"<div><div>Existing text-to-SQL research assumes the availability of gold table when generating SQL queries. It is possible to effectively generate complex and difficult queries by leveraging information from the gold table. However, in real-world scenarios, determining which of the numerous tables in a database should be referenced is challenging. Therefore, existing models reveal a gap in achieving the core objective of <em>practicality</em> in text-to-SQL research. In response, we propose a practical framework that can effectively convert user questions into queries, even in scenarios where reference tables are not provided. By adding a phase to find tables, it can generate queries using only information from questions, mitigating the limitations that arise when restricting reference tables to a single one. We demonstrate that our methods are suitable for practical use in text-to-SQL systems by achieving performances comparable to those of existing models with simple structures.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112697"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705191","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
Advanced approach for mining utility occupancy patterns in incremental environment 在增量环境中挖掘公用设施占用模式的先进方法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-12 DOI: 10.1016/j.knosys.2024.112713
Myungha Cho , Hanju Kim , Seungwan Park , Doyoung Kim, Doyoon Kim, Unil Yun
In recent years, one of the varied fields of mining techniques that can discover valuable patterns from databases with vast amounts of data, utility pattern mining, has been studied. Besides, pattern mining techniques considering utility occupancy have been developed, considering the profit, quantity, and proportion of the pattern in transactions. However, recent pattern mining studies for utility occupancy still suffer from obtaining patterns in an incremental environment. Meanwhile, with the widespread adoption of technologies such as IoT or networks, data is rapidly generated and accumulated between devices in real time. Therefore, we suggest IUOIL (Incremental high-Utility Occupancy pattern mining with Indexed List) that discovers patterns having high utility occupancy employing an indexed list-based data structure from databases in an incremental environment. Our algorithm can obtain results by quickening the combination process for patterns using the data structure and reducing search space with three efficient pruning strategies. Performance evaluation is performed using various datasets for comparison with existing algorithms. The assessment on real datasets demonstrated that the technique extracts exact results with the fastest runtime while minimizing memory consumption. In addition, the evaluations on synthetic datasets showed that the technique discovers result set of patterns efficiently and stably as the volume of a database increases.
近年来,人们开始研究能从海量数据的数据库中发现有价值模式的各种挖掘技术之一--效用模式挖掘。此外,考虑到交易中模式的利润、数量和比例,还开发了考虑效用占用的模式挖掘技术。然而,近期针对效用占用率的模式挖掘研究仍存在在增量环境中获取模式的问题。同时,随着物联网或网络等技术的广泛应用,数据在设备间实时快速生成和积累。因此,我们提出了 IUOIL(Incremental high-Utility Occupancy Pattern mining with Indexed List)算法,利用基于索引列表的数据结构,在增量环境下从数据库中发现具有高实用占用率的模式。我们的算法可以利用数据结构加快模式的组合过程,并通过三种有效的剪枝策略减少搜索空间,从而获得结果。为了与现有算法进行比较,我们使用各种数据集进行了性能评估。对真实数据集的评估表明,该技术能以最快的运行时间提取精确结果,同时将内存消耗降至最低。此外,对合成数据集的评估表明,随着数据库容量的增加,该技术能高效、稳定地发现结果模式集。
{"title":"Advanced approach for mining utility occupancy patterns in incremental environment","authors":"Myungha Cho ,&nbsp;Hanju Kim ,&nbsp;Seungwan Park ,&nbsp;Doyoung Kim,&nbsp;Doyoon Kim,&nbsp;Unil Yun","doi":"10.1016/j.knosys.2024.112713","DOIUrl":"10.1016/j.knosys.2024.112713","url":null,"abstract":"<div><div>In recent years, one of the varied fields of mining techniques that can discover valuable patterns from databases with vast amounts of data, utility pattern mining, has been studied. Besides, pattern mining techniques considering utility occupancy have been developed, considering the profit, quantity, and proportion of the pattern in transactions. However, recent pattern mining studies for utility occupancy still suffer from obtaining patterns in an incremental environment. Meanwhile, with the widespread adoption of technologies such as IoT or networks, data is rapidly generated and accumulated between devices in real time. Therefore, we suggest IUOIL (Incremental high-Utility Occupancy pattern mining with Indexed List) that discovers patterns having high utility occupancy employing an indexed list-based data structure from databases in an incremental environment. Our algorithm can obtain results by quickening the combination process for patterns using the data structure and reducing search space with three efficient pruning strategies. Performance evaluation is performed using various datasets for comparison with existing algorithms. The assessment on real datasets demonstrated that the technique extracts exact results with the fastest runtime while minimizing memory consumption. In addition, the evaluations on synthetic datasets showed that the technique discovers result set of patterns efficiently and stably as the volume of a database increases.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112713"},"PeriodicalIF":7.2,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705187","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
DRN-DSA: A hybrid deep learning network model for precipitation nowcasting using time series data DRN-DSA:利用时间序列数据进行降水预报的混合深度学习网络模型
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-10 DOI: 10.1016/j.knosys.2024.112679
Gujanatti Rudrappa , Nataraj Vijapur
Precipitation nowcasting involves short-term weather forecasting, predicting rain or snow within the next two hours. By analyzing current atmospheric conditions, it aids meteorologists in identifying weather patterns and preparing for severe events such as flooding. These nowcasts are typically displayed on geographical maps by weather services. However, the rapidly changing climate conditions make precipitation nowcasting a formidable challenge, as accurate short-term forecasts are hindered by immediate weather fluctuations. Traditional nowcasting methods, like numerical models and radar extrapolation, have limitations in delivering highly detailed and timely precipitation nowcasts. To overcome this issue, an effective solution is framed for precipitation nowcasting using a hybrid network approach named Deep Residual Network-Deep Stacked Autoencoder (DRN-DSA). Initially, the input time series data is acquired from the dataset. Thereafter, the effective technical indicators are extracted at the feature extraction stage. Later on, precipitation-type nowcasting is carried out using the proposed hybrid DRN-DSA, which is developed by incorporating a Deep Stacked Autoencoder (DSA) and Deep Residual Network (DRN). Finally, Weather nowcasting is carried out using the same proposed hybrid DSA-DRN. Moreover, when compared to other traditional models, the proposed DRN-DSA has gained superior results with a Relative Absolute Error (RAE) of 0.295, Root Mean Square Error (RMSE) of 0.154, low Mean Square Error (MSE) of 0.0236, Mean Absolute Percentage Error (MAPE) of 0.295, and False Acceptance Rate (FAR) of 0.0118.
降水预报涉及短期天气预报,预测未来两小时内的雨雪天气。通过分析当前的大气条件,它可以帮助气象学家确定天气模式,并为洪水等严重事件做好准备。气象服务机构通常会在地理地图上显示这些即时预报。然而,瞬息万变的气候条件使降水预报成为一项艰巨的挑战,因为准确的短期预报会受到即时天气波动的影响。传统的降水预报方法,如数值模式和雷达推断,在提供高度详细和及时的降水预报方面存在局限性。为了克服这一问题,我们利用一种名为 "深度残差网络-深度叠加自动编码器(DRN-DSA)"的混合网络方法,为降水预报提出了一个有效的解决方案。首先,从数据集中获取输入时间序列数据。然后,在特征提取阶段提取有效的技术指标。随后,使用所提出的混合 DRN-DSA 进行降水类型预报,该方法是通过结合深度堆叠自动编码器(DSA)和深度残差网络(DRN)而开发的。最后,使用相同的混合 DSA-DRN 进行天气预报。此外,与其他传统模型相比,所提出的 DRN-DSA 获得了优异的结果,其相对绝对误差 (RAE) 为 0.295,均方根误差 (RMSE) 为 0.154,均方误差 (MSE) 为 0.0236,平均绝对百分比误差 (MAPE) 为 0.295,错误接受率 (FAR) 为 0.0118。
{"title":"DRN-DSA: A hybrid deep learning network model for precipitation nowcasting using time series data","authors":"Gujanatti Rudrappa ,&nbsp;Nataraj Vijapur","doi":"10.1016/j.knosys.2024.112679","DOIUrl":"10.1016/j.knosys.2024.112679","url":null,"abstract":"<div><div>Precipitation nowcasting involves short-term weather forecasting, predicting rain or snow within the next two hours. By analyzing current atmospheric conditions, it aids meteorologists in identifying weather patterns and preparing for severe events such as flooding. These nowcasts are typically displayed on geographical maps by weather services. However, the rapidly changing climate conditions make precipitation nowcasting a formidable challenge, as accurate short-term forecasts are hindered by immediate weather fluctuations. Traditional nowcasting methods, like numerical models and radar extrapolation, have limitations in delivering highly detailed and timely precipitation nowcasts. To overcome this issue, an effective solution is framed for precipitation nowcasting using a hybrid network approach named Deep Residual Network-Deep Stacked Autoencoder (DRN-DSA). Initially, the input time series data is acquired from the dataset. Thereafter, the effective technical indicators are extracted at the feature extraction stage. Later on, precipitation-type nowcasting is carried out using the proposed hybrid DRN-DSA, which is developed by incorporating a Deep Stacked Autoencoder (DSA) and Deep Residual Network (DRN). Finally, Weather nowcasting is carried out using the same proposed hybrid DSA-DRN. Moreover, when compared to other traditional models, the proposed DRN-DSA has gained superior results with a Relative Absolute Error (RAE) of 0.295, Root Mean Square Error (RMSE) of 0.154, low Mean Square Error (MSE) of 0.0236, Mean Absolute Percentage Error (MAPE) of 0.295, and False Acceptance Rate (FAR) of 0.0118.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112679"},"PeriodicalIF":7.2,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142706016","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
Fitness and historical success information-assisted binary particle swarm optimization for feature selection 用于特征选择的适合度和历史成功信息辅助二元粒子群优化法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-10 DOI: 10.1016/j.knosys.2024.112699
Shubham Gupta, Saurabh Gupta
Feature selection is a critical preprocessing step in machine learning aimed at identifying the most relevant features or variables from a dataset. Although conventional particle swarm optimization (PSO) has shown efficiency for feature selection tasks, developing an effective PSO algorithm for this task is still challenging. This study proposes a fitness and historical success information-assisted binary particle swarm optimization, denoted by FPSO. The FPSO is developed by integrating different search strategies, including a weighted center-based approach, historical information-based acceleration coefficients, and selection operation. These strategies are embedded into the FPSO to enhance the levels of exploration and exploitation based on the fitness value of particles and their historical search status. In the FPSO, the transfer function is also added to transform the continuous search space into binary search space. Experimental validation and comparison with seven other metaheuristic algorithms on 24 datasets verify the effectiveness of the FPSO in eliminating irrelevant and redundant features.
特征选择是机器学习中一个关键的预处理步骤,目的是从数据集中识别出最相关的特征或变量。虽然传统的粒子群优化(PSO)在特征选择任务中表现出了高效性,但为这一任务开发有效的 PSO 算法仍具有挑战性。本研究提出了一种适应度和历史成功信息辅助的二元粒子群优化算法,简称 FPSO。FPSO 融合了不同的搜索策略,包括基于加权中心的方法、基于历史信息的加速系数和选择操作。这些策略被嵌入到 FPSO 中,以根据粒子的适应度值及其历史搜索状态提高探索和利用水平。在 FPSO 中,还加入了转移函数,将连续搜索空间转化为二进制搜索空间。在 24 个数据集上进行的实验验证以及与其他七种元搜索算法的比较验证了 FPSO 在消除无关和冗余特征方面的有效性。
{"title":"Fitness and historical success information-assisted binary particle swarm optimization for feature selection","authors":"Shubham Gupta,&nbsp;Saurabh Gupta","doi":"10.1016/j.knosys.2024.112699","DOIUrl":"10.1016/j.knosys.2024.112699","url":null,"abstract":"<div><div>Feature selection is a critical preprocessing step in machine learning aimed at identifying the most relevant features or variables from a dataset. Although conventional particle swarm optimization (PSO) has shown efficiency for feature selection tasks, developing an effective PSO algorithm for this task is still challenging. This study proposes a fitness and historical success information-assisted binary particle swarm optimization, denoted by FPSO. The FPSO is developed by integrating different search strategies, including a weighted center-based approach, historical information-based acceleration coefficients, and selection operation. These strategies are embedded into the FPSO to enhance the levels of exploration and exploitation based on the fitness value of particles and their historical search status. In the FPSO, the transfer function is also added to transform the continuous search space into binary search space. Experimental validation and comparison with seven other metaheuristic algorithms on 24 datasets verify the effectiveness of the FPSO in eliminating irrelevant and redundant features.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112699"},"PeriodicalIF":7.2,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705190","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
期刊
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