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

arXiv 2022年

作者： He, Hui Zhang, Qi Yi, Kun Shi, Kaize Niu, Zhendong Cao, Longbing The School of Medical Technology Beijing Institute of Technology Beijing100081 China The School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China The Department of Computer Science Tongji University Shanghai201804 China The Data Science and Machine Intelligence Lab University of Technology SydneyNSW2007 Australia The Engineering Research Center of Integration and Application of Digital Learning Technology Ministry of Education China The DataX Research Centre School of Computing Macquarie University SydneyNSW2109 Australia

Due to the non-stationary nature, the distribution of real-world multivariate time series (MTS) changes over time, which is known as distribution drift. Most existing MTS forecasting models greatly suffer from distribution drift and degrade the forecasting performance over time. Existing methods address distribution drift via adapting to the latest arrived data or self-correcting per the meta knowledge derived from future data. Despite their great success in MTS forecasting, these methods hardly capture the intrinsic distribution changes, especially from a distributional perspective. Accordingly, we propose a novel framework temporal conditional variational autoencoder (TCVAE) to model the dynamic distributional dependencies over time between historical observations and future data in MTSs and infer the dependencies as a temporal conditional distribution to leverage latent variables. Specifically, a novel temporal Hawkes attention mechanism represents temporal factors subsequently fed into feed-forward networks to estimate the prior Gaussian distribution of latent variables. The representation of temporal factors further dynamically adjusts the structures of Transformer-based encoder and decoder to distribution changes by leveraging a gated attention mechanism. Moreover, we introduce conditional continuous normalization flow to transform the prior Gaussian to a complex and form-free distribution to facilitate flexible inference of the temporal conditional distribution. Extensive experiments conducted on six real-world MTS datasets demonstrate the TCVAE’s superior robustness and effectiveness over the state-of-the-art MTS forecasting baselines. We further illustrate the TCVAE applicability through multifaceted case studies and visualization in real-world *** Codes 68Txx Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An efficient aggregate signature scheme for healthcare wireless sensor networks

Journal of Network Intelligence

引用

Journal of Network intelligence 2021年第1期6卷 1-15页

作者： Chen, Jian-Neng Zhou, Yu-Ping Huang, Zhen-Jie Wu, Tsu-Yang Zou, Fu-Min Tso, Raylin Minnan Normal University Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Zhangzhou363000 China Lab of Granular Computing Zhangzhou363000 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Key Laboratory of Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology National Demonstration Center for Experimental Electronic Information and Electrical Technology Education Fujian University of Technology Fuzhou350008 China Department of Computer Science National Chengchi University Taipei Taiwan

In healthcare wireless sensor networks, there are a large number of sensors, which need to transmit a lot of information in real time. The aggregate signature scheme combines a great deal of signatures signed by different signers on different messages into one short signature, which greatly improves the efficiency of data transmission. In this paper, we present a scheme of certificate based aggregate signature, and prove its security in the random oracle model. The performance analysis shows that the scheme is efficient in sign and verify phase, and suitable for healthcare wireless sensor networks. © 2021, Taiwan Ubiquitous Information. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

$\mathsf{NCF}$NCF: A Neural Context Fusion Approach to Raw Mobility Annotation

引用

IEEE Transactions on Mobile Computing 2020年第1期21卷 226-238页

作者： Renjun Hu Jingbo Zhou Xinjiang Lu Hengshu Zhu Shuai Ma Hui Xiong SKLSDE Lab Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China Business Intelligence Lab Baidu Research National Engineering Laboratory of Deep Learning Technology and Application Beijing China Talent Intelligence Center Baidu Inc. Beijing China Management Science and Information Systems Department Rutgers Business School Rutgers University Newark NJ USA

Understanding human mobility patterns at the point-of-interest (POI) scale plays an important role in enhancing business intelligence in mobile environments. While large efforts have been made in this direction, most studies simply utilize POI check-ins to mine the concerned mobility patterns, the effectiveness of which is usually hindered due to data sparsity. To obtain better POI-based human mobility for mining, in this paper, we strive to directly annotate the POIs associated with raw user-generated mobility records. We propose a neural context fusion approach which integrates various context factors in people's POI-visiting behaviors. Our approach evaluates the preference and transition factors via representation learning. Notably, we incorporate an attention mechanism to deal with the randomized transitions in raw mobility. The domain knowledge factors, i.e., distance, time and popularity, remain effective and our approach further includes them from a data-driven perspective. Factors are automatically fused with a feed-forward neural network. Furthermore, we exploit a multi-head architecture to enhance the model expressiveness. Using two real-life data sets, we conduct our experimental study and find that our approach consistently outperforms the state-of-the-art baselines by at least 32 percent in accuracy. Besides, we demonstrate the utility of the obtained POI-based human mobility with a POI recommendation example.

