]> 2012-02-11T03:27:59-05:00 Multirank: reputation ranking for generic semantic social networks This paper presents a technique for calculating “reputation” or influence of users and artifacts in semantic social networks: in particular, as an incentive mechanism to encourage reuse of complex resources such as ontologies. Adapting the PageRank algorithm to the relational schemas of typical social network applications, this technique allows the programmer first to define via minimal rules the ways in which reputations of users and artifacts are likely to influence one another, then to obtain a mechanical, global ranking which reflects those rules in combination with the graph structure of the network. The mapping of multi-way relations such as usage and annotation to the binary-relational domain of PageRank is illustrated using the Actor-Concept-Instance model of ontologies. A lightweight software implementation, currently under development, will provide a convenient way to add reputation-based functionality to Java-based community applications. inproceedings 1st International Workshop on Motivation and Incentives on the Web luo2009multirank: MultiRank: Reputation Ranking for Generic Semantic Social Networks TW-2009-09 2009 Year Tr id Title Computer science Tag Paper url Media:TW-2009-09.pdf Paper April Month Key Booktitle Bibtype Joshua Shinavier Xixi Luo Author Madrid Address Abstract TW Technical Report Publication Proceeding Paper Workshop Paper