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

Attention-Based Interaction Trajectory Prediction 9th

Attention-Based Interaction Trajectory Prediction

9th International Conference on Artificial Intelligence and Mobile Services, AIMS 2020, held as part of the Services Conference Federation, SCF 2020

作者： Liu, Zhe Zhang, Lizong Rao, Zhihong Liu, Guisong School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China China Electronic Technology Cyber Security Co. Ltd. Chengdu610000 China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan528402 China

ISBN: (纸本)9783030596040

Trajectory prediction is a hot topic in the field of computer vision and has a wide range of applications. Trajectory prediction refers to predicting the future trajectory of a target based on its past trajectory. This paper proposes a method based on graph neural network and attention mechanism, in order to update trajectory characteristics by implement global pedestrian interaction. And, a direct relationship between history and future is introduced with the attention module for reducing error propagation. The method was evaluated on several real-world crowd datasets, the results demonstrate the effectiveness of our method. © 2020, Springer Nature Switzerland AG.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

OSAF_e: One-Stage Anchor Free Object Detection Method Considering Effective Area 9th

OSAF_e: One-Stage Anchor Free Object Detection Method Consid...

引用

9th International Conference on Artificial Intelligence and Mobile Services, AIMS 2020, held as part of the Services Conference Federation, SCF 2020

作者： Zhang, Yong Zhang, Lizong Rao, Zhihong Duan, Guiduo Wang, Chunyu School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China China Electronic Technology Cyber Security Co. Ltd. Chengdu610000 China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu610054 China

ISBN: (纸本)9783030596040

The task of object detection is to identify the bounding box of the object and its corresponding category in images. In this paper, we propose a new one-stage anchor free object detection algorithm OSAF_e, with the consideration of effective mapping area. A feature extraction network is used to obtain high level feature, and the true bounding box of the object in the original image is mapped to the grid of feature map, in order to perform category prediction and bounding box regression. The proposed algorithm is evaluated with the Pascal Voc dataset, and the experiments indicate that it has a better result. © 2020, Springer Nature Switzerland AG.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Budgeted Persuasion on User Opinions via Varying Susceptibility

Budgeted Persuasion on User Opinions via Varying Susceptibil...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Wenyi Tang Xinrui Xu Guangchun Luo Zaobo He Kaiming Zhan School of Computer Science and Engineering University of Electronic Science and Technology of China School of Information and Software Engineering University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Miami University Sichuan Jiuyuan Yinhai Software Co. Ltd

ISBN: (数字)9781728198293

ISBN: (纸本)9781728198309

Nowadays, the social network becomes an indispensable part of people's daily life, meanwhile offers an unprecedentedly convenient access for purposive individuals to influence the opinions of network users. Current studies present a subtle persuasion approach that finds a number of key users meanwhile varies their susceptibility extent to impact the public opinion. Such persuasion is significantly critical for public security, as it could facilitate both the spreading and dispelling of malicious rumors. However, the major body of these studies enclose impractical assumptions, such that persuaders have an unlimited budget, or the costs of varying different users' susceptibilities are the same, thus rendering these works unsuitable for realistic scenarios. Therefore, this work originally proposes a more practical and generalized problem of persuasion, where varying the susceptibilities of different users holds different costs. The analysis of its non-convexity, non-submodularity and complexity shows that solving the proposed problem is nontrivial, thus inspiring us to provide an intuitive greedy algorithm. Furthermore, we design an accelerated algorithm based on the community property, which reduces the time consumption more than one order of magnitude. The acceleration is based on the intuition that the impact of a user within a proper community could be a good estimation of the impact in the whole network, while the computation of the former one is much more efficient. The relationship between two algorithms is fully analyzed, which shows the community-based algorithm can degenerate to the intuitive greedy algorithm under a specific setting. Finally, comprehensive evaluations on real-world datasets show the superiority of proposed algorithms on both effectiveness and efficiency.

关键词： Greedy algorithms Social networking (online) Heuristic algorithms Search problems Rendering (computer graphics) Acceleration Security

来源：评论

学校读者我要写书评

暂无评论

Relation-Guided Representation Learning

arXiv

引用

arXiv 2020年

作者： Kang, Zhao Lu, Xiao Liang, Jian Bai, Kun Xu, Zenglin School of Computer Science and Engineering University of Electronic Science and Technology of China Sichuan China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Cloud and Smart Industries Group Tencent Beijing China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Center for Artificial Intelligence Peng Cheng Lab Shenzhen China

Deep auto-encoders (DAEs) have achieved great success in learning data representations via the powerful representability of neural networks. But most DAEs only focus on the most dominant structures which are able to reconstruct the data from a latent space and neglect rich latent structural information. In this work, we propose a new representation learning method that explicitly models and leverages sample relations, which in turn is used as supervision to guide the representation learning. Different from previous work, our framework well preserves the relations between samples. Since the prediction of pairwise relations themselves is a fundamental problem, our model adaptively learns them from data. This provides much flexibility to encode real data manifold. The important role of relation and representation learning is evaluated on the clustering task. Extensive experiments on benchmark data sets demonstrate the superiority of our approach. By seeking to embed samples into subspace, we further show that our method can address the large-scale and out-of-sample problem. Our source code is publicly available at: https://***/nbShawnLu/RGRL. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Recommending more suitable music based on users’ real context 14th

Recommending more suitable music based on users’ real conte...

引用

14th EAI International Conference on Collaborative computing: Networking, Applications and Worksharing, CollaborateCom 2018

作者： Yang, Qing Zhan, Le Han, Li Zhang, Jingwei Bi, Zhongqin School of Electronic Engineering and Automation Guilin University of Electronic Technology Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China College of Computer Science and Technology Shanghai University of Electronic Power Shanghai200090 China

