PolarityRank: Finding an equilibrium between followers and contraries in a network

被引:20
作者
Cruz, Fermin L. [1 ]
Vallejo, Carlos G. [1 ]
Enriquez, Fernando [1 ]
Troyano, Jose A. [1 ]
机构
[1] Univ Seville, Dept Comp Languages & Syst, E-41012 Seville, Spain
关键词
Ranking algorithms; Graphs; Relevance computing; Sentiment analysis; Data mining;
D O I
10.1016/j.ipm.2011.08.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we present the relevance ranking algorithm named PolarityRank. This algorithm is inspired in PageRank, the webpage relevance calculus method used by Google, and generalizes it to deal with graphs having not only positive but also negative weighted arcs. Besides the definition of our algorithm, this paper includes the algebraic justification, the convergence demonstration and an empirical study in which PolarityRank is applied to two unrelated tasks where a graph with positive and negative weights can be built: the calculation of word semantic orientation and instance selection from a learning dataset. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:271 / 282
页数:12
相关论文
共 23 条
[1]  
AHA DW, 1991, MACH LEARN, V6, P37, DOI 10.1007/BF00153759
[2]  
[Anonymous], 2004, VLDB
[3]  
[Anonymous], 2004, COLING 2004 P 20 INT
[4]  
[Anonymous], 2010, P INT C WORLD WID WE
[5]  
[Anonymous], 2005, WWW '05
[6]  
[Anonymous], 2004, Using WordNet to Measure Semantic Orientations of Adjectives
[7]  
[Anonymous], 2007, Uci machine learning repository
[8]  
[Anonymous], 2004, PODS, DOI DOI 10.1145/1055558.1055568
[9]  
Bo Pang, 2008, Foundations and Trends in Information Retrieval, V2, P1, DOI 10.1561/1500000001
[10]  
Cerini S., 2007, Language resources and linguistic theory: Typology, second language acquisition, english linguistics, Franco Angeli, Milano, IT