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

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xinzheng Li Yuhong Zhang Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Cross-network node classification aims to use a labeled source network to classify nodes in an unlabeled target network. Most of the existing cross-network node classification methods learn the network representations by capturing the node neighborhood and train the classifier on these representations. The performance is highly dependent on the high-quality neighborhood in the network. However, in applications, the degree of nodes generally follows a long-tail distribution, i.e., a significant proportion of nodes are tail nodes with sparse neighborhood. It poses a challenge to existing methods. To this end, a structure similarity graph for cross-network node classitication method (SCNC) is proposed in this paper. Firstly, the potential links between nodes are predicted with the structural similarity metric to construct structure similarity graph, which can enrich the neighborhood of tail nodes. Then, the embedding representations of the structural similarity graph are learned to capture more neighborhood information. Finally, the adversarial is used to learn the domain invariant representations to address cross-network divergence. Extensive experimental results show that our SCNC outperforms the state-of-the-art methods.

关键词： Network topology Tail Learning (artificial intelligence) Prediction algorithms Classification algorithms Noise measurement Task analysis

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Digital Twin from the Perspective of Smart Manufacturing Systems in Industry 4.0/5.0

Reconfigurable Digital Twin from the Perspective of Smart Ma...

引用

2024 International Conference on Intelligent Systems and Robotics, CISR 2024

作者： Mo, Guangyu Sun, Yuan Huang, Sihan Gao, Feng Huang, Jintang Lai, Lijuan Wang, Guoxin Yan, Yan School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China Beijing Aerospace Times Optical-Electronic Technology Co. Ltd. Beijing100094 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China China Academy of Aerospace Electronic Technology Beijing100094 China School of Industrial Automation Beijing Institute of Technology Zhuhai519088 China

In industry 4.0/5.0, Smart manufacturing systems are typically complex systems that can be adjusted to deal with demand fluctuation through reconfigurable software/hardware. The emergence of digital twin as enabler technology can promote the operation efficiency of smart manufacturing systems. However, the modelling processes of digital twin of smart manufacturing systems is inefficient due to their complicated structures in general. Besides, the frequent reconfiguration of smart manufacturing systems and the differentiation among smart manufacturing systems will increase the burden of digital twin modelling. Therefore, a reconfigurable modelling method for digital twin of smart manufacturing systems is proposed in this paper. First, a reconfigurable modelling framework based on open architecture is proposed to provide basic model scenario for digital twin of smart manufacturing systems. Second, the reconfiguration of digital twin is elaborated from three dimensions, including reconfigurable virtual model, reconfigurable mapping, and reconfigurable scene. Finally, a case study is given to demonstrate the effectiveness of the proposed method. © Published under licence by IOP Publishing Ltd.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

RESIDUAL ATTENTION BLOCK SEARCH FOR LIGHTWEIGHT IMAGE SUPER-RESOLUTION

RESIDUAL ATTENTION BLOCK SEARCH FOR LIGHTWEIGHT IMAGE SUPER-...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Liao, Wenrui Zhao, Zhong-Qiu Shen, Hao Tian, Weidong School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China

ISBN: (纸本)9781665438643

Recently, lightweight neural networks with different manual designs have presented a promising performance in single image super-resolution (SR). However, these designs rely on too much expert experience. To address this issue, we focus on searching a lightweight block for efficient and accurate image SR. Due to the frequent use of various residual blocks and attention mechanisms in SR methods, we propose the residual attention search block (RASB) which combines an operation search block (OSB) with an attention search block (ASB). The former is used to explore the suitable operation at the proper position, and the latter is applied to discover the optimal connection of various attention mechanisms. Moreover, we build the modified residual attention network (MRAN) with stacked found blocks and a refinement module. Extensive experiments demonstrate that our MRAN achieves a better trade-off against the state-of-the-art methods in terms of accuracy and model complexity. © 2021 IEEE

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Pattern Matching in Medical knowledge Graphs 4

Dynamic Graph Pattern Matching in Medical Knowledge Graphs

引用

4th International Conference on data Intelligence and Security, ICDIS 2022

作者： Du, Xun Tao, Zhenchao Li, Lei School of Computer Science and Information Engineering Hefei University of Technology Hefei China The First Affiliated Hospital University of Science and Technology of China Hefei China Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei China

ISBN: (数字)9781665459686

ISBN: (纸本)9781665459693

As the study of graph pattern matching (GPM) attracts more and more scholars, the research of GPM in the medical field begins to emerge, from protein structure analysis to breast cancer classification diagnosis, and GPM is more and more widely adopted. However, in medical knowledge graphs (MKG), when the pattern graph dynamically changes, to obtain the matching results of the changed pattern graph, the traditional method has to carry out global matching instead of local matching, which causes a waste of resources and takes a lot of time. To quickly return the matching results of the dynamic pattern graph in MKGs, in this paper, we introduce a caching mechanism to cache the previous matching results and propose a new longest common path matching (M-LCPM) algorithm based on multithreading. The algorithm only performs partial matching on the changed pattern graph and can quickly obtain the matching result. Considering that the M-LCPM algorithm cannot get matching results when the pattern graph changes completely and there may be missing matching subgraphs when the M-LCPM algorithm performs matching, we optimize the M-LCPM algorithm and propose the M-LCPM-Enhance algorithm. Experimental results on two data sets show that our dynamic algorithm is more efficient than existing algorithms. © 2022 IEEE.

