PolarityRank: Finding an equilibrium between followers and contraries in a network
| Autor: | José A. Troyano, Carlos G. Vallejo, Fermín L. Cruz, Fernando Enríquez |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Theoretical computer science
Computer science Sentiment analysis Library and Information Sciences Management Science and Operations Research Orientation (graph theory) Computer Science Applications law.invention Ranking (information retrieval) PageRank law Convergence (routing) Media Technology Relevance (information retrieval) Learning to rank Word (computer architecture) Information Systems |
| Zdroj: | Information Processing & Management. 48:271-282 |
| ISSN: | 0306-4573 |
| DOI: | 10.1016/j.ipm.2011.08.003 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect