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

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Li, Yuling Yu, Kui Huang, Xiaoling Zhang, Yuhong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Enginerring Hefei University of Technology China

Few-shot knowledge graph completion (FKGC) aims to infer unknown fact triples of a relation using its few-shot reference entity pairs. Recent FKGC studies focus on learning semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. Such practice, however, ignores the inter-entity interaction, resulting in low-discrimination representations for entity pairs, especially when these entity pairs are associated with 1-to-N, N-to-1, and N-to-N relations. To address this issue, this paper proposes a novel FKGC model, named Cross-Interaction Attention Network (CIAN) to investigate the inter-entity interaction between head and tail entities. Specifically, we first explore the interactions within entities by computing the attention between the task relation and each entity neighbor, and then model the interactions between head and tail entities by letting an entity to attend to the neighborhood of its paired entity. In this way, CIAN can figure out the relevant semantics between head and tail entities, thereby generating more discriminative representations for entity pairs. Extensive experiments on two public datasets show that CIAN outperforms several state-of-the-art methods. The source code is available at https://***/cjlyl/FKGC-CIAN. © 2022 Association for Computational Linguistics.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

Partitioned Inverted Index Compression Using Hierarchical Dirichlet Process 4

Partitioned Inverted Index Compression Using Hierarchical Di...

引用

4th International Conference on Neural Networks, information and Communication engineering, NNICE 2024

作者： He, Runzhu Qu, Youli Beijing Jiaotong University Ministry of Education School of Computer and Information Technology Dept. Key Laboratory of Big Data & Artifcial Intelligence in Transportation Beijing China

ISBN: (纸本)9798350394375

In large-scale search engines, the core data structure is the inverted index, essentially a collection of integer sequences within inverted lists. Precise partitioning of these sequences enables efficient query processing. The concept of partitioning by quantity and universe has been established for years in the field of inverted index compression algorithms. The volume of data within a post-partitioned area, defined as density, is a key determinant of the compression efficiency of partitioned inverted index algorithms. Previous studies have focused on creating denser partitioned areas atop existing inverted file indexes to improve compression efficiency. This paper proposes a novel approach that utilizes the Hierarchical Dirichlet Process model to extract document themes, categorizes documents based on these themes, and then constructs file indexes accordingly to create denser partitioned areas. Compared with other inverted index compression methods, this algorithm achieves a favorable balance between time and space efficiency. © 2024 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

PDDD-PreTrain:A Series of Commonly Used Pre-Trained Models Support Image-Based Plant Disease Diagnosis

引用

Plant Phenomics 2023年第2期5卷 313-332页

作者： Xinyu Dong Qi Wang Qianding Huang Qinglong Ge Kejun Zhao Xingcai Wu Xue Wu Liang Lei Gefei Hao State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China The School of Physics and Optoelectronic Engineering Guangdong University of TechnologyGuangzhou 510006China National Key Laboratory of Green Pesticide Key Laboratory of Green Pesticide and Agricultural BioengineeringMinistry of EducationGuizhou UniversityGuiyang 550025China

Plant diseases threaten global food security by reducing crop yield;thus,diagnosing plant diseases is critical to agricultural *** intelligence technologies gradually replace traditional plant disease diagnosis methods due to their time-consuming,costly,inefficient,and subjective *** a mainstream AI method,deep learning has substantially improved plant disease detection and diagnosis for precision *** the meantime,most of the existing plant disease diagnosis methods usually adopt a pre-trained deep learning model to support diagnosing diseased ***,the commonly used pre-trained models are from the computer vision dataset,not the botany dataset,which barely provides the pre-trained models sufficient domain knowledge about plant ***,this pre-trained way makes the final diagnosis model more difficult to distinguish between different plant diseases and lowers the diagnostic *** address this issue,we propose a series of commonly used pre-trained models based on plant disease images to promote the performance of disease *** addition,we have experimented with the plant disease pre-trained model on plant disease diagnosis tasks such as plant disease identification,plant disease detection,plant disease segmentation,and other *** extended experiments prove that the plant disease pre-trained model can achieve higher accuracy than the existing pre-trained model with less training time,thereby supporting the better diagnosis of plant *** addition,our pre-trained models will be open-sourced at https://***/and Zenodo platform https://***/10.5281/zenodo.7856293.

关键词： diagnosis Plant thereby

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

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

作者： Bu, Chenyang Liu, Yuxin Zhang, Lizhong Zhu, Tao Luo, Wenjian School of Computer Science and Information Engineering Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230027 China School of Computer Science and Information Engineering University of South China Hunan Hengyang421200 China School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518000 China

ISBN: (纸本)9798350337020

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to 'track the moving optima', rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm44https://***/DMiC-Lab-HFUT/SMDE-Transfer. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

data Aggregation Point Placement and Subnetwork Optimization for Smart Grids

引用

computers, Materials & Continua 2025年第4期83卷 407-434页

