检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:金宇[1] 朱洪波[1] 王亚强[1] 陈黎[1] 于中华[1]
出 处:《计算机工程与应用》2011年第34期164-167,共4页Computer Engineering and Applications
基 金:国家自然科学基金重大研究计划项目(No.90409007)
摘 要:态度挖掘是近年来文本挖掘领域的热点课题之一,旨在发现文本中作者的主观态度倾向,为基于舆情的决策过程提供支持。目前已有的态度挖掘算法绝大多数都基于情感词典来识别情感词,在此基础上判别句子或文本的总体态度倾向。然而,手工构造和维护一部完善的情感词典是不现实的。对中文情感词的极性判别问题进行了研究,提出了基于直推式学习的中文情感词极性判别算法。该算法以少量情感词为种子,利用词典中词汇的解释信息,直推出其他词的情感极性。与使用相同情感种子词的解释信息作为训练数据的有监督学习算法相比,直推式学习算法的识别精度提高了20%左右。In recent years,opinion mining has become one of the hottest topics in the text mining field.It aims to discover the author's opinion polarity in texts and thus to provide support for decision-making process based on the public opinion.Up to now,most of the algorithms developed for opinion mining use an opinion word dictionary to identify the opinion words occurring in a sentence or text and then determine the polarity of the sentence or text based on polarities of these words.However,it's not realistic to construct and maintain manually a perfect opinion word dictionary.Therefore,the problem of determining the polarities of Chinese opinion words is investigated,and an algorithm based on transductive learning is proposed to solve the problem.This algorithm uses a few opinion words as seeds and performs polarity transduction from the seeds to other words based on their dictionary interpretations.Compared with supervised learning algorithms,which use the interpretations of the same seeds as the training data,the transduction-based algorithm has obtained an accuracy improvement of about 20%.
关 键 词:态度挖掘 情感词识别 极性判别 直推式学习 词典解释
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229