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

Artificial Intelligence Technology (ACAIT), Asian Conference on

作者： Baofu Fang Shuai Zhou Hao Wang School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Hefei China

Most of the existing slam algorithms are designed based on the assumption of a static environment, this strong assumption limits the practical application of most slam systems. The main reason is that moving objects will cause feature mismatch in the pose estimation process, which in turn affects the accuracy of localization and mapping. In this paper, we propose a SLAM algorithm in a dynamic environment. First, we use the BlendMask network to detect potential moving objects to generate masks for dynamic objects. The geometrically constrained joint optical flow method is used to detect dynamic feature points. Secondly, aiming at the failure of semantic segmentation network segmentation, a missed detection compensation algorithm based on the invariance of adjacent frame speed is proposed. Finally, a keyframe selection strategy is proposed to construct a semantic octree graph containing only static objects. We evaluate our algorithm on TUM RGB-D and real scene datasets. The experimental results show that the algorithm has high accuracy and real-time performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: Studies of knowledge management methods from literature

Notice of Retraction: Studies of knowledge management method...

引用

IEEE International Conference on Advanced Management Science (ICAMS)

作者： Jing Zhang Liuqi Ye Business School Hohai University HHU Nanjing Jiangsu China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

Extremely Short Chinese Text Classification Method Based on ...

引用

作者： Yongzeng Yue Yuhong Zhang Xuegang Hu Peipei Li 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

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness;secondly,the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method.

关键词： Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

来源：评论

学校读者我要写书评

暂无评论

Semi-autoregressive transformer for image captioning

arXiv

引用

arXiv 2021年

作者： Zhou, Yuanen Zhang, Yong Hu, Zhenzhen Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Tencent AI Lab Key Laboratory of Knowledge Engineering with Big Data Ministry of Education

Current state-of-the-art image captioning models adopt autoregressive decoders, i.e. they generate each word by conditioning on previously generated words, which leads to heavy latency during inference. To tackle this issue, non-autoregressive image captioning models have recently been proposed to significantly accelerate the speed of inference by generating all words in parallel. However, these non-autoregressive models inevitably suffer from large generation quality degradation since they remove words dependence excessively. To make a better trade-off between speed and quality, we introduce a semi-autoregressive model for image captioning (dubbed as SATIC), which keeps the autoregressive property in global but generates words parallelly in local. Based on Transformer, there are only a few modifications needed to implement SATIC. Experimental results on the MSCOCO image captioning benchmark show that SATIC can achieve a good trade-off without bells and whistles. Code is available at https://***/YuanEZhou/satic. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Graph-based exercise- And knowledge-aware learning network for student performance prediction

arXiv

引用

arXiv 2021年

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

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. Copyright © 2021, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Series Classification via Hierarchical Graph Embedding

Multivariate Time Series Classification via Hierarchical Gra...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenhao Niu Xingrui Zhuo Gongqing Wu JunWei Lv Zan Zhang Chenyang Bu 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 Anhui China

Multivariate time series classification aims to determine the labels for multivariate time series samples. Although variable interaction relationships and sample similarity relationships exist in multivariate time series, the available related methods usually ignore the rich relationships and are ineffective in exploiting these. To solve this problem, we propose a Hierarchical Graph Embedding for Multivariate Time Series Classification (MTSC-HGE), which consists of a variable-wise attentive graph pooling module and a sample-wise graph convolutional module to obtain the relationships of variables and samples. Specifically, we design an attentive graph pooling module based on self-attention, which can obtain sample features fusing temporal patterns and variable interaction relationships in samples. Furthermore, we propose a graph mapping criterion that converts the MTS dataset into a graph based on dynamic time warping to explicitly reflect the similarity relationships between samples. To capture latent sample relationships, a GCN module is utilized on the sample graph to integrate sample features obtained from the attentive graph pool module. In addition, a classifier takes the rich representation output by the model to get the final predicted class. Extensive experiments on 14 public datasets show that MTSC-HGE significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A dominating set based approach to identify effective leader group of social network

A dominating set based approach to identify effective leader...

引用

19th International Computing and Combinatorics Conference, COCOON 2013

作者： Kim, Donghyun Li, Deying Asgari, Omid Li, Yingshu Tokuta, Alade O. Dept. of Mathematics and Computer Science North Carolina Central University Durham NC 27707 United States Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Renmin 100872 China Dept. of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9783642387678

Very recently, the study of social networks has received a huge attention since we can learn and understand many hidden properties of our society. This paper investigates the potential of social network analysis to select an effective leadership group of a society. Based on our real life observation, we establish three essential requirements for an effective leadership group, namely Influenceability, Partisanship, and Bipartisanship. Then, we formulate the problem of finding a minimum size leader group satisfying the three requirements as the minimum connected k-core dominating set problem (MCkCDSP), and show its NP-hardness. In addition, we introduce an extension of MCkCDSP, namely MCkCDSP-C, which assumes the society has a number of communities and requires at least one representative from each community should be in the leadership. At last, we propose an approximation algorithm for a subclass of MCkCDSP with k = 2, and show an α-approximation algorithm of MCkCDSP can be used to obtain an α-approximation algorithm of MCkCDSP-C. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

