|
Title:
|
GROUPING OF ACTORS ON AN ENTERPRISE SOCIAL NETWORK USING OPTIMIZED UNION-FIND ALGORITHM |
|
Author(s):
|
Aasma Zahid , Umar Muneer , Shoab A. Khan |
|
ISBN:
|
978-972-8924-88-1 |
|
Editors:
|
Ajith P. Abraham |
|
Year:
|
2009 |
|
Edition:
|
Single |
|
Keywords:
|
Social Network Analysis, Graph Partitioning Problem, Union-Find Algorithm, LINQ. |
|
Type:
|
Short Paper |
|
First Page:
|
148 |
|
Last Page:
|
152 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
For a very large social network it is advantageous to break the network into independent components for maintenance and
analysis of social ties and close cliques. Traditional union-find algorithm is optimized and compared with its variants
particularly for the very large network. Partitioning of an enterprise social network based on some principle criteria
would facilitates analysis of network in different dimensions, edge-weight criteria of e-mails data is disused. The paper
presents application of graph partitioning problem on an enterprise social network according to the specified edge weight
computational criterion. |
|
|
|
|
|
|
