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

arXiv 2020年

作者： Karim, Md. Rezaul Chakravarthi, Bharathi Raja McCrae, John P. Cochez, Michael Fraunhofer Fit Aachen Germany Rwth Aachen University Insight Sfi Research Centre for Data Analytics Data Science Institute National University of Ireland Department of Computer Science Vrije Universiteit Amsterdam

Exponential growths of social media and micro-blogging sites not only provide platforms for empowering freedom of expressions and individual voices but also enables people to express anti-social behaviour like online harassment, cyberbullying, and hate speech. Numerous works have been proposed to utilize these data for social and anti-social behaviours analysis, document characterization, and sentiment analysis by predicting the contexts mostly for highly resourced languages such as English. However, there are languages that are under-resources, e.g., South Asian languages like Bengali, Tamil, Assamese, Telugu that lack of computational resources for the natural language processing (NLP)1tasks. In this paper2, we provide several classifcation benchmarks for Bengali, an under-resourced language. We prepared three datasets of expressing hate, commonly used topics, and opinions for hate speech detection, document classifcation, and sentiment analysis, respectively. We built the largest Bengali word embedding models to date based on 250 million articles, which we call BengFastText. We perform three diferent experiments, covering document clas-sifcation, sentiment analysis, and hate speech detection. We incorporate word embeddings into a Multichannel Convolutional-LSTM (MConv-LSTM) network for predicting diferent types of hate speech, document classifcation, and sentiment analysis. Experiments demonstrate that BengFastText can capture the semantics of words from respective contexts correctly. Evaluations against several baseline embedding models, e.g., Word2Vec and GloVe yield up to 92.30%, 82.25%, and 90.45% F1-scores in case of document classifcation, sentiment analysis, and hate speech detection, respectively during 5-fold cross-validation tests. Copyright © 2020, The Authors. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Design of a Hybrid Brain-computer Interface and Virtual Reality System for Post-Stroke Rehabilitation

引用

IFAC-PapersOnLine 2020年第2期53卷 16010-16015页

作者： Mengjie Huang Yuting Zheng Jingjing Zhang Bin’ao Guo Chenyu Song Rui Yang Department of Computer Science and Software Engineering Xi’an Jiaotong-Liverpool University Suzhou 215123 China Research Institute of Big Data Analytics Xi’an Jiaotong-Liverpool University Suzhou 215123 China

As one of common diseases among elderly, stroke often leads to motor impairment and even serious disability. Post-stroke rehabilitation is of great importance to restore the motor function and improve the life quality of stroke survivors. This study therefore sets out to propose a hybrid system based on brain-computer interface and virtual reality, which can provide various training programs including action observation, motor imagery and physical therapy for post-stroke patients with different motor control levels and training demands. The present work offers new insights into the way in which the conventional rehabilitation programs can be turned into innovative and interactive training experiences with advanced technologies to make optimal rehabilitation outcomes for stroke survivors.

关键词： Rehabilitation engineering Stroke Virtual reality Brain-computer interface Motor imagery

来源：评论

学校读者我要写书评

暂无评论

Improved Fitness Dependent Optimizer for Solving Economic Load Dispatch Problem

arXiv

引用

arXiv 2022年

作者： Tahir, Barzan Hussein Rashid, Tarik A. Rauf, Hafiz Tayyab Bacanin, Nebojsa Chhabra, Amit Vimal, S. Yaseen, Zaher Mundher Department of Computer Science and Engineering University of Kurdistan Helwer Erbil Iraq Centre for Smart Systems AI and Cybersecurity Staffordshire University Stoke-on-Trent United Kingdom Singidunum University Danijelova 32 Belgrade11000 Serbia Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India Department of Artificial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Earth Sciences and Environment Faculty of Science and Technology Universiti Kebangsaan Malaysia Selangor Bangi43600 Malaysia USQ's Advanced Data Analytics Research Group School of Mathematics Physics and Computing University of Southern Queensland QLD4350 Australia New era and Development in Civil Engineering Research Group Scientific Research Center Al-Ayen University Thi-Qar64001 Iraq

Economic Load Dispatch depicts a fundamental role in the operation of power systems, as it decreases the environmental load, minimizes the operating cost, and preserves energy resources. The optimal solution to Economic Load Dispatch problems and various constraints can be obtained by evolving several evolutionary and swarm-based algorithms. The major drawback to swarm-based algorithms is premature convergence towards an optimal solution. Fitness Dependent Optimizer is a novel optimization algorithm stimulated by the decision-making and reproductive process of bee swarming. Fitness Dependent Optimizer (FDO) examines the search spaces based on the searching approach of Particle Swarm Optimization. To calculate the pace, the fitness function is utilized to generate weights that direct the search agents in the phases of exploitation and exploration. In this research, the authors have carried out Fitness Dependent Optimizer to solve the Economic Load Dispatch problem by reducing fuel cost, emission allocation, and transmission loss. Moreover, the authors have enhanced a novel variant of Fitness Dependent Optimizer, which incorporates novel population initialization techniques and dynamically employed sine maps to select the weight factor for Fitness Dependent Optimizer. The enhanced population initialization approach incorporates a quasi-random Sabol sequence to generate the initial solution in the multi-dimensional search space. A standard 24-unit system is employed for experimental evaluation with different power demands. Empirical results obtained using the enhanced variant of the Fitness Dependent Optimizer demonstrate superior performance in terms of low transmission loss, low fuel cost, and low emission allocation compared to the conventional Fitness Dependent Optimizer. The experimental study obtained 7.94E-12, the lowest transmission loss using the enhanced Fitness Dependent Optimizer. Correspondingly, various standard estimations are used to prove the stability

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Sparse online relative similarity learning