ISBN: (纸本)9783030129804

Music recommendation is an popular function for personalized services and smart applications since it focuses on discovering users’ leisure preference. The traditional music recommendation strategy captured users’ music preference by analyzing their historical behaviors to conduct personalized recommendation. However, users’ current states, such as in busy working or in a leisure travel, etc., have an important influence on their music enjoyment. Usually, those existing methods only focus on pushing their favorite music to users, which may be not the most suitable for current scenarios. Users’ current states should be taken into account to make more perfect music recommendation. Considering the above problem, this paper proposes a music recommendation method by considering both users’ current states and their historical behaviors. First, a feature selection process based on ReliefF method is applied to discover the optimal features for the following recommendation. Second, we construct different feature groups according to the feature weights and introduce Naive Bayes model and Adaboost algorithm to train these feature groups, which will output a base classifier for each feature group. Finally, a majority voting strategy decides the optimal music type and each user will be recommended more suitable music based on their current context. The experiments on the real datasets show the effectiveness of the proposed method. © 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

Publication recommendations of manuscripts using improved C4.5 decision tree algorithm 2nd

Publication recommendations of manuscripts using improved C4...

引用

2nd International Conference on Intelligent and Interactive Systems and Applications, IISA 2017

作者： Jia, Didi Xie, Wu Chen, Zhiyong Qiang, Baohua School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex System Guilin541004 China Guangxi Key Laboratory of Trusted Software Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin541004 China

ISBN: (纸本)9783319690957

In view of the problem that the result accuracy of the research publication recommendations of manuscripts is often low. It is very difficult for many contributors to find the suitable journals from many recommendation results. To solve this problem, a novel method of publication recommendations for authors’ manuscripts is proposed using our improved C4.5 decision tree algorithm. For the shortcomings of too many values of data samples during dealing with the traditional C4.5 methods, the five-value logic ideas are adopted to improve this C4.5 algorithm to apply in the research fields of publication recommendations. The experimental results show that the related publications are easier to obtain for authors via the decision trees with the improved C4.5 method than before, and this method has higher accuracy than ever. It is of great significance to help the researchers, especially for those who have no enough experience to choose the most suitable journals from a lot of publications. © 2018, Springer International Publishing AG.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems Engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

Online Test Paper Composition Based on Genetic Algorithm

Online Test Paper Composition Based on Genetic Algorithm

引用

2018 3rd International Conference on Modelling, Simulation and Applied Mathematics(MSAM 2018)

作者： Wanli Song School of Information Engineering Nanjing Xiaozhuang University Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing XiaoZhuang University

The application of online examination is used more and more widely. Test paper composition is the core function in this application. Online examination system requires that the test paper should be quick and flexible, and the composition of questions should be reasonable and random. Test paper should not only meet the specific needs of users, ensure fairness, impartiality, but also be accurate and efficient. The intelligent test paper composition algorithm based on genetic algorithm is studied in this paper. Then this method is used to organize the structure of the test paper automatically, composites the examination content. Proposals are put forward to examines the degree of students' mastery of knowledge based on this method. This algorithm can automatically composite test papers according to the conditions of difficulty degree, knowledge coverage, and the proportion of questions. It can automatically composite test papers for online assessment. The practice of online testing system based on this algorithm shows that the algorithm is scientific and effective. On the premise of guaranteeing the quality of the test paper, it greatly improves the efficiency and pertinence of online testing. It is beneficial to improve students' learning efficiency and intellectualization of education.

关键词： test paper composition education intellectualization genetic algorithm E-learning

来源：评论

学校读者我要写书评

暂无评论

Facial expression recognition via weighted group sparsity

引用

Frontiers of Computer Science 2017年第2期11卷 266-275页

作者： Hao ZHENG Xin GENG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University Nanjing 211171 China School of Computer Science and Engineering Southeast University Nanjing 211189 China

Considering the distinctiveness of different group features in the sparse representation, a novel joint multi- task and weighted group sparsity （JMT-WGS） method is pro- posed. By weighting popular group sparsity, not only the rep- resentation coefficients from the same class over their asso- ciate dictionaries may share some similarity, but also the rep- resentation coefficients from different classes have enough di- versity. The proposed method is cast into a multi-task frame- work with two-stage iteration. In the first stage, representa- tion coefficient can be optimized by accelerated proximal gra- dient method when the weights are fixed. In the second stage, the weights are computed via the prior information about their entropy. The experimental results on three facial expres- sion databases show that the proposed algorithm outperforms other state-of-the-art algorithms and demonstrate the promis- ing performance of the proposed algorithm.

关键词： facial expression recognition multi-task learning group sparsity

来源：评论

学校读者我要写书评

暂无评论

News Recommendation System Based on Collaborative Filtering and SVM

News Recommendation System Based on Collaborative Filtering ...

引用

2018 3rd International Conference on Automation, Mechanical and Electrical Engineering (AMEE 2018)

作者： Wan-li SONG School of Information Engineering Nanjing Xiaozhuang University Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiao Zhuang University

News system requires news classification and personalized recommendation to improve user's efficiency and interest, and to enhance user's experiences. This paper constructed a news automatic classification and recommendation system through natural language processing, text classification, collaborative filtering algorithm. The published news contents were word-segmented and model-trained automatically first to determine which category the news belonging to. Users can also manually modify the classification so that later classification can be updated and improved. After that, the similarity between users was calculated by collaborative filtering and the users having higher similarity with the recommended users were selected. The news seen by the certain users were recommended to the users that were divided into the same group. This paper takes the news corpus of Fudan University's text classification research center as experimental data. Text classification accuracy is tested by this corpus. The experimental results show that the system can serve the news users well. It achieves effective classification and recommendation of news personally.

关键词： Recommendation algorithm Automatic classification Similarity Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：