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

GANtron: Emotional speech synthesis with generative adversarial networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Hortal, Enrique Alarcia, Rodrigo Brechard Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

Speech synthesis is used in a wide variety of industries. Nonetheless, it always sounds flat or robotic. The state of the art methods that allow for prosody control are very cumbersome to use and do not allow easy tuning. To tackle some of these drawbacks, in this work we target the implementation of a text-to-speech model where the inferred speech can be tuned with the desired emotions. To do so, we use Generative Adversarial Networks (GANs) together with a sequence-to-sequence model using an attention mechanism. We evaluate four different configurations considering different inputs and training strategies, study them and prove how our best model can generate speech files that lie in the same distribution as the initial training dataset. Additionally, a new strategy to boost the training convergence by applying a guided attention loss is *** Codes 68-T07, 62H30 © 2021, CC BY-NC-SA.

关键词： Generative adversarial networks

Symbolic regression for scientific discovery: An application to wind speed forecasting

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Abdellaoui, Ismail Alaoui Mehrkanoon, Siamak Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

Symbolic regression corresponds to an ensemble of techniques that allow to uncover an analytical equation from data. Through a closed form formula, these techniques provide great advantages such as potential scientific discovery of new laws, as well as explainability, feature engineering as well as fast inference. Similarly, deep learning based techniques has shown an extraordinary ability of modeling complex patterns. The present paper aims at applying a recent end-to-end symbolic regression technique, i.e. the equation learner (EQL), to get an analytical equation for wind speed forecasting. We show that it is possible to derive an analytical equation that can achieve reasonable accuracy for short term horizons predictions only using few number of features. © 2021, CC BY-SA.

关键词： Forecasting

General game heuristic prediction based on ludeme descriptions

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Stephenson, Matthew Soemers, Dennis J.N.J. Piette, Éric Browne, Cameron Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

This paper investigates the performance of different general-game-playing heuristics for games in the Ludii general game system. Based on these results, we train several regression learning models to predict the performance of these heuristics based on each game’s description file. We also provide a condensed analysis of the games available in Ludii, and the different ludemes that define them. Copyright © 2021, The Authors. All rights reserved.

关键词： data mining

General board game concepts

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Éric Piette, E.P. Stephenson, Matthew Soemers, Dennis J.N.J. Browne, Cameron Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

Many games often share common ideas or aspects between them, such as their rules, controls, or playing area. However, in the context of General Game Playing (GGP) for board games, this area remains under-explored. We propose to formalise the notion of "game concept", inspired by terms generally used by game players and designers. Through the Ludii General Game System, we describe concepts for several levels of abstraction, such as the game itself, the moves played, or the states reached. This new GGP feature associated with the ludeme representation of games opens many new lines of research. The creation of a hyper-agent selector, the transfer of AI learning between games, or explaining AI techniques using game terms, can all be facilitated by the use of game concepts. Other applications which can benefit from game concepts are also discussed, such as the generation of plausible reconstructed rules for incomplete ancient games, or the implementation of a board game recommender system. Copyright © 2021, The Authors. All rights reserved.

关键词： Game theory

Emotion Recognition System via Facial Expressions and Speech Using Machine Learning and Deep Learning Techniques

学校读者我要写书评

暂无评论

SN Computer science 2023年第4期4卷 363页

作者： Chaudhari, Aayushi Bhatt, Chintan Nguyen, Thanh Thi Patel, Nisarg Chavda, Kirtan Sarda, Kalind U & P U. Patel Department of Computer Engineering Chandubhai S. Patel Institute of Technology Charotar University of Science And Technology (CHARUSAT) Gujarat Changa 388421 India Department of Computer Science and Engineering School of Technology Pandit Deendayal Energy University Knowledge Corridor Gujarat Gandhinagar 382007 India School of Information Technology Faculty of Science Engineering and Built Environment Deakin University Victoria 3216 Australia Bishop University 2600 College St Sherbrooke J1M 1Z7 QC Canada Crest Data Systems Private Limited Gandhinagar Highway Makarba Gujarat Ahmedabad 380051 India Programmer Analyst Meditab Software Pvt Ltd Kalasagar Mall Ghatlodiya Gujarat Ahmedabad 380061 India