arXiv

引用

arXiv 2021年

作者： Yao, Dezhong Zhao, Peilin Yu, Chen Jin, Hai Li, Bin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Data Analytics Department Institute for Infocomm Research A*STAR 138632 Singapore Economics and Management School Wuhan University Wuhan430072 China

For many data mining and machine learning tasks, the quality of a similarity measure is the key for their performance. To automatically find a good similarity measure from datasets, metric learning and similarity learning are proposed and studied extensively. Metric learning will learn a Mahalanobis distance based on positive semi-definite (PSD) matrix, to measure the distances between objectives, while similarity learning aims to directly learn a similarity function without PSD constraint so that it is more attractive. Most of the existing similarity learning algorithms are online similarity learning method, since online learning is more scalable than offline learning. However, most existing online similarity learning algorithms learn a full matrix with d2 parameters, where d is the dimension of the instances. This is clearly inefficient for high dimensional tasks due to its high memory and computational complexity. To solve this issue, we introduce several Sparse Online Relative Similarity (SORS) learning algorithms, which learn a sparse model during the learning process, so that the memory and computational cost can be significantly reduced. We theoretically analyze the proposed algorithms, and evaluate them on some real-world high dimensional datasets. Encouraging empirical results demonstrate the advantages of our approach in terms of efficiency and efficacy. Copyright © 2021, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum generative training using rényi divergences

arXiv

引用

arXiv 2021年

作者： Kieferová, Mária Marrero, Carlos Ortiz Wiebe, Nathan Centre for Quantum Computation and Communication Technology Centre for Quantum Software and Information University of Technology Sydney Data Sciences & Analytics Group Department of Electrical & Computer Engineering Pacific Northwest National Laboratory North Carolina State University Department of Computer Science Department of Physics High Performance Computing Group University of Toronto University of Washington Pacific Northwest National Laboratory

Quantum neural networks (QNNs) are a framework for creating quantum algorithms that promises to combine the speedups of quantum computation with the widespread successes of machine learning. A major challenge in QNN development is a concentration of measure phenomenon known as a barren plateau that leads to exponentially small gradients for a range of QNNs models. In this work, we examine the assumptions that give rise to barren plateaus and show that an unbounded loss function can circumvent the existing no-go results. We propose a training algorithm that minimizes the maximal Rényi divergence of order two and present techniques for gradient computation. We compute the closed form of the gradients for Unitary QNNs and Quantum Boltzmann Machines and provide sufficient conditions for the absence of barren plateaus in these models. We demonstrate our approach in two use cases: thermal state learning and Hamiltonian learning. In our numerical experiments, we observed rapid convergence of our training loss function and frequently archived a 99% average fidelity in fewer than 100 epochs. © 2021, CC BY.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

An Artificial Intelligence framework for bidding optimization with uncertainty in multiple frequency reserve markets

arXiv

引用

arXiv 2021年

作者： Kempitiya, Thimal Sierla, Seppo de Silva, Daswin Yli-Ojanperä, Matti Alahakoon, Damminda Vyatkin, Valeriy Centre for Data Analytics and Cognition La Trobe University VIC3083 Australia Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University EspooFI-00076 Finland Department of Computer Science Electrical and Space Engineering Luleå Tekniska Universitet LuleåSE-97187 Sweden

The global ambitions of a carbon-neutral society necessitate a stable and robust smart grid that capitalises on frequency reserves of renewable energy. Frequency reserves are resources that adjust power production or consumption in real time to react to a power grid frequency deviation. Revenue generation motivates the availability of these resources for managing such deviations. However, limited research has been conducted on data-driven decisions and optimal bidding strategies for trading such capacities in multiple frequency reserves markets. We address this limitation by making the following research contributions. Firstly, a generalised model is designed based on an extensive study of critical characteristics of global frequency reserves markets. Secondly, three bidding strategies are proposed, based on this market model, to capitalise on price peaks in multi-stage markets. Two strategies are proposed for non-reschedulable loads, in which case the bidding strategy aims to select the market with the highest anticipated price, and the third bidding strategy focuses on rescheduling loads to hours on which highest reserve market prices are anticipated. The third research contribution is an Artificial Intelligence (AI) based bidding optimization framework that implements these three strategies, with novel uncertainty metrics that supplement data-driven price prediction. Finally, the framework is evaluated empirically using a case study of multiple frequency reserves markets in Finland. The results from this evaluation confirm the effectiveness of the proposed bidding strategies and the AI-based bidding optimization framework in terms of cumulative revenue generation, leading to an increased availability of frequency reserves. © 2021, CC BY-NC-ND.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Self-Play Algorithms Under a Generalized Framework

