Abstract
Dishonest behaviors in on-line networks include the problems caused by those actions performed by certain elements in a network in order to obtain some kind of benefits from the system. The analysis of this phenomenon concerns the WWW from two points of view: the Web as a collection of interrelated documents, and the social networks. In this work we study the web spam detection and the computation of trust and reputation in on-line social networks. We propose two graph-based ranking algorithms, based on different propagation models that spread the information from a set of elements in the network to compute the global relevance of all the nodes in the system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
