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

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Task Delay and Energy Consumption Minimization for Low-altitude MEC via Evolutionary Multi-objective Deep Reinforcement Learning

arXiv

引用

arXiv 2025年

作者： Sun, Geng Ma, Weilong Li, Jiahui Sun, Zemin Wang, Jiacheng Niyato, Dusit Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Software Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation (6G) era, UAV-assisted mobile edge computing (MEC) is particularly crucial in challenging environments such as mountainous or disaster-stricken areas. The computation task offloading problem is one of the key issues in UAV-assisted MEC, primarily addressing the trade-off between minimizing the task delay and the energy consumption of the UAV. In this paper, we consider a UAV-assisted MEC system where the UAV carries the edge servers to facilitate task offloading for ground devices (GDs), and formulate a calculation delay and energy consumption multi-objective optimization problem (CDECMOP) to simultaneously improve the performance and reduce the cost of the system. Then, by modeling the formulated problem as a multi-objective Markov decision process (MOMDP), we propose a multi-objective deep reinforcement learning (DRL) algorithm within an evolutionary framework to dynamically adjust the weights and obtain non-dominated policies. Moreover, to ensure stable convergence and improve performance, we incorporate a target distribution learning (TDL) algorithm. Simulation results demonstrate that the proposed algorithm can better balance multiple optimization objectives and obtain superior non-dominated solutions compared to other methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Hypernode: Entity Fusion for data Traceability and Link Prediction

Hypernode: Entity Fusion for Data Traceability and Link Pred...

引用

IEEE International Conference on data Mining (ICDM)

作者： Bingbing Dong Zan Zhang Jiao Li Yi Zhu Chenyang Bu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Institute of Big Knowledge Science Hefei University of Technology Hefei China School of Information Engineering Yangzhou University Yangzhou China

In the era of big data, fragmented knowledge, multisource heterogeneity, and different representation forms of the same entities in various data sources have posed considerable challenges to entity fusion. How to effectively integrate multisource knowledge for the same entities has provoked vast amounts of attention and research from multiple disciplines. Most existing methods for entity fusion can be categorized into two classes: one is to establish an association between the same entities, and the other is to delete duplicate entities after knowledge fusion and create a new fusion entity. However, in these two classes of methods, the former does not achieve true knowledge fusion and semantic interoperability, while the latter may cause irreversible loss of original information. In this paper, we propose a novel entity fusion scheme: Hypernode. Hypernode fuses the same entity in different data sources into a new entity while retaining the original data. We verify the effectiveness of Hypernode on multiple models of link prediction experiments. Several practical application cases illustrate the applicability of Hypernode in data traceability, open domain knowledge fusion, and multi-modal knowledge graph fusion.

关键词： Fuses Soft sensors Semantics Predictive models Big data Cognition data mining

来源：评论

学校读者我要写书评

暂无评论

Hybrid Local Causal Discovery

arXiv

引用

arXiv 2024年

作者： Ling, Zhaolong Peng, Honghui Zhang, Yiwen Zhou, Peng Wu, Xingyu Yu, Kui Wu, Xindong School of Computer Science and Technology Anhui University Anhui Hefei230601 China School of Hong Kong Polytechnic University Department of Computing 999077 Hong Kong Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LQR Control Method based on Improved Antlion Algorithm

LQR Control Method based on Improved Antlion Algorithm

引用

第42届中国控制会议

作者： Zhe Sun Zhi Wen Lei Xu Guangfu Gong Xiangpeng Xie Zhixin Sun Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and Telecommunications

In the face of the increasing demand of crane transportation speed and stability,an improved Ant-lion algorithm is proposed in this *** the original basis,the quasi-reverse learning method is used to improve the stability of the algorithm and make the initial data distributed ***,an elite ant-lion growth mechanism is introduced to accelerate the convergence speed of the simulation and improve the simulation ***,the proposed algorithm is verified in the double pendulum system of crane based on LQR controller,and the feasibility and effectiveness of the proposed algorithm are proved by experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Deep Feature Surgery: Towards Accurate and Efficient Multi-Exit Networks

arXiv

引用

arXiv 2024年

作者： Gong, Cheng Chen, Yao Luo, Qiuyang Lu, Ye Li, Tao Zhang, Yuzhi Sun, Yufei Zhang, Le College of Software Nankai University China College of Computer Science Nankai University China National University of Singapore Singapore School of Information and Communication Engineering University of Electronic Science and Technology of China China HAIHE Lab of ITAI China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education

