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

7th International Conference on computing and Artificial Intelligence, ICCAI 2021

作者： Luo, Yi Huang, Rui Chen, Aiguo Zeng, Xi School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Lianyungang Jierui Electronics Co. Ltd. Lianyungang China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China China Electronics Technology Cyber Security Co. Ltd. Chengdu China

ISBN: (纸本)9781450389501

Label Propagation Algorithm (LPA) predicts what label a node in a graph has by its accumulated label information after iteratively propagating label information among adjacent nodes. Subsequent studies of LPA try to assign weights on connections to adjust the propagation between different node pairs. However, such approaches still rely on the assumption that adjacent nodes should have similar labels. To predict when the label distribution may differ from this assumption, we propose Residual Label Propagation (ResLPA). It approximates residuals between labels with node features, then adds the approximated residuals to the label information as corrections before propagating. In experiments on five real-world graphs, ResLPA matches or exceeds state-of-the-art LPA-based methods, GCN-based methods and their integrations. © 2021 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Some Thoughts on the Classification Standard of Intelligent Autonomous Level of Measurement and Control System

Some Thoughts on the Classification Standard of Intelligent ...

引用

International Conference on big data and Information Analytics (bigDIA)

作者： Guangfu Yuan Liu Yang Haoran Han Yong Li Cong Shao Siyu Zhan Gansu Photoelectric Measurement Technology Research Laboratory Gansu China Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China

Intelligence is an important trend in the development of measurement and control systems. However, there is still a lack of unified understanding of the intelligent autonomous classification of the measurement and control system. The establishment of intelligent evaluation standards in this field has become an urgent research topic. This paper first gives an overview of the aviation measurement and control system, and then takes the classification standards of autonomy in the fields of automobile driving automation in China and the United states, the autonomy and autonomy level of typical ships in China, and the automation of civil unmanned aircraft system in China as a reference. A 5-level intelligent grading standard based on task adaptability, environmental complexity and human-computer interaction is proposed. The classification standard is practical and easy to understand. It can provide reference for the establishment of intelligent standards for measurement and control systems, improve the application speed of intelligent autonomous technology in the field of measurement and control, and broaden the application prospect of intelligent measurement and control systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced Graph Sample and Aggregate Inductive Learning Algorithm

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuejia Wu Jian-Tao Zhou Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph is an important research field that involves the storage and management of knowledge, but the incompleteness and sparsity of Knowledge Graphs hinder their application in many fields. Knowledge Graph Reasoning aims to alleviate this problem by completing missing paths or identifying wrong paths between entities. Graph Convolution Network (GCN) based methods are one of the state-of-the-art approaches to this work. However, it is difficult to directly generalize to unknown nodes and utilizes valid information from the local neighborhood which results in poor flexibility and extensibility and will loss of important information. This paper presents EG-KGR, a plug-and-play knowledge reasoning model based on enhanced graph sampling and aggregate inductive learning algorithm to relieve the above problems and enhance existing GCN-based methods. Specifically, EG-KGR supports incremental characteristics, uses inductive learning to replace transductive learning, and designs random sampling and local information sampling optimization methods to improve the model's generalization ability, prediction accuracy, and running speed. Extensive experimental results show that our EG-KGR can achieve optimal results.

关键词： Training Knowledge engineering Convolution Aggregates Optimization methods Knowledge graphs Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yuejia Wu Jian-Tao Zhou College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hanlin Liu Jiantao Zhou Hua Li College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Clustering-Based Routing Protocol Using Path Pattern Discovery Method to Minimize Delay in VANET

引用

Wireless Communications and Mobile computing 2023年第1期2023卷

作者： Xie, Xiaoyun Navaei, Yahya Dorostkar Einy, Sajad School of Electronic Information Engineering Gannan University of Science and Technology Jiangxi Ganzhou341000 China Ganzhou Key Laboratory of Cloud Computing and Big Data Jiangxi Ganzhou341000 China Computer and Information Technology Engineering Qazvin Branch Islamic Azad University Qazvin Iran Istanbul Aydin University Department of Application and Research Center for Advanced Studies Istanbul Turkey