关键词： Annotations Trajectory Mobile computing Computer architecture Business intelligence Neural networks Semantics

来源：评论

学校读者我要写书评

暂无评论

Aftershock Detection with Multi-scale Description Based Neural Network

Aftershock Detection with Multi-scale Description Based Neur...

引用

IEEE International Conference on data Mining (ICDM)

作者： Qi Zhang Tong Xu Hengshu Zhu Lifu Zhang Hui Xiong Enhong Chen Qi Liu Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Business Intelligence Lab Baidu Research

Aftershocks refer to the smaller earthquakes that occur following large earthquakes, in the same area of the main shock. The task of aftershocks detection, as a crucial and challenging issue in disaster monitoring, has attracted wide research attention in relevant fields. Compared with the traditional detection methods like STA/LTA algorithms or heuristic matching, neural network techniques are regarded as an advanced choice with better pattern recognition ability. However, current neural network-based solutions mainly formulate the seismic wave as ordinary time series, where existing techniques are directly deployed without adaption, and thus fail to obtain competitive performance on the intensive and highly-noise waveforms of aftershocks. To that end, in this paper, we propose a novel framework named Multi-Scale Description based Neural Network (MSDNN) for enhancing aftershock detection. Specifically, MSDNN contains a delicately-designed network structure for capturing both short-term scale and long-term scale seismic features. Therefore, the unique characteristics of seismic waveforms can be fully-exploited for aftershock detection. Furthermore, a multi-task learning strategy is introduced to model the seismic waveforms of multiple monitoring stations simultaneously, which can not only refine the detection performance but also provide additionally quantitative clues for discovering homologous earthquakes. Finally, comprehensive experiments on the data set from aftershocks of the Wenchuan M8.0 Earthquake have clearly validated the effectiveness of our framework compared with several state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Retraction Note: Advanced artificial intelligence in heart rate and blood pressure monitoring for stress management

引用

Journal of Ambient intelligence and Humanized Computing 2024年第1期15卷 255-255页

作者： Lin, Qiang Li, Tongtong Shakeel, P. Mohamed Samuel, R. Dinesh Jackson School of Mathematics and Computer Science Northwest Minzu University LanzhouGansu China Key Laboratory of Streaming Data Computing Technologies and Application Northwest Minzu University LanzhouGansu China Key Laboratory of China’s Ethnic Languages and Information Technology of Ministry of Education Northwest Minzu University LanzhouGansu China Faculty of Information and Communication Technology Universiti Teknikal Malaysia Melaka (UTeM) Durian Tunggal Malaysia Faculty of Technology Design and Environment Visual Artificial Intelligence Lab Oxford Brookes University Oxford UK

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for classification based on multi-classifiers learning 5th

A new algorithm for classification based on multi-classifier...

引用

5th International Conference on Geo-Spatial Knowledge and intelligence, GSKI 2017

作者： Zheng, Yifeng Li, Guohe Zhang, Wenjie School of Computer Sciences Key Laboratory of Data Science and Intelligence Application Fujian Province University Minnan Normal University Zhangzhou China College of Geophysics and Information Engineering Beijing Key Lab of Data Mining for Petroleum Data University China University of Petroleum Beijing China

ISBN: (纸本)9789811308956

Quality and quantity are the two key factors to influence the accuracy of classification. In order to improve the classification accuracy, in this paper, we propose a new algorithm, called CMCM (Classification based on Multiple Classifier Models), which consists of two classification models. In Model1, we mainly focus on the improvement of quality, thus the best attribute value from both the items and their complements in the training set is selected as the first item of a classification rule. While in Model2, quantity is taken into consideration, so it constructs two candidate sets and uses the one-versus-many strategy to generate several rules at one time. The experiment results show that: (1) Model1 can extract sufficient high quality rules and achieve high classification accuracy. (2) Model2 can extract sufficient information and achieve high classification accuracy. (3) CMCM can achieve higher classification accuracy compare with traditional classification. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Identifying High Potential Talent: A Neural Network Based Dynamic Social Profiling Approach

Identifying High Potential Talent: A Neural Network Based Dy...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuyang Ye Hengshu Zhu Tong Xu Fuzhen Zhuang Runlong Yu Hui Xiong Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology University of Chinese Academy of Sciences

How to identify high-potential talent (HIPO) earlier in their career always has strategic importance for human resource management. While tremendous efforts have been made in this direction, most existing approaches are still based on the subjective selection of human resource experts. This could lead to unintentional bias and inconsistencies. To this end, in this paper, we propose a neural network based dynamic social profiling approach for quantitatively identifying HIPOs from the newly-enrolled employees by modeling the dynamics of their behaviors in organizational social networks. A basic assumption is that HIPOs usually perform more actively and have higher competencies than their peers to accumulate their social capitals during their daily work practice. Along this line, we first propose to model the social profiles of employees with both Graph Convolutional Network (GCN) and social centrality analysis in a comprehensive way. Then, an adaptive Long Short Term Memory (LSTM) network with global attention mechanism is designed to capture the profile dynamics of employees in the organizational social networks during their early career. Finally, extensive experiments on real-world data clearly validate the effectiveness of our approach as well as the interpretability of our results.

