检索结果-内蒙古大学图书馆

2023 IEEE Applied Imagery Pattern Recognition Workshop, aiPR 2023

作者： Murugadoss, Bhuvanashree Amudha, J. Sugumaran, Vijayan Amrita Vishwa Vidyapeetham School of Computing Department of Computer Science and Engineering Karnataka Bengaluru India Oakland University Center for Data Science and Big Data Analytics RochesterMI United States Oakland University Department of Decision and Information Sciences RochesterMI United States

ISBN: (纸本)9798350359527

Automated radiotherapy treatment planning aims to improve treatment accuracy and efficiency. However, the prevalent Knowledge-Based Planning (KBP) method faces issues like lengthy manual problem formulation and challenges in accurately modeling human anatomy and processing high-dimensional data. This work focuses on treatment plan optimization and considers deep learning as a potential solution. Deep learning algorithms, by virtue of their ability to learn from large quantities of data and model complex relationships, can automate the formulation of the optimization problem in KBP, saving significant time and effort. However, despite these compelling advantages, it should be noted that the current convolution-based encoder-decoder models used for radiotherapy treatment plan optimization have a limited capability in capturing long-range dependencies between distant voxels. This work aims to introduce 'DE-ConvGraph 3D UNet', a novel deep learning model, to address these limitations and optimize radiotherapy treatment plans for oropharyngeal cancer. The proposed 'DE-ConvGraph 3D UNet' model includes a Graph Convolutional Network (GCN) component to capture long-range dependencies between distant voxels. Furthermore, the dual-encoder structure of the model combines the strengths of GCN and 3D Convolutional U-Net, enabling global relationships and local pattern capturing in a 3D patient volume. Experiments were conducted using the benchmark dataset-OpenKBP-Opt. The proposed model shows improvements in performance in comparison to state-of-The-Art U-Net variants in terms of mean squared voxel-wise error, dose volume histogram points and clinical criteria satisfaction. © 2023 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Temporal Group Attention Network with Affective Complementary Learning for Gait Emotion Recognition

Temporal Group Attention Network with Affective Complementar...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhu, Ziyi Chen, C. L. Philip Liu, Haiqi Zhang, Tong School of Computer Science and Engineering South China University of Technology Guangzhou China Pazhou Lab Guangzhou China Guangdong Provincial Key Laboratory of Computational Ai Models and Cognitive Intelligence China Engineering Research Center of the Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human China

ISBN: (纸本)9798350386226

Skeleton-based methods in Gait Emotion Recognition (GER) that abstract gait as a spatial-temporal graph in a non-Euclidean space have achieved remarkable success. However, existing studies neglect capturing crucial spatial-temporal implicit dependencies and make insufficient use of manually crafted affective complementary information. In this paper, we propose a novel Temporal Group Attention Network with Affective Complementary Learning (T2A). Specifically, we propose a Temporal Group Attention (TGA) module, which captures spatial-temporal implicit dependencies and crucial features across space-time. Moreover, we design an affective complementary learning strategy, which first introduces an Affective Denoising (AD) module to reduce the impact of noise in weak emotion-related information and learn augmented affective features. Then, we adopt a decision-level fusion of the denoised affective features with the deep skeleton features to compensate for the discrepancies between different feature spaces. Experimental results on Emotion-Gait and EMOGaiT demonstrate that our proposed method significantly outperforms state-of-the-art methods. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Expedited Block Transmission in Blockchain Network by using Clusters

Expedited Block Transmission in Blockchain Network by using ...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Hua, Xiaoqi Chen, Jian Zhang, Peiyun Fu, Zhangjie Zhu, Haibin Lu, Kezhong Ren, Jigang School of Software Nanjing University of Information Science and Technology Nanjing210044 China Engineering Research Center of Digital Forensics of Ministry of Education The School of Computer Science Nanjing University of Information Science and Technology Nanjing210044 China School of Computer Science Nanjing University of Information Science and Technology Nanjing210044 China Nipissing University Department of Computer Science and Mathematics North BayONP1B 8L7 Canada School of Big Data and Artificial Intelligence Chizhou University Chizhou247000 China

ISBN: (纸本)9781665410205

Blockchain technology has garnered increasing attention from researchers. Because blockchain systems may contain malicious or spatially limited nodes that may delay block verification and reduce block transmission rate, this work proposes a block transmission model by designing and using special clusters. This work proposes the cluster formation and selection mechanisms. Nodes are grouped into clusters in a blockchain, and clusters with high fitness values are chosen to transmit blocks by calculating their trust values and block transmission rates. The proposed method is compared with the peers: Layer-Chain, BlockP2P-EP and RNS. According to experimental findings, the proposed method is superior to its peers regarding the time needed for block synchronization and transmission, block occupation storage ratio, transaction throughput, and block transmission success ratio. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Enhancing malware detection performance: leveraging K-Nearest Neighbors with Firefly Optimization Algorithm

