Name
Abstract | ||
|---|---|---|
Social Sciences identify similarity and mutual trust as main criteria to consider in group formation processes. On this basis, we present a group formation technique which exploits measures of both similarity and trust, in order to improve the compactness of groups in Online Social Networks. Similarity and trust have been jointly exploited to design two algorithms designed to match groups and users, in order to capture the gain of a user who desires to join with a group and the benefit of the group itself. Experimental results show that trust is more valuable than similarity in forming groups and that the two proposed algorithms are capable to deal with large networks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-26148-5_4 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Social capital,Latent Dirichlet allocation,Large networks,Internet privacy,Social network,Computer science,Theoretical computer science,Compact space,Exploit,User agent,Distributed computing,Reputation | Conference | 9415 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
21 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasquale De Meo | 1 | 741 | 48.91 |
| Fabrizio Messina | 2 | 363 | 37.95 |
| Giuseppe Pappalardo | 3 | 595 | 63.41 |
| Domenico Rosaci | 4 | 779 | 55.81 |
| Giuseppe M. L. Sarnè | 5 | 518 | 37.32 |