The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
ACM Transactions on Computer Systems (TOCS)
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
ACM Transactions on Computer Systems (TOCS)
Trust-aware recommender systems
Proceedings of the 2007 ACM conference on Recommender systems
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Controversial users demand local trust metrics: an experimental study on Epinions.com community
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
P2P trading in social networks: the value of staying connected
INFOCOM'10 Proceedings of the 29th conference on Information communications
GoDisco: selective gossip based dissemination of information in social community based overlays
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
The GOSSPLE anonymous social network
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Bayesian network trust model in peer-to-peer networks
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
Hi-index | 0.00 |
The pervasiveness of the Internet has lead research and applications to focus more and more on their users. Online social networks such as Facebook provide users with the ability to maintain an unprecedented number of social connections. Recommendation systems exploit the opinions of other users to suggest movies or products based on our similarity with them. This shift from machines to users motivates the emergence of novel applications and research challenges. In this paper, we embrace the social aspects of the Web 2.0 by considering a novel problem. We build a distributed social market that combines interest-based social networks with explicit networks like Facebook. Our Social Market (SM) allows users to identify and build connections to other users that can provide interesting goods, or information. At the same time, it backs up these connections with trust, by associating them with paths of trusted users that connect new acquaintances through the explicit network. This convergence of implicit and explicit networks yields TAPS, a novel gossip protocol that can be applied in applications devoted to commercial transactions, or to add robustness to standard gossip applications like dissemination or recommendation systems.