Nowadays social media are important tools for web resource discovery. The performance and capabilities of web searches are vital, especially search results from social research paper bookmarking. This paper proposes a new algorithm for ranking method that is a combination of similarity ranking with paper posted time or CSTRank. The paper posted time is static ranking for improving search result...

Social networks have garnered much attention recently. Several studies have been undertaken to extract social networks among people, companies, and so on automatically from the web. For use in social sciences, social networks enable analyses of the performance and valuation of companies. This paper describes an attempt to learn ranking of entities from a social network that has been mined from ...

This paper explores utilization of information from social networks in making automatic movie recommendations. Implementations of three different algorithms (SVM, Clustering, and Ranking SVM) are implemented and evaluated. The general approach utilizes a large collection of Facebook profile information as training set in order to generate a list of movie recommendations for a particular user (c...

Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about uncertainty and multiagent systems. When the set of agents and the set of alternatives coincide, we get the ranking systems setting. A famous type of ranking systems are page ranking systems in the context of search engines. In th...

This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality ...

Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about uncertainty and multi-agent systems. When the set of agents and the set of alternatives coincide, we get the so-called reputation systems setting. Famous types of reputation systems include page ranking in the context of search en...

Appropriate ranking algorithms and incentive mechanisms are essential to the creation of high-quality information by users of a social network. However, evaluating such mechanisms in a quantifiable way is a difficult problem. Studies of live social networks of limited utility, due to the subjective nature of ranking and the lack of experimental control. Simulation provides a valuable alternativ...

This diploma thesis is devoted to the ranking of results returned by search engines. We present a State of the Art which covers the ranking for various datatypes, including the Web, XML, RDF, and folksonomies. For every datatype the calculation of a popularity score as well as the computing of a content score is presented. For most datatypes we also discuss the relevance of two objects to each ...