引用

Multimedia Tools and Applications 2025年第12期84卷 10071-10094页

作者： Al Saaidah, Adeeb Abualhaj, Mosleh M. Shambour, Qusai Y. Abu-Shareha, Ahmad Adel Abualigah, Laith Al-Khatib, Sumaya N. Alraba’nah, Yousef H Department of Networks and Cybersecurity Al-Ahliyya Amman University Amman Jordan Department of Software Engineering Al-Ahliyya Amman University Amman Jordan Department of Data Science and Artificial Intelligence Al-Ahliyya Amman University Amman Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Research Center University of Tabuk Tabuk71491 Saudi Arabia MEU Research Unit Middle East University Amman11831 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon College of Engineering Yuan Ze University Taoyuan32003 Taiwan Applied Science Research Center Applied Science Private University Amman11931 Jordan School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia

Malware detection plays a crucial role in ensuring robust cybersecurity amidst the ever-evolving cyber threats. This research paper delves into the realm of machine learning (ML) algorithms for malware detection, with a specific emphasis on the K-Nearest Neighbors (KNN) algorithm, utilizing tailored parameter settings and the Firefly Optimization Algorithm (FOA). The study leverages the MalMem-2022 dataset to assess the efficacy of KNN and KNN with FOA in malware detection. The impact of parameter tuning and feature selection on classification is elucidated by comparing the performance of both approaches. Encouragingly, the results reveal promising advancements in one of the multiclass classification scenarios when employing KNN with FOA, yielding noteworthy enhancements in Accuracy, Recall, Precision, Matthews Correlation Coefficient, TNR, and F1-score by 2.65%, 2.65%, 2.47%, 3.59%, 0.17%, and 2.61%, respectively. These findings accentuate the significance of optimizing KNN’s parameters and implementing FOA for feature selection, culminating in heightened accuracy in malware detection. The symbiotic fusion of KNN and FOA exhibits remarkable effectiveness in augmenting the classification model’s performance, thus offering valuable insights for bolstering cybersecurity measures. Adopting ML algorithms, particularly KNN with specific parameter settings and FOA, presents a promising avenue for enhancing malware detection capabilities. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store on Disaggregated Memory

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store...

引用

2024 IEEE International Conference on Cluster Computing, CLUSTER 2024

作者： Du, Jingwen Wang, Fang Feng, Dan Zeng, Dexin Yi, Sheng Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350358711

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores. © 2024 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Causal discovery with endogenous context variables 24

Causal discovery with endogenous context variables

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Wiebke Günther Oana-Iuliana Popescu Martin Rabel Urmi Ninad Andreas Gerhardus Jakob Runge German Aerospace Center (DLR) Institute of Data Science Jena Germany and Technische Universität Berlin Institute of Computer Engineering and Microelectronics Berlin Germany German Aerospace Center (DLR) Institute of Data Science Jena Germany and Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig Germany and Technische Universität Dresden Faculty of Computer Science Dresden Germany German Aerospace Center (DLR) Institute of Data Science Jena Germany German Aerospace Center (DLR) Institute of Data Science Jena Germany and Technische Universität Berlin Institute of Computer Engineering and Microelectronics Berlin Germany and Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig Germany and Technische Universität Dresden Faculty of Computer Science Dresden Germany

ISBN: (纸本)9798331314385

Causal systems often exhibit variations of the underlying causal mechanisms between the variables of the system. Often, these changes are driven by different environments or internal states in which the system operates, and we refer to context variables as those variables that indicate this change in causal mechanisms. An example are the causal relations in soil moisture-temperature interactions and their dependence on soil moisture regimes: Dry soil triggers a dependence of soil moisture on latent heat, while environments with wet soil do not feature such a feedback, making it a context-specific property. Crucially, a regime or context variable such as soil moisture need not be exogenous and can be influenced by the dynamical system variables - precipitation can make a dry soil wet - leading to joint systems with endogenous context variables. In this work we investigate the assumptions for constraint-based causal discovery of context-specific information in systems with endogenous context variables. We show that naive approaches such as learning different regime graphs on masked data, or pooling all data, can lead to uninformative results. We propose an adaptive constraint-based discovery algorithm and give a detailed discussion on the connection to structural causal models, including sufficiency assumptions, which allow to prove the soundness of our algorithm and to interpret the results causally. Numerical experiments demonstrate the performance of the proposed method over alternative baselines, but they also unveil current limitations of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Representation with Minimized Max-Error in Optimal Piecewise Linear Approximation of Time Series data 25th

