CMU-ISRI-04-137Institute for Software Research International School of Computer Science, Carnegie Mellon University
CMU-ISRI-04-137
Kathleen M. Carley, Natalia Y. Kamneva, Jeff Reminga December 2004
Institute for Software Research International (ISRI)
CMU-ISRI-04-137.ps
Keywords: Morphing Technology (MT), meta-matrix, Hamming distance,
minimal total path cost, A* search algorithm, admissible heuristic, cost
function, edge betweenness centrality, Simulated Annealing, Simplified
Memory-Bounded A* Algorithm, Dynamic A* Algorithm (D* search algorithm)
There is a need in social network analysis to predict and manage changes with organizations and teams. Altering the command and control structure of organizational units might be expensive and have drastic impact on their performance. Hence there is a need for automated tools that can locate cost effective and minimally disruptive paths of change. These tools should be able to formalize a theory of organizational adaptation and provide the basis for its understanding and predicting. We called the methodology that we are using to develop such tools a constraint based morphing technology. This report considers different methods of searching the optimal path between the source and goal structure. We introduce in this report the new optimization method of finding a cheapest path, based on the Simulated Annealing algorithm. We also introduce a new approach for computing a cost function, based on the Dynamic Network Analysis (DNA) metric called the Edge Betweenness Centrality. 20 pages
| |

Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |