DocumentCode
2865568
Title
Finding Strong Groups of Friends among Friends in Social Networks
Author
Cameron, Juan J. ; Leung, Carson Kai-Sang ; Tanbeer, Syed K.
Author_Institution
Dept. of Comput. Sci., Univ. of Manitoba, Winnipeg, MB, Canada
fYear
2011
fDate
12-14 Dec. 2011
Firstpage
824
Lastpage
831
Abstract
Over the past few years, the rapid growth and the exponential use of social digital media has led to an increase in popularity of social networks and the emergence of social computing. In general, social networks are structures made of social entities (e.g., individuals) that are linked by some specific types of interdependency such as friendship. Most users of social media (e.g., Face book, Google+, Linked In, My Space, Twitter) have many linkages in terms of friends, connections, and/or followers. Among all these linkages, some of them are more important than another. For instance, some friends of a user may be casual ones who acquaintances met him at some points in time, whereas some others may be friends that care about him in such a way that they frequently post on his wall, view his updated profile, send him messages, invite him for events, and/or follow his tweets. In this paper, we apply data mining techniques to social networks to help users of the social digital media to distinguish these important friends from a large number of friends in their social networks.
Keywords
data mining; social networking (online); data mining techniques; social computing; social digital media; social entities; social networks; Data mining; Databases; Facebook; LinkedIn; Media; Twitter; Social computing; data mining; social computing applications; social media; social network analysis and mining;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4673-0006-3
Type
conf
DOI
10.1109/DASC.2011.141
Filename
6118895
Link To Document