In this paper, we present a new challenging task for emotion analysis, namely emotion cause extraction.In this task, we focus on the detection of emotion cause a.k.a the reason or the stimulant of an emotion, rather t...In this paper, we present a new challenging task for emotion analysis, namely emotion cause extraction.In this task, we focus on the detection of emotion cause a.k.a the reason or the stimulant of an emotion, rather than the regular emotion classification or emotion component extraction. Since there is no open dataset for this task available, we first designed and annotated an emotion cause dataset which follows the scheme of W3 C Emotion Markup Language. We then present an emotion cause detection method by using event extraction framework,where a tree structure-based representation method is used to represent the events. Since the distribution of events is imbalanced in the training data, we propose an under-sampling-based bagging algorithm to solve this problem. Even with a limited training set, the proposed approach may still extract sufficient features for analysis by a bagging of multi-kernel based SVMs method. Evaluations show that our approach achieves an F-measure 7.04%higher than the state-of-the-art methods.展开更多
In machines learning problems, Support Vector Machine is a method of classification. For non-linearly separable data, kernel functions are a basic ingredient in the SVM technic. In this paper, we briefly recall some u...In machines learning problems, Support Vector Machine is a method of classification. For non-linearly separable data, kernel functions are a basic ingredient in the SVM technic. In this paper, we briefly recall some useful results on decomposition of RKHS. Based on orthogonal polynomial theory and Mercer theorem, we construct the high power Legendre polynomial kernel on the cube [-1,1]<sup>d</sup>. Following presentation of the theoretical background of SVM, we evaluate the performance of this kernel on some illustrative examples in comparison with Rbf, linear and polynomial kernels.展开更多
基金supported by the National Natural Science Foundation of China(Nos.61370165,U1636103,and 61632011)Shenzhen Foundational Research Funding(Nos.JCYJ20150625142543470 and JCYJ20170307150024907)Guangdong Provincial Engineering Technology Research Center for Data Science(No.2016KF09)
文摘In this paper, we present a new challenging task for emotion analysis, namely emotion cause extraction.In this task, we focus on the detection of emotion cause a.k.a the reason or the stimulant of an emotion, rather than the regular emotion classification or emotion component extraction. Since there is no open dataset for this task available, we first designed and annotated an emotion cause dataset which follows the scheme of W3 C Emotion Markup Language. We then present an emotion cause detection method by using event extraction framework,where a tree structure-based representation method is used to represent the events. Since the distribution of events is imbalanced in the training data, we propose an under-sampling-based bagging algorithm to solve this problem. Even with a limited training set, the proposed approach may still extract sufficient features for analysis by a bagging of multi-kernel based SVMs method. Evaluations show that our approach achieves an F-measure 7.04%higher than the state-of-the-art methods.
文摘In machines learning problems, Support Vector Machine is a method of classification. For non-linearly separable data, kernel functions are a basic ingredient in the SVM technic. In this paper, we briefly recall some useful results on decomposition of RKHS. Based on orthogonal polynomial theory and Mercer theorem, we construct the high power Legendre polynomial kernel on the cube [-1,1]<sup>d</sup>. Following presentation of the theoretical background of SVM, we evaluate the performance of this kernel on some illustrative examples in comparison with Rbf, linear and polynomial kernels.
