One of the challenges in Speech Emotion Recognition (SER) "in the wild" is the large mismatch between training and test data (e.g. speakers and tasks). In order to improve the generalisation capabilities of the emotion models, we propose to use Multi-Task Learning (MTL) and use gender and naturalness as auxiliary tasks in deep neural networks. This method was evaluated in within-corpus and various cross-corpus classification experiments that simulate conditions "in the wild". In comparison to Single-Task Learning (STL) based state of the art methods, we found that our MTL method proposed improved performance significantly. Particularly, models using both gender and naturalness achieved more gains than those using either gender or naturalness separately. This benefit was also found in the high-level representations of the feature space, obtained from our method proposed, where discriminative emotional clusters could be observed.
As deep learning has gained a lot of interest and showed promising results in various fields of automatic speech analysis @cite_16 , it is being actively investigated in the field of SER too. Especially, by using representation learning @cite_24 , there has been effort to extract unsupervised features which generalise emotional speech rather than engineered features (e.g. pitch) @cite_22 @cite_1 . @cite_25 @cite_0 proposed an intrinsic way to build a high-level representation of emotion using the engineered features. They extracted segment-level engineered features (e.g. Mel-Frequency Cepstral Coefficients (MFCC) and pitch) and modelled probabilities of emotional categories using Deep Neural Network (DNN) @cite_25 and Bi-directional LSTM (BLSTM) @cite_0 . Then, functionals of the probabilities were used to extract utterance-level features, denoted as high-level feature representation. Extreme Learning Machine (ELM) using the utterance-level features outperformed conventional approaches such as HMM, SVM, and BLSTM. More recently, @cite_22 showed that unsupervised representation learning has limitation in complex subsequent structures for affect compared to @cite_0 's approach. Therefore, we chose @cite_25 @cite_0 's architectures as baselines (single task learning) and compared it to our proposal and will investigate the effectiveness of MTL in various settings.
@cite_22 @cite_1 @cite_24 @cite_0 @cite_16 @cite_25
2232901134 2399733683 2163922914 2408520939 2295001676
Abstract Speech emotion recognition is a challenging problem partly be-cause it is unclear what features are effective for the task. Inthis paper we propose to utilize deep neural networks (DNNs)to extract high level features from raw data and show that theyare effective for speech emotion recognition. We rst producean emotion state probability distribution for each speech seg-ment using DNNs. We then construct utterance-level featuresfrom segment-level probability distributions. These utterance-level features are then fed into an extreme learning machine(ELM),aspecialsimpleandefcientsingle-hidden-layer neuralnetwork, to identify utterance-level emotions. The experimen-tal results demonstrate that the proposed approach effectivelylearns emotional information from low-level features and leadsto 20 relative accuracy improvement compared to the state-of-the-art approaches. IndexTerms : Emotion recognition, Deep neural networks, Ex-treme learning machine 1. Introduction Despite the great progress made in articial intelligence, weare still far from being able to naturally interact with machines,partly because machines do not understand our emotion states.Recently, speech emotion recognition, which aims to recognizeemotion states from speech signals, has been drawing increas-ing attention. Speech emotion recognition is a very challengingtask of which extracting effective emotional features is an openquestion [1, 2].Adeep neural network (DNN) is afeed-forward neural net-work that has more than one hidden layers between its inputsand outputs. It is capable of learning high-level representationfrom the raw features and effectively classifying data [3, 4].With sufcient training data and appr In recent years scholars have built maps of science by connecting the academic fields that cite each other, are cited together, or that cite a similar literature. But since scholars cannot always publish in the fields they cite, or that cite them, these science maps are only rough proxies for the potential of a scholar, organization, or country, to enter a new academic field. Here we use a large dataset of scholarly publications disambiguated at the individual level to create a map of science-or research space-where links connect pairs of fields based on the probability that an individual has published in both of them. We find that the research space is a significantly more accurate predictor of the fields that individuals and organizations will enter in the future than citation based science maps. At the country level, however, the research space and citations based science maps are equally accurate. These findings show that data on career trajectories-the set of fields that individuals have previously published in-provide more accurate predictors of future research output for more focalized units-such as individuals or organizations-than citation based science maps. A citing sentence is one that appears in a scientific article and cites previous work. Citing sentences have been studied and used in many applications. For example, they have been used in scientific paper summarization, automatic survey generation, paraphrase identification, and citation function classification. Citing sentences that cite multiple papers are common in scientific writing. This observation should be taken into consideration when using citing sentences in applications. For instance, when a citing sentence is used in a summary of a scientific paper, only the fragments of the sentence that are relevant to the summarized paper should be included in the summary. In this paper, we present and compare three different approaches for identifying the fragments of a citing sentence that are related to a given target reference. Our methods are: word classification, sequence labeling, and segment classification. Our experiments show that segment classification achieves the best results. In a document network such as a citation network of scientific documents, web-logs, etc., the content produced by authors exhibits their interest in certain topics. In addition some authors influence other authors' interests. In this work, we propose to model the influence of cited authors along with the interests of citing authors. Moreover, we hypothesize that apart from the citations present in documents, the context surrounding the citation mention provides extra topical information about the cited authors. However, associating terms in the context to the cited authors remains an open problem. We propose novel document generation schemes that incorporate the context while simultaneously modeling the interests of citing authors and influence of the cited authors. Our experiments show significant improvements over baseline models for various evaluation criteria such as link prediction between document and cited author, and quantitatively explaining unseen text. Citation relationship between scientific publications has been successfully used for scholarly bibliometrics, information retrieval and data mining tasks, and citation-based recommendation algorithms are well documented. While previous studies investigated citation relations from various viewpoints, most of them share the same assumption that, if paper1 cites paper2 (or author1 cites author2), they are connected, regardless of citation importance, sentiment, reason, topic, or motivation. However, this assumption is oversimplified. In this study, we employ an innovative "context-rich heterogeneous network" approach, which paves a new way for citation recommendation task. In the network, we characterize 1) the importance of citation relationships between citing and cited papers, and 2) the topical citation motivation. Unlike earlier studies, the citation information, in this paper, is characterized by citation textual contexts extracted from the full-text citing paper. We also propose algorithm to cope with the situation when large portion of full-text missing information exists in the bibliographic repository. Evaluation results show that, context-rich heterogeneous network can significantly enhance the citation recommendation performance. Abstract Documents in computer-readable form can be used to provide information about other documents, i.e. those they cite. To do this efficiently requires procedures for computer recognition of citing statements. This is not easy, especially for multi-sentence citing statements. Computer recognition procedures have been developed which are accurate to the following extent: 73 of the words in statements selected by computer procedures as being citing statements are words which are correctly attributable to the corresponding documents. The retrieval effectiveness of computer-recognized citing statements was tested in the following way. First, for eight retrieval requests in inorganiic chemistry, average recall by search of Chemical Abstracts Service indexing and Chemical Abstracts abstract text words was found to be 50 . Words from citing statements referring to the papers to be retrieved were then added to the index terms and abstract words as additional access points, and searching was repeated. Average recall increased to 70 . Only words from citing statements published within a year of the cited papers were used. The retrieval effect of citing statement words alone (published within a year) without index or abstract terms was the following: average recall was 40 . When just the words of the titles of the cited papers were added to those citing statement words, average recall increased to 50 .