Outcome aware ranking in interaction networks

@article{Kameshwaran2010OutcomeAR,
  title={Outcome aware ranking in interaction networks},
  author={Sampath Kameshwaran and Vinayaka Pandit and Sameep Mehta and Nukala Viswanadham and Kashyap Dixit},
  journal={Proceedings of the 19th ACM international conference on Information and knowledge management},
  year={2010}
}
  • S. Kameshwaran, Vinayaka Pandit, K. Dixit
  • Published 26 October 2010
  • Computer Science
  • Proceedings of the 19th ACM international conference on Information and knowledge management
In this paper, we present a novel ranking technique that we developed in the context of an application that arose in a Service Delivery setting. We consider the problem of ranking agents of a service organization. The service agents typically need to interact with other service agents to accomplish the end goal of resolving customer requests. Their ranking needs to take into account two aspects: firstly, their importance in the network structure that arises as a result of their interactions… 

Figures and Tables from this paper

Outcome aware ranking in value creation networks
TLDR
A natural ranking problem that arises in settings in which a community of people are engaged in regular interactions with an end goal of creating value is considered and a novel algorithm for computing the ranking is developed.
Ranking Mechanisms for Interaction Networks
TLDR
The goal of this tutorial is to provide conceptual understanding of recent advances in designing efficient and scalable ranking mechanisms for large interaction networks along with applications to social network analysis.
Design and Analysis of Value Creation Networks
TLDR
These efforts towards design and analysis of value creation networks are summarized: 1) network representation of interactions and value creations, 2) identify contribution of a node based on values created from various activities, and 3) ranking nodes based on structural properties of interaction and the resulting values.
Modeling Service Interaction Networks
TLDR
This research develops and test a model of service interaction network effectiveness and investigates the critical factors that characterize the interactions among the network agents as they impact on the performance of the system.
A Novel Diversity Measure for Understanding Movie Ranks in Movie Collaboration Networks
TLDR
It is demonstrated that a subset of the diversity measures were effective in the binary classification task for movie ranks, while the advantages are prone to Precision/Recall depending on the specific dataset, showing that the “diversity” measure is feasible and effective in distinguishing movie ranks.
Social ranking for spoken web search
TLDR
This paper aims to bring the social context in Spoken Web ranking by formulating a relationship function between the query-creator and the content-creator that determines the trustability of the content based on the content creator's acceptance measure by the social network.
Robust expert ranking in online communities - fighting Sybil Attacks
TLDR
This paper proposes MHITS, an algorithm to rank users' expertise by exploiting the number of users' fair ratings and direct trust users gain in the online community and integrates SumUp, a Sybil-resilient algorithm, into MHITS algorithm as a robust ranking strategy.
Analyzing Service Interaction Network Effectiveness
TLDR
A model of service interaction networks in service delivery is developed and some of the key structural properties of the networks that can have significant effect on the effectiveness of the service system are investigated.
Socializing the h-index
Modeling collaboration in academia: a game theoretic approach
TLDR
This work begins by building a model for how researchers split their effort between multiple papers, and how collaboration affects the number of citations a paper receives, supported by observations from a large real-world publication and citation dataset, which is called the h-Reinvestment model.
...
1
2
...

References

SHOWING 1-10 OF 15 REFERENCES
Analyses for Service Interaction Networks with Applications to Service Delivery
TLDR
This work focuses on learning individual and team behavior of different people or agents of a service organization by studying the patterns and outcomes of historical interactions and develops the notion of service interaction networks, an abstraction of the historical data that allows one to cast practical problems in a formal setting.
Algorithms for estimating relative importance in networks
TLDR
This paper defines a general framework and a number of different algorithms, building on ideas from social networks, graph theory, Markov models, and Web graph analysis, which can be used to study relative importance in real-world networks including a network of interactions among September 11th terrorists.
Node ranking in labeled directed graphs
TLDR
This work presents a new flow-based model and an efficient method to dynamically rank the nodes of this graph with respect to any of the original labels and demonstrates that the method can obtain an improved ranking with very little impact on query time.
Concept-Aware Ranking: Teaching an Old Graph New Moves
TLDR
Experimental results show that such an approach to expand the Web graph to incorporate conceptual information encoded by links between Web pages improves accuracy by retrieving links which are more authoritative given a user's context.
An event-based framework for characterizing the evolutionary behavior of interaction graphs
TLDR
This work uses non-overlapping snapshots of interaction graphs and develops a framework for capturing and identifying interesting events from them, and uses these events to characterize complex behavioral patterns of individuals and communities over time.
Topic-sensitive PageRank
TLDR
A set of PageRank vectors are proposed, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic, and are shown to generate more accurate rankings than with a single, generic PageRank vector.
The PageRank Citation Ranking : Bringing Order to the Web
TLDR
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
It is argued that simple networks such as these cannot capture variation in the strength of collaborative ties and proposed a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and thenumber of other scientists with whom they coauthored those papers.
Further contributions to the theory of paired comparisons
1. When a pair of objects is presented for comparison and the two are placed in the relationship preferred: not-preferred, we have what is known as a paired comparison. A set of n objects can be
...
1
2
...