Name
Abstract | ||
|---|---|---|
Nowadays, we are interconnected with people whether professionally or personally using different social networks. However, we sometimes receive messages or advertisements that are not correlated to the nature of the relation established between the persons. Therefore, it became important to be able to sort out our relationships. Thus, based on the type of links that connect us, we can decide if this last is spammed and should be deleted. Thereby, we propose in this paper a belief approach in order to detect the spammed links. Our method consists on modelling the belief that a link is perceived as spammed by taking into account the prior information of the nodes, the links and the messages that pass through them. To evaluate our method, we first add some noise to the messages, then to both links and messages in order to distinguish the spammed links in the network. Second, we select randomly spammed links of the network and observe if our model is able to detect them. The results of the proposed approach are compared with those of the baseline and to the k-nn algorithm. The experiments indicate the efficiency of the proposed model. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.5220/0007364906020609 | PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2 |
Keywords | Field | DocType |
Social Networks, Communities, Theory of Belief Functions, Probability | Social network,Computer science,sort,Artificial intelligence,Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salma Ben Dhaou | 1 | 0 | 1.01 |
| Mouloud Kharoune | 2 | 4 | 3.46 |
| Arnaud Martin | 3 | 158 | 18.26 |
| Boutheina Ben Yaghlane | 4 | 189 | 33.49 |