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

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiulin Zheng Zan Zhang Rui Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) and also with the School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Inspur Academy of Science and Technology Shandong China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

knowledge graphs (KGs) play an increasingly im-portant role in many knowledge-aware tasks. However, existing KGs are struggle with incompleteness, which motivates knowledge graph completion (KGC), that is, predicting the lost links between entities based on observed triples. Reasoning over relation paths in incomplete KGs is popular. Nonetheless, some significant issues are still remained to be addressed, such as path noise and ambiguity of inferred relation. To address these problems, we propose a novel path augmented _Reasoning model with avoidance of Path noise and Disambiguation of inferred relation in this paper, referred to as RPD. In this model, we calculate the sum of resource allocation for each relation path to measure its reliability to avoid the inference of path noise. To address the ambiguity of an inferred relation, we introduce position embedding to denote the relation position along the path when learning path representation. Extensive experiments conducted on benchmark datasets demonstrate the effectiveness of our proposal RPD model in the handling of KGC tasks compared to SOTAs.

关键词： Heavily-tailed distribution Noise knowledge graphs Benchmark testing Transformers Cognition Reliability Resource management Proposals Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Detecting the research diversity of researchers in library and information science:An exploratory study

引用

data Science and Informetrics 2022年第3期2卷 22-36页

作者： Yuehua Zhao Sicheng Zhu Jie Wu Hao Wang Sanhong Deng Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing UniversityNanjingChina School of Information Management Nanjing UniversityNanjingChina

Metrics have emerged as an important tool for quantitatively evaluating researchers from a variety of perspectives,including research impact,research quality,interdisciplinarity,and *** in the field of library and information science,many previous studies have highlighted the characteristics of researchers in this ***,only a minority of the studies address the aspect of diversity in research *** purpose of this study is to(1)evaluate the topic diversity of researchers in library and information science and(2)examine the relationships between the researcher topic diversity and research *** propose an indicator to quantify author topic diversity,which we refer to as author topic diversity(ATD).Latent Dirichlet Allocation(LDA)is used to detect topics in the field,while cosine similarity is used to calculate the diversity of research topics in a given researcher’s *** results show that topic diversity in the field of library and information science varies greatly from author to *** addition,weak positive correlations are found between the ATD and citation indicators,suggesting that engaging in diversified topics may lead to higher research impact.

关键词： Research diversity Research evaluation Library and information science

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Design Method Based on Case-based Reasoning and Reinforcement Learning

An Intelligent Design Method Based on Case-based Reasoning a...

引用

IEEE International Conference on Industrial engineering and engineering Management

作者： Yu Huang Ru Wang Zhuqin Wei Guoxin Wang Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology School of Machanical Engineering Beijing Institute of Technology Beijing China

Enterprises currently face the challenge of reducing production cycles and costs and utilizing existing cases for making changes and iterations has emerged as a viable solution. However, the acquisition and modification of historical cases present their challenges. To address this, the present paper proposes an intelligent design method based on reinforcement learning that aims to meet the demand for efficient and high-quality design solutions in the field of engineering design. This method comprises four key steps: case characterization, matching, retrieval, and selection. By employing case characterization and matching, users can acquire sets of similar cases that align closely with their specific requirements. Building upon this foundation incorporates a combination of reinforcement learning and weight order cross-reconstruction to generate more proposals. Subsequently, the multi-attribute decision-making method is utilized to select the extended set of design schemes. The effectiveness of the proposed method is demonstrated through its successful application to a radar design case.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted Joint Mobile Edge Computing and data Collection via Matching-Enabled Deep Reinforcement Learning

引用

IEEE Internet of Things Journal 2025年

作者： Wang, Boxiong Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) and data collection (DC) have been popular research issues. Different from existing works that consider MEC and DC scenarios separately, this paper investigates a multi-UAV-assisted joint MEC-DC system. Specifically, we formulate a joint optimization problem to minimize the MEC latency and maximize the collected data volume. This problem can be classified as a non-convex mixed integer programming problem that exhibits long-term optimization and dynamics. Thus, we propose a deep reinforcement learning-based approach that jointly optimizes the UAV movement, user transmit power, and user association in real time to solve the problem efficiently. Specifically, we reformulate the optimization problem into an action space-reduced Markov decision process (MDP) and optimize the user association by using a two-phase matching-based association (TMA) strategy. Subsequently, we propose a soft actor-critic (SAC)-based approach that integrates the proposed TMA strategy (SAC-TMA) to solve the formulated joint optimization problem collaboratively. Simulation results demonstrate that the proposed SAC-TMA is able to coordinate the two subsystems and can effectively reduce the system latency and improve the data collection volume compared with other benchmark algorithms. © 2025 IEEE. All rights reserved,

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Internet of Things Journal 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO-LSTM method effectively mitigates hot spot problems and offers superior performance compared to traditional strategies. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Bilingual Lexicon Induction Method for Distant Language Pairs Based on Bidirectional Adversarial Model 12

A Semi-supervised Bilingual Lexicon Induction Method for Dis...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Zhi, Wenwu Zhang, Yuhong Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Ministry of Education !!!School of Computer Science and Information Engineering @@@Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