关键词： Social networking (online) Companies Artificial neural networks Germanium Engineering profession

来源：评论

学校读者我要写书评

暂无评论

Enhancing person-Job fit for talent recruitment: An ability-aware neural network approach

arXiv

引用

arXiv 2018年

作者： Qin, Chuan Zhu, Hengshu Xu, Tong Zhu, Chen Jiang, Liang Chen, Enhong Xiong, Hui Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Business Intelligence Lab Baidu Research National Engineering Laboratory of Deep Learning Technology an Application China

The wide spread use of online recruitment services has led to information explosion in the job market. As a result, the recruiters have to seek the intelligent ways for Person-Job Fit, which is the bridge for adapting the right job seekers to the right positions. Existing studies on Person-Job Fit have a focus on measuring the matching degree between the talent qualification and the job requirements mainly based on the manual inspection of human resource experts despite of the subjective, incomplete, and inefficient nature of the human judgement. To this end, in this paper, we propose a novel end-to-end Ability-aware Person-Job Fit Neural Network (APJFNN) model, which has a goal of reducing the dependence on manual labour and can provide better interpretation about the fitting results. The key idea is to exploit the rich information available at abundant historical job application data. Specifically, we propose a word-level semantic representation for both job requirements and job seekers’ experiences based on Recurrent Neural Network (RNN). Along this line, four hierarchical ability-aware attention strategies are designed to measure the different importance of job requirements for semantic representation, as well as measuring the different contribution of each job experience to a specific ability requirement. Finally, extensive experiments on a large-scale real-world data set clearly validate the effectiveness and interpretability of the APJFNN framework compared with several baselines. Copyright © 2018, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Measuring the popularity of job skills in recruitment market: A multi-criteria approach

arXiv

引用

arXiv 2017年

作者： Xu, Tong Zhu, Hengshu Zhu, Chen Li, Pan Xiong, Hui Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Rutgers Business School Rutgers University

To cope with the accelerating pace of technological changes, talents are urged to add and refresh their skills for staying in active and gainful employment. This raises a natural question: what are the right skills to learn? Indeed, it is a nontrivial task to measure the popularity of job skills due to the diversified criteria of jobs and the complicated connections within job skills. To that end, in this paper, we propose a data driven approach for modeling the popularity of job skills based on the analysis of large-scale recruitment data. Specifically, we first build a job skill network by exploring a large corpus of job postings. Then, we develop a novel Skill Popularity based Topic Model (SPTM) for modeling the generation of the skill network. In particular, SPTM can integrate different criteria of jobs (e.g., salary levels, company size) as well as the latent connections within skills, thus we can effectively rank the job skills based on their multi-faceted popularity. Extensive experiments on real-world recruitment data validate the effectiveness of SPTM for measuring the popularity of job skills, and also reveal some interesting rules, such as the popular job skills which lead to high-paid *** Codes 68T30 Copyright © 2017, The Authors. All rights reserved.

关键词： Compensation (personnel)

来源：评论

学校读者我要写书评

暂无评论

Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise

arXiv

引用

arXiv 2017年

作者： Qian, Chao Bian, Chao Jiang, Wu Tang, Ke Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Hefei230027 China Shenzhen Key Lab of Computational Intelligence Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

In many real-world optimization problems, the objective function evaluation is subject to noise, and we cannot obtain the exact objective value. Evolutionary algorithms (EAs), a type of general-purpose randomized optimization algorithm, have been shown to be able to solve noisy optimization problems well. However, previous theoretical analyses of EAs mainly focused on noise-free optimization, which makes the theoretical understanding largely insufficient for the noisy case. Meanwhile, the few existing theoretical studies under noise often considered the one-bit noise model, which flips a randomly chosen bit of a solution before evaluation;while in many realistic applications, several bits of a solution can be changed simultaneously. In this paper, we study a natural extension of one-bit noise, the bit-wise noise model, which independently flips each bit of a solution with some probability. We analyze the running time of the (1+1)-EA solving OneMax and LeadingOnes under bit-wise noise for the first time, and derive the ranges of the noise level for polynomial and super-polynomial running time bounds. The analysis on LeadingOnes under bit-wise noise can be easily transferred to one-bit noise, and improves the previously known results. Since our analysis discloses that the (1+1)-EA can be efficient only under low noise levels, we also study whether the sampling strategy can bring robustness to noise. We prove that using sampling can significantly increase the largest noise level allowing a polynomial running time, that is, sampling is robust to noise. Copyright © 2017, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：