{"title":"Analyzing semantic orientation of terms using Affinity Propagation","authors":"Yan Li, Si Li, Weiran Xu, Jun Guo","doi":"10.1109/ISCSLP.2012.6423494","DOIUrl":null,"url":null,"abstract":"The aim of term semantic orientation analysis is to mine the sentiment polarity of words and phrases from their contexts. This paper presents a novel algorithm called Affinity Propagation to analyze semantic orientations of terms. Specifically, we build an informative graph from text corpus using an efficient Word Activation Force model and regard each term as a node in the graph. Then we propagate opinionated information over the whole graph using only a small number of seed terms. We finally utilize affinity vectors rather than context vectors to detect term polarities and construct the polarity lexicons. Evaluations on our proposed algorithm show its advantages over the state-of-the-art algorithms. And further improvements can be obtained by combining Affinity Propagation with Pointwise Mutual Information.","PeriodicalId":186099,"journal":{"name":"2012 8th International Symposium on Chinese Spoken Language Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 8th International Symposium on Chinese Spoken Language Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSLP.2012.6423494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The aim of term semantic orientation analysis is to mine the sentiment polarity of words and phrases from their contexts. This paper presents a novel algorithm called Affinity Propagation to analyze semantic orientations of terms. Specifically, we build an informative graph from text corpus using an efficient Word Activation Force model and regard each term as a node in the graph. Then we propagate opinionated information over the whole graph using only a small number of seed terms. We finally utilize affinity vectors rather than context vectors to detect term polarities and construct the polarity lexicons. Evaluations on our proposed algorithm show its advantages over the state-of-the-art algorithms. And further improvements can be obtained by combining Affinity Propagation with Pointwise Mutual Information.