Multi-exit network is a promising architecture for efficient model inference by sharing backbone networks and weights among multiple exits. However, the gradient conflict of the shared weights results in sub-optimal accuracy. This paper introduces Deep Feature Surgery (DFS), which consists of feature partitioning and feature referencing approaches to resolve gradient conflict issues during the training of multi-exit networks. The feature partitioning separates shared features along the depth axis among all exits to alleviate gradient conflict while simultaneously promoting joint optimization for each exit. Subsequently, feature referencing enhances multi-scale features for distinct exits across varying depths to improve the model accuracy. Furthermore, DFS reduces the training operations with the reduced complexity of backpropagation. Experimental results on Cifar100 and ImageNet datasets exhibit that DFS provides up to a 50.00% reduction in training time and attains up to a 6.94% enhancement in accuracy when contrasted with baseline methods across diverse models and tasks. Budgeted batch classification evaluation on MSDNet demonstrates that DFS uses about 2× fewer average FLOPs per image to achieve the same classification accuracy as baseline methods on Cifar100. The code is available at https: //***/GongCheng1919/dfs. Copyright © 2024, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Threshold distribution of equal states for quantitative amplitude fluctuations

arXiv

引用

arXiv 2023年

作者： Yao, Wenpo Yao, Wenli Wang, Jun School of Geographic and Biologic Information Smart Health Big Data Analysis and Location Services Engineering Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing210023 China Ministry of Education State Key Laboratory of Hydroscience and Engineering Tsinghua University Beijing100084 China

Objective. The distribution of equal states (DES) quantifies amplitude fluctuations in biomedical signals. However, under certain conditions, such as a high resolution of data collection or special signal processing techniques, equal states may be very rare, whereupon the DES fails to measure the amplitude fluctuations. Approach. To address this problem, we develop a novel threshold DES (tDES) that measures the distribution of differential states within a threshold. To evaluate the proposed tDES, we first analyze five sets of synthetic signals generated in different frequency bands. We then analyze sleep electroencephalography (EEG) datasets taken from the public PhysioNet. Main results. Synthetic signals and detrend-filtered sleep EEGs have no neighboring equal values;however, tDES can effectively measure the amplitude fluctuations within these data. The tDES of EEG data increases significantly as the sleep stage increases, even with datasets covering very short periods, indicating decreased amplitude fluctuations in sleep EEGs. Generally speaking, the presence of more low-frequency components in a physiological series reflects smaller amplitude fluctuations and larger DES. *** tDES provides a reliable computing method for quantifying amplitude fluctuations, exhibiting the characteristics of conceptual simplicity and computational robustness. Our findings broaden the application of quantitative amplitude fluctuations and contribute to the classification of sleep stages based on EEG data. © 2023, CC0.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Meta-path Enhanced knowledge Graph Convolutional Network for Recommender Systems

Meta-path Enhanced Knowledge Graph Convolutional Network for...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Ru Wang Meng Wu Shengwei Ji Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781665438599

knowledge Graph (KG) is a directed heterogeneous information network that contains a large number of entities and relations, which is widely used as effective side information in rec-ommender systems. Moreover, in recommender systems, the Graph Convolutional Network (GCN) model is introduced to mine the relatedness between entities in a KG because of its efficiency in extracting spatial features on topological graphs. The knowledge Graph Convolutional Network (KGCN) model up-dates the embedding of a currently positioned entity by aggregating the information of adjacent entities selected randomly. Never-theless, it has two limititations: 1) the information of neighbors se-lected randomly cannot accurately represent the current entity in the KG; 2) the model is hard to converge as graph features (i.e. The spatial relation features and semantic information features of en-tities in the KG) grow. To solve these limitations, in this paper, a meta-path (i.e., a sequence of artificially constructed relationships) is introduced into the selection of neighbors in the KGCN model to enhance the representation of each entity. Furthermore, two construction methods of the meta-path - constructing a meta-path based on the same relation (KGCN-SP) and the characteris-tics of KG (KGCN-MP) -are proposed. The experiments based on three real-world datasets demonstrate that the neighbor selection based on the meta-path is able to collect more accurate infor-mation from a KG and improve the recommendation performance effectively.

关键词： knowledge engineering Adaptation models Computational modeling Semantics Diversity reception Feature extraction data models

来源：评论

学校读者我要写书评

暂无评论

BERT-INT: A BERT-based interaction model for knowledge graph alignment 29

BERT-INT: A BERT-based interaction model for knowledge graph...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Tang, Xiaobin Zhang, Jing Chen, Bo Yang, Yang Chen, Hong Li, Cuiping Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China China Information School Renmin University of China China Zhejiang University China

ISBN: (纸本)9780999241165

knowledge graph alignment aims to link equivalent entities across different knowledge graphs. To utilize both the graph structures and the side information such as name, description and attributes, most of the works propagate the side information especially names through linked entities by graph neural networks. However, due to the heterogeneity of different knowledge graphs, the alignment accuracy will be suffered from aggregating different neighbors. This work presents an interaction model to only leverage the side information. Instead of aggregating neighbors, we compute the interactions between neighbors which can capture fine-grained matches of neighbors. Similarly, the interactions of attributes are also modeled. Experimental results show that our model significantly outperforms the best state-of-the-art methods by 1.9-9.7% in terms of HitRatio@1 on the dataset DBP15K. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：