关键词： graph pattern matching longest common path medical knowledge graphs

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NEW BOOLEAN SATISFIABILITY PROBLEM HEURISTIC STRATEGY: MINIMAL POSITIVE NEGATIVE PRODUCT STRATEGY

arXiv

引用

arXiv 2023年

作者： Qun, Zhao Xintao, Wang Menghui, Yang School of Information Resource Management Renmin University of China Beijing100872 China Institute of Economics Chinese Academy of Social Sciences Beijing100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing100872 China

This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algorithm over widely used heuristics such as the Dynamic Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum (VSIDS). Experimental results further confirm the effectiveness of this heuristic strategy in *** Codes 03 Copyright © 2023, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Which Companies are Likely to Invest: knowledge-graph-based Recommendation for Investment Promotion

Which Companies are Likely to Invest: Knowledge-graph-based ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Chenyang Bu Jiawei Zhang Xingchen Yu Le Wu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology China and Institute of Big Knowledge Science Hefei University of Technology Hefei China

Investment promotion refers to the process by which the government uses disposable resources to attract investors to the region for production and business activities. The existing basic mode of attracting investment is to collect information about enterprises and entrepreneurs through manual methods, determine the target enterprise from the list of enterprises, and then attract investment through visits, negotiations, and other methods. As contacting and visiting companies one by one requires huge amounts of manpower and time, the choice of target companies is critical for attracting investments. However, to the best of our knowledge, no study has conducted research from the perspective of knowledge-graph-based recommendation. In this study, we define the problem of target company recommendation in the process of investment promotion, and analyze the characteristics of the problem and the challenges it faces based on the background of the actual problem. Then, a two-tier model for solving this problem is provided from the perspective of knowledge graph reasoning. Aiming at the problem that the knowledge graph will frequently change, the model is designed based on the idea of combining the advantages of global and local link prediction. The experimental results on real-world data demonstrate the effectiveness of the proposed model.

关键词： Economics knowledge acquisition Government Companies Production Manuals Predictive models

来源：评论

学校读者我要写书评

暂无评论

The K-Step H Indices in Citation Networks at the Paper, Author, and Institution Levels

SSRN

引用

SSRN 2023年

作者： Yang, Alex Jie Wu, Linwei Zhang, Qi Wang, Hao Deng, Sanhong School of Information Management Nanjing University 22 Hankou Rd. Nanjing210093 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing210093 China International Joint Informatics Laboratory Nanjing University China

From the viewpoint of high-generation citation networks, h indices can be extended to global metrics at both basic and aggregated levels. To accomplish this, three types of networks are designed: the paper-paper network, the author-paper-paper network, and the institution-paper-paper network. The k-step h index is then proposed at the level of papers, authors, and institutions, respectively. Through a comprehensive empirical study based on the APS dataset, it is found that the k-step h index extends the depth and dimensionality of the Hirsh core, allowing for more global information. The consistency and convergent validity of the k-step h indices are quantitatively assessed. The results indicate that the k-step h index demonstrates a high degree of consistency and focuses on the potential for further research, and is capable of measuring the long-term reputation rather than short-term popularity. The convergent validity of the k-step h indices is rigorously tested using benchmark examples such as Nobel laureates and their publications, and they demonstrate superior performance in identifying seminal papers and prominent scientists compared to traditional metrics at the paper and author levels. The k-step h index also excels in ranking institutions, offering a promising new approach for evaluating the impact and influence of scientific entities at both the basic and aggregate levels. This opens up exciting avenues for future research. © 2023, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Unifying Large Language Models and knowledge Graphs: A Roadmap

arXiv

引用

arXiv 2023年

作者： Pan, Shirui Luo, Linhao Wang, Yufei Chen, Chen Wang, Jiapu Wu, Xindong Griffith University QLD Australia The Department of Data Science and AI Monash University Melbourne Australia The Nanyang Technological University Singapore The Faculty of Information Technology Beijing University of Technology Beijing China The Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei China The Research Center for Knowledge Engineering Zhejiang Lab Hangzhou China

Large language models (LLMs), such as ChatGPT and GPT4, are making new waves in the field of natural language processing and artificial intelligence, due to their emergent ability and generalizability. However, LLMs are black-box models, which often fall short of capturing and accessing factual knowledge. In contrast, knowledge Graphs (KGs), Wikipedia and Huapu for example, are structured knowledge models that explicitly store rich factual knowledge. KGs can enhance LLMs by providing external knowledge for inference and interpretability. Meanwhile, KGs are difficult to construct and evolve by nature, which challenges the existing methods in KGs to generate new facts and represent unseen knowledge. Therefore, it is complementary to unify LLMs and KGs together and simultaneously leverage their advantages. In this article, we present a forward-looking roadmap for the unification of LLMs and KGs. Our roadmap consists of three general frameworks, namely, 1) KG-enhanced LLMs, which incorporate KGs during the pre-training and inference phases of LLMs, or for the purpose of enhancing understanding of the knowledge learned by LLMs;2) LLM-augmented KGs, that leverage LLMs for different KG tasks such as embedding, completion, construction, graph-to-text generation, and question answering;and 3) Synergized LLMs + KGs, in which LLMs and KGs play equal roles and work in a mutually beneficial way to enhance both LLMs and KGs for bidirectional reasoning driven by both data and knowledge. We review and summarize existing efforts within these three frameworks in our roadmap and pinpoint their future research directions. Copyright © 2023, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：