Representation with Minimized Max-Error in Optimal Piecewi...

引用

25th International Conference on Web Information Systems engineering, WISE 2024

作者： Zhao, Huanyu Li, Tongliang Wen, Shiting Shu, Zhenyu Deng, Ke Yang, Jian Pang, Chaoyi School of Computer Science and Technology Donghua University Shanghai China Institute of Applied Mathematics Hebei Academy of Sciences Shijiazhuang China Hebei Authentication Technology Engineering Research Center Shijiazhuang China Institute of Biology Hebei Academy of Sciences Shijiazhuang China School of Computer and Data Engineering NingboTech University Ningbo China RMIT University Melbourne Australia Macquarie University Sydney Australia

ISBN: (纸本)9789819605781

In the past two decades, Piecewise Linear Approximation under maximum error (max-error) bound (PLA∞) has been intensively studied for effective qualified representation and analysis of time series data. It divides a time series into fragments and then represents each fragment with a straight line to approximate the data points of that time slot. In this paper, to elevate the representation quality in the optimal PLA∞ results, we present a linear-time algorithm FindMin to construct the unique line representative of minimized maximum error (min-max error) for each fragment. Through extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution and achieves better performances than the state-of-the-art solutions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

RETIA: Relation-Entity Twin-Interact Aggregation for Temporal Knowledge Graph Extrapolation 39

RETIA: Relation-Entity Twin-Interact Aggregation for Tempora...

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Liu, Kangzheng Zhao, Feng Xu, Guandong Wang, Xianzhi Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China University of Technology Sydney Data Science and Machine Intelligence Lab Sydney Australia

ISBN: (纸本)9798350322279

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations;therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands"problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA. © 2023 IEEE.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Key Clues Guided Video Character Social Relationship Recognition Enhanced by LLM

Key Clues Guided Video Character Social Relationship Recogni...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Dong, Wenlong Zhu, Qing Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (纸本)9798350368741

Video Character Social Relationship Recognition (VCSRR) requires a comprehensive consideration about spatio-temporal and multi-modal clues in videos. Most existing methods mainly focus on integrating multi-modal clues and modeling interactions among characters. However, they fail to discover key clues in the complex video data or fully understand the clues related to social relationships. In this article, we propose a novel Large Language Model Enhanced Key Clues Selection (LEKCS) framework to address the aforementioned issues. The core of LE-KCS is to mine multi-scale key clues from the perspectives of time, space and multi-modality, then transfer the knowledge about social relationships of the Large Language Model to VCSRR for understanding the selected clues. We evaluated LEKCS on the MovieGraphs dataset and the experimental results indicate that our proposed LE-KCS achieves state-of-the-art performance. © 2025 IEEE.

关键词： large language model Social relationship recognition video understanding

来源：评论

学校读者我要写书评

暂无评论

MOKD: Cross-domain Finetuning for Few-shot Classification via Maximizing Optimized Kernel Dependence 41

MOKD: Cross-domain Finetuning for Few-shot Classification vi...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Tian, Hongduan Liu, Feng Liu, Tongliang Du, Bo Cheung, Yiu-Ming Han, Bo TMLR Group Hong Kong Baptist University Hong Kong Department of Computer Science Hong Kong Baptist University Hong Kong TMLR Group University of Melbourne Australia Sydney AI Centre The University of Sydney Australia National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Wuhan Univeristy China

In cross-domain few-shot classification, nearest centroid classifier (NCC) aims to learn representations to construct a metric space where few-shot classification can be performed by measuring the similarities between samples and the prototype of each class. An intuition behind NCC is that each sample is pulled closer to the class centroid it belongs to while pushed away from those of other classes. However, in this paper, we find that there exist high similarities between NCC-learned representations of two samples from different classes. In order to address this problem, we propose a bi-level optimization framework, maximizing optimized kernel dependence (MOKD) to learn a set of class-specific representations that match the cluster structures indicated by labeled data of the given task. Specifically, MOKD first optimizes the kernel adopted in Hilbert-Schmidt independence criterion (HSIC) to obtain the optimized kernel HSIC (opt-HSIC) that can capture the dependence more precisely. Then, an optimization problem regarding the opt-HSIC is addressed to simultaneously maximize the dependence between representations and labels and minimize the dependence among all samples. Extensive experiments on Meta-dataset demonstrate that MOKD can not only achieve better generalization performance on unseen domains in most cases but also learn better data representation clusters. The project repository of MOKD is available at: https://***/tmlr-group/MOKD. Copyright 2024 by the author(s)

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：