120 likes | 289 Views
Comparing the use of Network Structure and Profile Characteristics in Discovering Groups in Social Networks. John Johnson. Original Work. “Discovering Social Circles in Ego Networks” by Julian McAuely and Jure Leskovec from Stanford University
E N D
Comparing the use of Network Structure and Profile Characteristics in Discovering Groups in Social Networks John Johnson
Original Work • “Discovering Social Circles in Ego Networks” by Julian McAuely and Jure Leskovecfrom Stanford University • Automatic classification into group of contacts from Social Networking site • Unsupervised ANNutilizing network structure and profile characteristics
Motivation • Does the algorithm proposed in the original paper rely more heavily on network structure or profile characteristics in determining groups?
Methodology • Establish a baseline by running McAuely’s and Leskovec’s code on their unmodified data. • Determine performance of algorithm using only network structure by removing profile characteristic data. • Determine performance of algorithm using only profile characteristics by removing network structure data.
Results = 73.56 min = 29.35 min = 3.02 min
Results • Both modifications were significantly faster in running time. • Using network structure took much longer than using profile characteristics. • Using network structure resulted in far more accurate results than profile characteristics. • Using profile characteristics resulted in very small groups compared to baseline.
Conclusions • Using only network structure resulted in a longer running time than using profile characteristics, implying the algorithm spends more time on the network structure. • Using only network structure resulted in far more accurate results than using only profile characteristics, implying the algorithm uses network structure more than profile characteristics.
Conclusions • Algorithm proposed in “Discovering Social Circles in Ego Networks” relies more heavily on network structure than on profile characteristics.
Future Work • Expanding data set to include data from other social networking sites. • Twitter & Google+ contain different profile characteristics and are directed graphs instead of undirected graphs. • Comparison against other grouping methods that use only network structure to determine efficiency of this algorithm when profile characteristics are unavailable.
References J. McAuley and J. Leskovec, “Discovering Social Circles in Ego Networks,” in Neural Information Processing Systems, 2012