Filters








4,802 Hits in 4.6 sec

A Regularization Method with Inference of Trust and Distrust in Recommender Systems [chapter]

Dimitrios Rafailidis, Fabio Crestani
2017 Lecture Notes in Computer Science  
So, we first propose an inference step with multiple random walks to predict the implicit-missing trust relationships that users might have in recommender systems, while considering users' explicit trust  ...  In this study we investigate the recommendation problem with trust and distrust relationships to overcome the sparsity of users' preferences, accounting for the fact that users trust the recommendations  ...  Dimitrios Rafailidis was supported by the COMPLEXYS and INFORTECH Research Institutes of University of Mons.  ... 
doi:10.1007/978-3-319-71246-8_16 fatcat:gcrng7g5yzdqzhtzzrpy3sf5qu

Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust

Fan Chung, Alexander Tsiatas, Wensong Xu
2013 Internet Mathematics  
Motivated by numerous models of representing trust and distrust within a network ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes.  ...  Furthermore, we give several algorithms for solving various trust-based ranking problems using Dirichlet PageRank with general boundary conditions.  ...  In [5] , the trust and distrust are propagated within a network through a weighted random walk W with a trusted seed vertex s by assigning at the start, the rank pr(s) = 1.  ... 
doi:10.1080/15427951.2012.678194 fatcat:eurjppigebbvrkmdqe7hbt2nsy

A Novel Approach to Propagating Distrust [chapter]

Christian Borgs, Jennifer Chayes, Adam Tauman Kalai, Azarakhsh Malekian, Moshe Tennenholtz
2010 Lecture Notes in Computer Science  
The Page Rank [9] algorithm ranks web pages by propagating trust throughout a network, and similar algorithms have been designed for recommendation systems.  ...  Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks.  ...  While the above axiom is admittedly involved, it is satisfied by the Random Walk system of Andersen et al., and is very much in line with the notion of propagation in a random walk.  ... 
doi:10.1007/978-3-642-17572-5_8 fatcat:sby7tkfqgnhorf2ng7r4gxo3uu

Survey of Sybil Attacks in Networks [chapter]

Wei Chang, Jie Wu
2014 Sensor Networks for Sustainable Development  
In a large region, multiple sensors are randomly and uniformly deployed. Each sensor measures its surrounding temperature, and further forwards the readings to a sink node, which collects the data.  ...  By the end of the paper, we will provide some predictions about directions for future research.  ...  From each of the seeds, the server conducts an l-length random walk, and the generated random paths compose V 's distrust social profile; again, all random walkers are moving along trust edges.  ... 
doi:10.1201/b17124-28 fatcat:ou3n2jbm5narpeeuxvdhuq5wl4

Dirichlet PageRank and Trust-Based Ranking Algorithms [chapter]

Fan Chung, Alexander Tsiatas, Wensong Xu
2011 Lecture Notes in Computer Science  
Motivated by numerous models of representing trust and distrust within a graph ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes.  ...  We then give several algorithms for various trust-based ranking problems using Dirichlet PageRank with boundary conditions, showing several applications of our algorithms.  ...  From the examples above, we see that Dirichlet PageRank with boundary conditions is a useful tool, especially in modeling trust and distrust in a network ranking system.  ... 
doi:10.1007/978-3-642-21286-4_9 fatcat:3zxamgloyzdyfjlqtbgyk3l2qy

Exploiting Trust and Distrust Information to Combat Sybil Attack in Online Social Networks [chapter]

Huanhuan Zhang, Chang Xu, Jie Zhang
2014 IFIP Advances in Information and Communication Technology  
In this paper, we propose an unified ranking mechanism by leveraging trust and distrust in social networks against such kind of attacks based on a variant of the PageRank-like model.  ...  However, most of graph-based approaches pay little attention to the distrust information, which is an important factor for uncovering more Sybils.  ...  This work is supported by the MoE AcRF Tier 2 Grant M4020110.020 and the ACI Seed Funding M4080962.C90 awarded to Dr. Jie Zhang.  ... 
doi:10.1007/978-3-662-43813-8_6 fatcat:byuusdhklngnvkdetzrjk32gam

The Troll-Trust Model for Ranking in Signed Networks

Zhaoming Wu, Charu C. Aggarwal, Jimeng Sun
2016 Proceedings of the Ninth ACM International Conference on Web Search and Data Mining - WSDM '16  
Specifically, we propose the Troll-Trust model that models the probability of trustworthiness of individual data sources as an interpretation for the underlying ranking values.  ...  Examples of such problems include community detection, link prediction, and low rank approximation. In this paper, we will examine the problem of ranking nodes in signed networks.  ...  In the traditional random walk model, each node is associated with a probability of visit π(i).  ... 
doi:10.1145/2835776.2835816 dblp:conf/wsdm/WuAS16 fatcat:jaazkyhmf5dcnbfxpncuwxb5fu

SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

Bita Shams, Saman Haratizadeh
2016 Physica A: Statistical Mechanics and its Applications  
SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.  ...  Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability.  ...  Ranking nodes in signed network have mainly been studied in the domain of trust/distrust relationships: Guha, et al.  ... 
doi:10.1016/j.physa.2016.04.025 fatcat:nj2fxmz7prfjlhvycdjyo6xl4q