In vehicular ad hoc networks (VANETs), vehicle-to-vehicle (V2V) communications can link vehicles to each other, and vehicle-to-infrastructure (V2I) messaging and communications can link roadside infrastructure such as routers. The vehicles in these networks act as relays that transmit critical messages in the network. Due to the high-speed movement of vehicles on the road, real-time messaging and minimizing the delay in sending messages is one of the most important objectives of VANET developers. On the other hand, the high mobility of vehicles causes communication interruptions and decreases the data delivery rate in VANET. To overcome this issue, predicting the path of vehicles can play an important role in sending data from the source to the destination. When an accident occurs on the road, the messages that are sensed by the imbedded sensors in the vehicles need to be sent, and if they are sent by the vehicles that change their route, these messages will not be sent to the destination and the performance of the network will be disturbed. Previous methods in the literature for data transmission in intervehicular networks have focused more on reliability and trust, and little attention has been paid to the prediction of vehicle movement paths in these types of networks. Therefore, for fast and reliable data transmission in VANET, accurate prediction of vehicle movement and creation of movement patterns can be effective in message transmission delay and data delivery rate. In this paper, we present an approach using a combination of cluster-based routing protocols and pattern discovery methods to minimize latency in VANETs. The outline of the proposed method has four modules: primary data collection and analysis, primary data preparation and analysis, pattern extraction and vehicle route discovery, and vehicle clustering and data/information transmission routing. The simulation results show that the proposed method with a delivery rate of 88.56% has significantly i

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Sentiment Analysis of Tourism Micro-blog Comments

Sentiment Analysis of Tourism Micro-blog Comments

引用

2016 International Conference on Artificial Intelligence: Techniques and Applications(AITA 2016)

作者： Wan-li SONG Jun-hua WANG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information EngineeringNanjing XiaoZhuang University Nanjing Vocational Institute of Transport Technology College of Computer and Information Hohai University

Recent years,an amount of tourism micro-blog comments on the Internet have become an important source of information for potential customers and to improve the service quality. These micro-blog comments do help to research tourism resources or services before making decisions. Thus,sentiment analysis of tourism micro-blog comments has become a hot issue in the field of natural language processing and text mining. We designed a system called SASTMC by using web crawler,Chinese words segmentation,emotion words dictionary and an improved TF-IDF algorithm. It enhances expression ability of sentiment information of text words. Experiments on Sina micro-blog comments datasets demonstrate that our method can do the task well.

关键词： Micro-blog comment Web crawler Words segmentation Sentiment analysis TF-IDF

来源：评论

学校读者我要写书评

暂无评论

Relation-Based Multi-Teacher Knowledge Distillation

Relation-Based Multi-Teacher Knowledge Distillation

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Yutian Wang Yi Xu School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Traditional knowledge distillation adopts one teacher model to instruct the training of a lightweight student model. To improve the performance of knowledge distillation, multi-teacher knowledge distillation utilizing multi-party knowledge to guide model learning was proposed. However, existing methods mainly use the summation-result of teacher models of a single sample to integrate multi-party knowledge directly, ignoring the relation knowledge among samples. In this paper, we propose a novel multi-teacher knowledge distillation method, which utilizes the data relation knowledge to allocate weights for teachers adaptively. To obtain the data relation knowledge, we design output-based strategy and feature-based strategy, which would help to allocate more weight for the teacher who has better learned the data relation knowledge. Extensive experiments have demonstrated the performance and efficiency of our proposed multi-teacher knowledge distillation method.

关键词： Training Adaptation models Neural networks

来源：评论

学校读者我要写书评

暂无评论

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

引用

17th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An attribute reduction framework for inconsistent decision tables from view of the boundary region

An attribute reduction framework for inconsistent decision t...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin Qian Yu-Hui Chang Ping Lv Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science & Technology Nanjing China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou China

ISBN: (纸本)9781509003914

Attribute reduction is one of the key issues for data preprocess in data mining. Many heuristic attribute reduction algorithms based on discernibility matrix have been proposed for inconsistent decision tables. However, these methods are usually computationally time-consuming. To address this issue, the derived consistent decision tables are defined for different definitions of relative reducts. The computations for different reducts of the original inconsistent decision tables are converted into the computations for their corresponding reducts of the derived consistent datasets. The relative discernibility object pair and the more optimal relative discernibility degree from view of the boundary region are designed to accelerate the attribute reduction process. An efficient attribute reduction framework using relative discernibility degree is proposed for large datasets. Experimental results show that our attribute reduction algorithms are effective and feasible for large inconsistent datasets.

关键词： Cybernetics Acceleration Time complexity Rough sets Heuristic algorithms data mining Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：