Patients in hospitals frequently exhibit psychological issues such as sadness, pessimism, eccentricity, and anxiety. However, hospitals normally lack tools and facilities to continuously monitor the psychological health of patients. It is desirable to identify depression in patients so that it can be managed by instantly providing better therapy. This can be possible by advances in machine learning for image processing with notable applications in the domain of emotion recognition using facial expressions. In this paper, we have proposed two different methods, i.e. facial expression detection and voice analysis, to predict emotions. For facial expression recognition, we have used two approaches, one is the use of Gabor filters for feature extraction with support vector machine for classification and another is using convolutional neural network (CNN). For voice analysis, we extracted mel-frequency cepstral coefficients from speech data and, based on those features, predicted the emotions of the speech using a CNN model. Experimental results show that our proposed emotion recognition methods obtained high accuracy and thus could be potentially deployed to real-world applications. © 2023, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： CNN Deep learning Expressions Facial emotion Machine learning Speech SVM

LSBert: Lexical Simplification Based on BERT

学校读者我要写书评

暂无评论

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 3064-3076页

作者： Qiang, Jipeng Li, Yun Zhu, Yi Yuan, Yunhao Shi, Yang Wu, Xindong Department of Computer Science Jiangsu Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Anhui Hefei China Mininglamp Academy of Sciences Minininglamp Beijing 100864 China

Lexical simplification (LS) aims at replacing complex words with simpler alternatives. LS commonly consists of three main steps: complex word identification, substitute generation, and substitute ranking. Existing LS methods focus on the contextual information of the complex word in the last step (substitute ranking). However, they miss out the following two facts: (1) The word complexity of a polysemous word is very closely related to its context;(2) The step of substitute generation regardless of the context will inevitably produce a large number of spurious candidates. Therefore, we propose a novel LS system LSBert based on pretrained language model BERT to address the aforementioned issues, which is capable of making use of the wider context when both identifying the words in need of simplification and generating substitute candidates for the complex words. Specifically, LSBert consists of a network for complex word identification by fine-tuning BERT and a network for substitute generation based on BERT. Experimental results show that LSBert performs well in both complex word identification and substitute generation, achieving state-of-the-art results in three benchmarks. © 2014 IEEE.

关键词： BERT Complex word identification Lexical simplification Sentence simplification

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classificati...

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Zeyu Mao, Anyu Wu, Jialun Li, Yang Wang, Chunbao Ding, Caixia Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China The First Affiliated Hospital of Xi'an Jiaotong University Department of Pathology Xi'an China Shaanxi Provincial Cancer Hospital Department of Pathology Xi'an China

ISBN: (纸本)9781665468190

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as 'suspicious' regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance. © 2022 IEEE.

关键词： Diseases

CLDG: Contrastive Learning on Dynamic Graphs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2024, CC BY.

关键词： Contrastive Learning

Unifying Large Language Models and knowledge Graphs: A Roadmap

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Shirui Luo, Linhao Wang, Yufei Chen, Chen Wang, Jiapu Wu, Xindong Griffith University QLD Australia The Department of Data Science and AI Monash University Melbourne Australia The Nanyang Technological University Singapore The Faculty of Information Technology Beijing University of Technology Beijing China The Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei China The Research Center for Knowledge Engineering Zhejiang Lab Hangzhou China

Large language models (LLMs), such as ChatGPT and GPT4, are making new waves in the field of natural language processing and artificial intelligence, due to their emergent ability and generalizability. However, LLMs are black-box models, which often fall short of capturing and accessing factual knowledge. In contrast, knowledge Graphs (KGs), Wikipedia and Huapu for example, are structured knowledge models that explicitly store rich factual knowledge. KGs can enhance LLMs by providing external knowledge for inference and interpretability. Meanwhile, KGs are difficult to construct and evolve by nature, which challenges the existing methods in KGs to generate new facts and represent unseen knowledge. Therefore, it is complementary to unify LLMs and KGs together and simultaneously leverage their advantages. In this article, we present a forward-looking roadmap for the unification of LLMs and KGs. Our roadmap consists of three general frameworks, namely, 1) KG-enhanced LLMs, which incorporate KGs during the pre-training and inference phases of LLMs, or for the purpose of enhancing understanding of the knowledge learned by LLMs;2) LLM-augmented KGs, that leverage LLMs for different KG tasks such as embedding, completion, construction, graph-to-text generation, and question answering;and 3) Synergized LLMs + KGs, in which LLMs and KGs play equal roles and work in a mutually beneficial way to enhance both LLMs and KGs for bidirectional reasoning driven by both data and knowledge. We review and summarize existing efforts within these three frameworks in our roadmap and pinpoint their future research directions. Copyright © 2023, The Authors. All rights reserved.

关键词： knowledge graph