Bilingual lexicon induction (BLI) can transfer knowledgefrom well- to under- resourced language, and has been widelyapplied to various NLP tasks. Recent work on BLI is projection-based that learns a mapping to connect source and target embedding spaces, with the isomorphism assumption. Unfortunately, the isomorphism assumption doesn't hold gener-ally, especially in typologically distant language pairs. Moreover, without supervised signals guiding, the training will further com-plicates BLI, making the performance of unsupervised methods unsatisfactory. To broke the restrict of isomorphism, we propose a semi-supervised method for distant BLI tasks, named A Semi-supervised Bilingual Lexicon Induction method in Latent Space based on Bidirectional Adversarial Model. First, two latent spaces are learned by two autoencoders for source and target domain independently to weaken the constraint of isomorphism in the embedding spaces. Then we add a few pairs of dictionary to learn the initial mapping to connect the Latent Space. Last, based on initial mapping, Cycle-Consistency is combined with Distance constraint constraint to maintain the geometry structure of both embedding spaces stable in the learning of bi-direction mapping based on adversarial model. By conducting extensive experiments, our method gets state-of-the-art results on most language pairs, especially with significant improvements on distant language pairs. © 2021 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Exploring Heterogeneity and Uncertainty for Graph-based Cognitive Diagnosis Models in Intelligent Education 25

Exploring Heterogeneity and Uncertainty for Graph-based Cogn...

引用

Proceedings of the 31st ACM SIGKDD Conference on knowledge Discovery and data Mining V.1

作者： Pengyang Shao Yonghui Yang Chen Gao Lei Chen Kun Zhang Chenyi Zhuang Le Wu Yong Li Meng Wang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei Anhui China BNRist Tsinghua University Beijing China Department of Electronic Engineering BNRist Tsinghua University Beijing China Ant Group HangZhou Zhejiang China

ISBN: (纸本)9798400712456

Graph-based Cognitive Diagnosis (CD) has attracted much research interest due to its strong ability on inferring students' proficiency levels on knowledge concepts. While graph-based CD models have demonstrated remarkable performance, we contend that they still cannot achieve optimal performance due to the neglect of edge heterogeneity and uncertainty. Edges involve both correct and incorrect response logs, indicating heterogeneity. Meanwhile, a response log can have uncertain semantic meanings, e.g., a correct log can indicate true mastery or fortunate guessing, and a wrong log can indicate a lack of understanding or a careless mistake. In this paper, we propose an Informative Semantic-aware Graph-based Cognitive Diagnosis model (ISG-CD), which focuses on how to utilize the heterogeneous graph in CD and minimize effects of uncertain edges. Specifically, to explore heterogeneity, we propose a semantic-aware graph neural networks based CD model. To minimize effects of edge uncertainty, we propose an Informative Edge Differentiation layer from an information bottleneck perspective, which suggests keeping a minimal yet sufficient reliable graph for CD in an unsupervised way. We formulate this process as maximizing mutual information between the reliable graph and response logs, while minimizing mutual information between the reliable graph and the original graph. After that, we prove that mutual information maximization can be theoretically converted to the classic binary cross entropy loss function, while minimizing mutual information can be realized by the Hilbert-Schmidt Independence ***, we adopt an alternating training strategy for optimizing learnable parameters of both the semantic-aware graph neural networks based CD model and the edge differentiation layer. Extensive experiments on three real-world datasets have demonstrated the effectiveness of ISG-CD.

关键词： cognitive diagnosis

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Exercise- and knowledge-Aware Learning Network for Student Performance Prediction 1st

Graph-Based Exercise- and Knowledge-Aware Learning Network ...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Liu, Mengfan Shao, Pengyang Zhang, Kun Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9783030930455

Predicting student performance is a fundamental task in Intelligent Tutoring Systems (ITSs), by which we can learn about students’ knowledge level and provide personalized teaching strategies for them. Researchers have made plenty of efforts on this task. They either leverage educational psychology methods to predict students’ scores according to the learned knowledge proficiency, or make full use of Collaborative Filtering (CF) models to represent latent factors of students and exercises. However, most of these methods either neglect the exercise-specific characteristics (e.g., exercise materials), or cannot fully explore the high-order interactions between students, exercises, as well as knowledge concepts. To this end, we propose a Graph-based Exercise- and knowledge-Aware Learning Network for accurate student score prediction. Specifically, we learn students’ mastery of exercises and knowledge concepts respectively to model the two-fold effects of exercises and knowledge concepts. Then, to model the high-order interactions, we apply graph convolution techniques in the prediction process. Extensive experiments on two real-world datasets prove the effectiveness of our proposed Graph-EKLN. © 2021, Springer Nature Switzerland AG.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

引用

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Cross-modal Fusion based Refinement for Text-to-Image Synthesis

arXiv

引用

arXiv 2023年

作者： Haoran, Sun Yang, Wang Haipeng, Liu Biao, Qian Meng, Wang Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology Hefei China Department of Computer Science and Information Engineering Hefei University of Technology Hefei China

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel Fine-grained text-image Fusion based Generative Adversarial Networks, dubbed FF-GAN, which consists of two modules: Fine-grained text-image Fusion Block (FF-Block) and Global Semantic Refinement (GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given *** is available at htt s:// ithub com/haoranhfut/FF-GAN Copyright © 2023, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：