RGB-D SLAM Method Based on Feature Association in Dynamic Environment

RGB-D SLAM Method Based on Feature Association in Dynamic En...

引用

Artificial Intelligence Technology (ACAIT), Asian Conference on

作者： Baofu Fang Hao Wang School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei China

Simultaneous localization and mapping (SLAM) is one of the current research hotspots. However, in visual SLAM for dynamic environments, inaccurate detection of object motion states and incomplete dynamic region culling will lead to large localization errors. To address these issues, this paper proposes an RGB-D SLAM method based on feature association. The method has strongly correlated features in time and space according to the input image sequence. Using the moving probability of the feature points in the previous frame, the movement of the feature points in the current frame is calculated in combination with the dynamic corner points screened in the current frame. Then, the motion state of the object is determined according to the proportion of different feature points. Then combined with semantic information and object depth information, the fast search method is used to obtain accurate dynamic regions. Finally, the selected effective feature points are used to estimate the camera pose and establish a static map of the environment. This paper evaluates the robustness and accuracy of our method on the TUM dataset and real environment, and the results show that our method can significantly improve the system tracking effect and reduce the system tracking error compared with other SLAM methods in dynamic environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

data augmentation in microscopic images for material data mining

引用

npj Computational Materials 2020年第1期6卷 601-609页

作者： Boyuan Ma Xiaoyan Wei Chuni Liu Xiaojuan Ban Haiyou Huang Hao Wang Weihua Xue Stephen Wu Mingfei Gao Qing Shen Michele Mukeshimana Adnan Omer Abuassba Haokai Shen Yanjing Su Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology BeijingBeijing 100083China School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing 100083China Institute for Advanced Materials and Technology University of Science and Technology BeijingBeijing 100083China School of Materials Science and Engineering University of Science and Technology BeijingBeijing 100083China School of Materials Science and Technology Liaoning Technical UniversityLiaoning 114051China The Institute of Statistical Mathematics Research Organization of Information and SystemsTachikawaTokyo 190-8562Japan National Intellectual Property Administration Beijing 100088China Faculty of Engineering Sciences University of BurundiBujumburaBurundi Faculty of Engineering and Technology Palestine Technical University–KadoorieTulkaremPalestine College of Information Science and Engineering China University of PetroleumBeijingChina Key Lab of Petroleum Data Mining China University of PetroleumBeijingChina

Recent progress in material data mining has been driven by high-capacity models trained on large ***,collecting experimental data(real data)has been extremely costly owing to the amount of human effort and expertise ***,we develop a novel transfer learning strategy to address problems of small or insufficient *** strategy realizes the fusion of real and simulated data and the augmentation of training data in a data mining *** a specific task of grain instance image segmentation,this strategy aims to generate synthetic data by fusing the images obtained from simulating the physical mechanism of grain formation and the“image style”information in real *** results show that the model trained with the acquired synthetic data and only 35%of the real data can already achieve competitive segmentation performance of a model trained on all of the real *** the time required to perform grain simulation and to generate synthetic data are almost negligible as compared to the effort for obtaining real data,our proposed strategy is able to exploit the strong prediction power of deep learning without significantly increasing the experimental burden of training data preparation.

关键词： mining instance competitive

来源：评论

学校读者我要写书评

暂无评论

USER: A unified information search and recommendation model based on integrated behavior sequence

arXiv

引用

arXiv 2021年

作者： Yao, Jing Dou, Zhicheng Xie, Ruobing Lu, Yanxiong Wang, Zhiping Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search and recommendation are the two most common approaches used by people to obtain information. They share the same goal - satisfying the user's information need at the right time. There are already a lot of Internet platforms and Apps providing both search and recommendation services, showing us the demand and opportunity to simultaneously handle both tasks. However, most platforms consider these two tasks independently - they tend to train separate search model and recommendation model, without exploiting the relatedness and dependency between them. In this paper, we argue that jointly modeling these two tasks will benefit both of them and finally improve overall user satisfaction. We investigate the interactions between these two tasks in the specific information content service domain. We propose first integrating the user's behaviors in search and recommendation into a heterogeneous behavior sequence, then utilizing a joint model for handling both tasks based on the unified sequence. More specifically, we design the Unified Information SEarch and Recommendation model (USER), which mines user interests from the integrated sequence and accomplish the two tasks in a unified way. Experiments on a dataset from a real-world information content service platform verify that our model outperforms separate search and recommendation baselines. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：