Outcome aware ranking in value creation networks

In this paper, we consider a natural ranking problem that arises in settings in which a community of people (or agents) are engaged in regular interactions with an end goal of creating value. Examples of such scenarios are academic collaboration networks, creative collaborations, and interactions between agents of a service delivery organization. For instance, consider a service delivery organization which essentially resolves a sequence of service requests from its customers by deploying its agents to resolve the requests. Typically, resolving a request requires interaction between multiple agents and results in an outcome (or value). The outcome could be success or failure of problem resolution or an index of customer satisfaction. For this scenario, the ranking of the agents of the network should take into account two aspects: importance of the agents in the network structure that arises as a result of interactions and the value generated by the interactions involving the respective agents. Such a ranking can be used for several purposes such as identifying influential agents of the interaction network, effective and efficient spreading of messages in the network. In this paper, we formally model the above ranking problem and develop a novel algorithm for computing the ranking. The key aspect of our approach is creating special nodes in the interaction network corresponding to the outcomes and endowing them independent, external status. The algorithm then iteratively spreads the external status of the outcomes to the agents based on their interactions and the outcome of those interactions. This results in an eigenvector like formulation, which results in a method requiring computing the inverse of a matrix rather than the eigenvector. We present several theoretical characterizations of our algorithmic approach. We present experimental results on the public domain real-life datasets from the Internet Movie Database and a dataset constructed by retrieving impact and citation ratings for papers listed in the DBLP database.

[1]  Padhraic Smyth,et al.  Algorithms for estimating relative importance in networks , 2003, KDD '03.

[2]  Sameep Mehta,et al.  Design and Analysis of Value Creation Networks , 2011, AAAI.

[3]  Pedro M. Domingos.  Mining Social Networks for Viral Marketing , 2022 .

[4]  Balaji Rajagopalan,et al.  Knowledge-sharing and influence in online social networks via viral marketing , 2003, CACM.

[5]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[6]  Eric Brill,et al.  Beyond PageRank: machine learning for static ranking , 2006, WWW '06.

[7]  Masahiro Kimura,et al.  Efficient discovery of influential nodes for SIS models in social networks , 2011, Knowledge and Information Systems.

[8]  Christos Faloutsos,et al.  Random walk with restart: fast solutions and applications , 2008, Knowledge and Information Systems.

[9]  Steffen Staab,et al.  Social Networks Applied , 2005, IEEE Intell. Syst..

[10]  Johan Bollen,et al.  Co-authorship networks in the digital library research community , 2005, Inf. Process. Manag..

[11]  Jaideep Srivastava,et al.  Concept-Aware Ranking: Teaching an Old Graph New Moves , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[12]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2007, KDD '07.

[13]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[14]  Krishna Prasad Chitrapura,et al.  Node ranking in labeled directed graphs , 2004, CIKM '04.

[15]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[16]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Sameep Mehta,et al.  Analyses for Service Interaction Networks with Applications to Service Delivery , 2009, SDM.

[18]  Teh-Hsing Wei,et al.  The algebraic foundations of ranking theory , 1952 .

[19]  Sameep Mehta,et al.  Outcome aware ranking in interaction networks , 2010, CIKM '10.

[20]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[21]  M. Kendall.  Further contributions to the theory of paired comparisons , 1955 .

[22]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.