Uncovering the mystery of trust in an online social network

Guangchi Liu, Qing Yang, Honggang Wang, Shaoen Wu, Mike P. Wittie
2015 2015 IEEE Conference on Communications and Network Security (CNS)  
, 4) users live in many separate "small small worlds" from the perspective of trust and it is difficult to identify these "small small worlds" with existing random walk-based community detection algorithms  ...  We found that 1) the trust between users are asymmetric, 2) high degree users are usually associated with high trust, 3) diversity in people's opinions on the same person will affect indirect trust inference  ...  In [18] , Mohaisen, A. et al. proposed a derivation of random walk algorithm, which employs biased random mechanism, to account for trust and other social ties.  ... 
doi:10.1109/cns.2015.7346861 dblp:conf/cns/LiuYWWW15 fatcat:y5newwf3czh2ngw26m4umff2au

Matrix Factorization with Explicit Trust and Distrust Relationships [article]

Rana Forsati, Mehrdad Mahdavi, Mehrnoush Shamsfard, Mohamed Sarwat
2014 arXiv   pre-print
For instance, in Epinions the concepts of personal "web of trust" and personal "block list" allow users to categorize their friends based on the quality of reviews into trusted and distrusted friends,  ...  In this paper, we propose a matrix factorization based model for recommendation in social rating networks that properly incorporates both trust and distrust relationships aiming to improve the quality  ...  Each random walk on the user trust graph returns a predicted rating for user u on target item i .  ... 
arXiv:1408.0325v1 fatcat:vpg2ngkijvaphn2bq3y62tefxm

Multirelational Social Recommendations via Multigraph Ranking

Mingsong Mao, Jie Lu, Guangquan Zhang, Jinlong Zhang
2017 IEEE Transactions on Cybernetics  
Performing More Random Walks original social network, a single random walk is started from Multiple random walks start from the source user to seek the source user to reach the target  ...  For more precise predictions, we can issue Ester [5] to perform random walks on the vertices, as elaborated multiple random walks from the source user and then aggregate below.  ... 
doi:10.1109/tcyb.2016.2595620 pmid:28113690 fatcat:qt6naqquwrbixoaqoi5gsegu6m

Friend or frenemy?

Shuang-Hong Yang, Alexander J. Smola, Bo Long, Hongyuan Zha, Yi Chang
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
., trust, true friendship) or negative (i.e., distrust, possible frenemy) relations.  ...  Facebook, Myspace) into a signed trust-distrust network (e.g. Epinion, Slashdot).  ...  Acknowledgements We thank Su-Lin Wu for helpful discussions. Part of this work was supported by NSF Grants IIS-1049694 and IIS-1116886, and NSFC grant 61129001/F010403.  ... 
doi:10.1145/2348283.2348359 dblp:conf/sigir/YangSLZC12 fatcat:n7wrvufdtfa6hipilnbfmzlvka

Survey on web spam detection

Nikita Spirin, Jiawei Han
2012 SIGKDD Explorations  
In this paper we present a systematic review of web spam detection techniques with the focus on algorithms and underlying principles.  ...  We also define the concept of web spam numerically and provide a brief survey on various spam forms. Finally, we summarize the observations and underlying principles applied for web spam detection.  ...  rank is the best for trust propagation, while harmonic rank better suits for distrust propagation.  ... 
doi:10.1145/2207243.2207252 fatcat:euakka22anfs7cbwatkguk224e

Matrix Factorization with Explicit Trust and Distrust Side Information for Improved Social Recommendation

Rana Forsati, Mehrdad Mahdavi, Mehrnoush Shamsfard, Mohamed Sarwat
2014 ACM Transactions on Information Systems  
For instance, in Epinions, the concepts of personal "web of trust" and personal "block list" allow users to categorize their friends based on the quality of reviews into trusted and distrusted friends,  ...  Matrix factorization with explicit trust and distrust side information for improved social recommendation.  ...  ACKNOWLEDGMENTS The authors would like to thank the Associate Editor and three anonymous reviewers for their immensely insightful comments and helpful suggestions on the original version of this article  ... 
doi:10.1145/2641564 fatcat:cmyhtjwj5fehfgoik46ureo3by

Leveraging trust and distrust for sybil-tolerant voting in online social media

Nitin Chiluka, Nazareno Andrade, Johan Pouwelse, Henk Sips
2012 Proceedings of the 1st Workshop on Privacy and Security in Online Social Media - PSOSM '12  
Modeling trust and distrust in the system as a signed network, our method proceeds in two phases.  ...  This work proposes a mechanism to defend against such an attack by leveraging (i) trust which is inherent in the social network among users in OSM, and (ii) distrust between honest users, who identify  ...  , and by CNPq (grant 480855/2010-2).  ... 
doi:10.1145/2185354.2185355 fatcat:bf7ostvkpnebjdnivvbzowayra
« Previous Showing results 1 — 15 out of 4,802 results