Difference between revisions of "Leskovecl et al., 2010,Predicting Positive and Negative Linksin Online Social Networks"
(Created page with '== Online version == An online version of this paper is available at the [[http://portal.acm.org/ft_gateway.cfm?id=1718518&type=pdf&CFID=7653019&CFTOKEN=17876787 ACM digital lib…') |
|||
Line 1: | Line 1: | ||
== Online version == | == Online version == | ||
− | An online version of this paper is available | + | An online version of this paper is available [http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.2429v1.pdf here]. |
== Summary == | == Summary == | ||
− | [[AddressesProblem:: | + | Machine learning has previously been used as a way of [[AddressesProblem::Determining Social Network Attributes]]. This [[Category::paper]] follows this path and addresses a sub-problem: predicting negative links in social networks. Certain social networks allow you to express negative relations with other users, such as Slashdot (foes), Epinions (distrust) and Wikipedia (voting down). This paper introduces ways of predicting these negative relations, and propose explanations for the models that are based on psychology theory. Finally, they use a [[UsesDataset::SlashDot dataset]] to evaluate the quality of their approach. |
== Key Contributions == | == Key Contributions == | ||
− | + | Ways of predicting negative relations in social networks. | |
== Models == | == Models == | ||
− | === | + | === Logistic Regression === |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
The above continuous model isn't truly continuous has it has to be simulated using increment on the variable t. This process requires long run time for testing. For this reason, the authors present a discrete time model which assumes that the probability of a user influencing his neighbors his constant over a certain window of time after an action. | The above continuous model isn't truly continuous has it has to be simulated using increment on the variable t. This process requires long run time for testing. For this reason, the authors present a discrete time model which assumes that the probability of a user influencing his neighbors his constant over a certain window of time after an action. | ||
Revision as of 00:09, 25 March 2011
Contents
Online version
An online version of this paper is available here.
Summary
Machine learning has previously been used as a way of Determining Social Network Attributes. This paper follows this path and addresses a sub-problem: predicting negative links in social networks. Certain social networks allow you to express negative relations with other users, such as Slashdot (foes), Epinions (distrust) and Wikipedia (voting down). This paper introduces ways of predicting these negative relations, and propose explanations for the models that are based on psychology theory. Finally, they use a SlashDot dataset to evaluate the quality of their approach.
Key Contributions
Ways of predicting negative relations in social networks.
Models
Logistic Regression
The above continuous model isn't truly continuous has it has to be simulated using increment on the variable t. This process requires long run time for testing. For this reason, the authors present a discrete time model which assumes that the probability of a user influencing his neighbors his constant over a certain window of time after an action.
Experiments and Evaluation
The different models are evaluated with a ROC curve with true positive rate and false positive rate varying for different threshold values. The threshold value controls how much influence a user need to have from his neighbors in order to do the action (e.g., join a group). The result show that the static model fail to perform as well as the two temporally aware models, which probably indicates that influence does vary over time in social networks. Also, although discrete and continuous time models show similar performance, the discrete model has a faster run time.