作者： Tien-Wen Sung Wei Li Chao-Yang Lee Yuzhen Chen Qingjun Fang Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and MathematicsFujian University of TechnologyFuzhou350118China Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin640301TaiwanChina

To transmit customer power data collected by smart meters(SMs)to utility companies,data must first be transmitted to the corresponding data aggregation point(DAP)of the *** number of DAPs installed and the installation location greatly impact the whole *** the traditional DAP placement algorithm,the number of DAPs must be set in advance,but determining the best number of DAPs is difficult,which undoubtedly reduces the overall performance of the ***,the excessive gap between the loads of different DAPs is also an important factor affecting the quality of the *** address the above problems,this paper proposes a DAP placement algorithm,APSSA,based on the improved affinity propagation(AP)algorithm and sparrow search(SSA)algorithm,which can select the appropriate number of DAPs to be installed and the corresponding installation locations according to the number of SMs and their distribution locations in different *** algorithm adds an allocation mechanism to optimize the subnetwork in the *** is evaluated under three different areas and compared with other DAP placement *** experimental results validated that the method in this paper can reduce the network cost,shorten the average transmission distance,and reduce the load gap.

关键词： Smart grid data aggregation point placement network cost average transmission distance load gap

来源：评论

学校读者我要写书评

暂无评论

Research progress of quantum artificial intelligence in smart city

引用

Intelligent and Converged Networks 2024年第2期5卷 116-133页

作者： Sumin Wang Ning Wang Tongyu Ji Yiyun Shi Chao Wang the Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication Shanghai UniversityShanghai 200444China School of Information Engineering Ganzhou Key Laboratory of Cloud Computing and Big Data ResearchGannan University of Science and TechnologyGanzhou 341000China

The rapid accumulation of big data in the Internet era has gradually decelerated the progress of Artificial Intelligence(AI).As Moore’s Law approaches its limit,it is imperative to break the constraints that are holding back artificial *** computing and artificial intelligence have been advancing along the highway of human civilization for many years,emerging as new engines driving economic and social *** article delves into the integration of quantum computing and artificial intelligence in both research and *** introduces the capabilities of both universal quantum computers and special-purpose quantum computers that leverage quantum *** discussion further explores how quantum computing enhances classical artificial intelligence from four perspectives:quantum supervised learning,quantum unsupervised learning,quantum reinforcement learning,and quantum deep *** an effort to address the limitations of smart cities,this article explores the formidable potential of quantum artificial intelligence in the realm of smart *** does so by examining aspects such as intelligent transportation,urban operation assurance,urban planning,and information communication,showcasing a plethora of practical achievements in the *** the foreseeable future,Quantum Artificial Intelligence(QAI)is poised to bring about revolutionary development to smart *** urgency lies in developing quantum artificial intelligence algorithms that are compatible with quantum computers,constructing an efficient,stable,and adaptive hybrid computing architecture that integrates quantum and classical computing,preparing quantum data as needed,and advancing controllable qubit hardware equipment to meet actual *** ultimate goal is to shape the next generation of artificial intelligence that possesses common sense cognitive abilities,robustness,excellent generalization capabilities,and interpretability.

关键词： quantum artificial intelligence smart city D-Wave quantum computer

来源：评论

学校读者我要写书评

暂无评论

SGSH: Stimulate Large Language Models with Skeleton Heuristics for knowledge Base Question Generation

SGSH: Stimulate Large Language Models with Skeleton Heuristi...

引用

2024 Findings of the Association for Computational Linguistics: NAACL 2024

作者： Guo, Shasha Liao, Lizi Zhang, Jing Wang, Yanling Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education China Singapore Management University Singapore Zhongguancun Laboratory China

ISBN: (纸本)9798891761193

knowledge base question generation (KBQG) aims to generate natural language questions from a set of triplet facts extracted from KB. Existing methods have significantly boosted the performance of KBQG via pre-trained language models (PLMs) thanks to the richly endowed semantic knowledge. With the advance of pre-training techniques, large language models (LLMs) (e.g., GPT-3.5) undoubtedly possess much more semantic knowledge. Therefore, how to effectively organize and exploit the abundant knowledge for KBQG becomes the focus of our study. In this work, we propose SGSH - a simple and effective framework to Stimulate GPT-3.5 with Skeleton Heuristics to enhance KBQG. The framework incorporates "skeleton heuristics", which provides more fine-grained guidance associated with each input to stimulate LLMs to generate optimal questions, encompassing essential elements like the question phrase and the auxiliary verb. More specifically, we devise an automatic data construction strategy leveraging ChatGPT to construct a skeleton training dataset, based on which we employ a soft prompting approach to train a BART model dedicated to generating the skeleton associated with each input. Subsequently, skeleton heuristics are encoded into the prompt to incentivize GPT-3.5 to generate desired questions. Extensive experiments demonstrate that SGSH derives the new state-of-the-art performance on the KBQG tasks. The code is now available on Github. © 2024 Association for Computational Linguistics.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：