arXiv

引用

arXiv 2020年

作者： Hernandez, Daniel Denamganaï, Kevin Devlin, Sam Samothrakis, Spyridon Walker, James Alfred IEEE Department of Computer Science University of York United Kingdom Microsoft Research Cambridge United Kingdom Institute of Analytics & Data Science University of Essex United Kingdom

Throughout scientific history, overarching theoretical frameworks have allowed researchers to grow beyond personal intuitions and culturally biased theories. They allow to verify and replicate existing findings, and to link disconnected results. The notion of self-play, albeit often cited in multiagent Reinforcement Learning, has never been grounded in a formal model. We present a formalized framework, with clearly defined assumptions, which encapsulates the meaning of self-play as abstracted from various existing self-play algorithms. This framework is framed as an approximation to a theoretical solution concept for multiagent training. On a simple environment, we qualitatively measure how well a subset of the captured self-play methods approximate this solution when paired with the famous PPO algorithm. We also provide insights on interpreting quantitative metrics of performance for self-play training. Our results indicate that, throughout training, various self-play definitions exhibit cyclic policy evolutions. Copyright © 2020, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Purchase Prediction in Free Online Games via Survival Analysis

Purchase Prediction in Free Online Games via Survival Analys...

引用

2019 IEEE International Conference on Big data, Big data 2019

作者： Yang, Wanshan Huang, Ting Zeng, Junlin Tang, Yan Chen, Lijun Mishra, Shivakant Liu, Youjian Eugene University of Colorado Department of Computer Science CO United States Yoozoo Games Department of Data Analytics Shanghai China University of Colorado Department of Electrical Computer Energy Engineering CO United States

ISBN: (纸本)9781728108582

In the free online game industry, in-game purchase prediction is an important research topic. On the one hand, knowing the players who are likely or unlikely to pay for the game can help the development of corresponding marketing strategies and incentives. On the other hand, the result of purchase prediction indicates the status of the game operation status and helps the game company allocate a reasonable amount of resources for the game. In this paper, we focus on predicting the purchase probability of paying players and finding important features. We consider two types of features related to players' playing and purchase behaviors. Then, based on these features we proposed, we use two different models to predict the survival probability for players and analyze the feature importance. © 2019 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MoCA: Incorporating multi-stage domain pretraining and cross-guided multimodal attention for Textbook Question Answering

arXiv

引用

arXiv 2021年

作者： Xu, Fangzhi Lin, Qika Liu, Jun Zhang, Lingling Zhao, Tianzhe Chai, Qi Pan, Yudai Department of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi'an Jiaotong University China

Textbook Question Answering (TQA) is a complex multimodal task to infer answers given large context descriptions and abundant diagrams. Compared with Visual Question Answering(VQA), TQA contains a large number of uncommon terminologies and various diagram inputs. It brings new challenges to the representation capability of language model for domain-specific spans. And it also pushes the multimodal fusion to a more complex level. To tackle the above issues, we propose a novel model named MoCA, which incorporates multi-stage domain pretraining and multimodal cross attention for the TQA task. Firstly, we introduce a multi-stage domain pretraining module to conduct unsupervised post-pretraining with the span mask strategy and supervised pre-finetune. Especially for domain post-pretraining, we propose a heuristic generation algorithm to employ the terminology corpus. Secondly, to fully consider the rich inputs of context and diagrams, we propose cross-guided multimodal attention to update the features of text, question diagram and instructional diagram based on a progressive strategy. Further, a dual gating mechanism is adopted to improve the model ensemble. The experimental results show the superiority of our model, which outperforms the state-of-the-art methods by 2.21% and 2.43% for validation and test split respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Textbooks

来源：评论

学校读者我要写书评

暂无评论

ALTERNATING ENERGY MINIMIZATION METHODS FOR MULTI-TERM MATRIX EQUATIONS

arXiv

引用

arXiv 2020年

作者： Kookjin, L.E.E. Elman, Howard C. Powell, Catherine E. Lee, Dongeun Extreme Scale Data Science and Analytics Department Sandia National Laboratories Department of Computer Science University of Maryland College Park United States Department of Mathematics University of Manchester United Kingdom Department of Computer Science Texas A&M University-Commerce

We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and approximations to each matrix are sought by solving certain minimization problems repeatedly. The solution methods we present are based on a rank-adaptive variant of alternating energy minimization methods that builds an approximation iteratively by successively computing a rank-one solution component at each step. We also develop efficient procedures to improve the accuracy of the low-rank approximate solutions computed using these successive rank-one update techniques. We explore the use of the methods with linear multi-term matrix equations that arise from stochastic Galerkin finite element discretizations of parameterized linear elliptic PDEs, and demonstrate their effectiveness with numerical studies. Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：