Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 2.541

Social network analysis: An overview

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Social network analysis (SNA) is a core pursuit of analyzing social networks today. In addition to the usual statistical techniques of data analysis, these networks are investigated using SNA measures. It helps in understanding the dependencies between social entities in the data, characterizing their behaviors and their effect on the network as a whole and over time. Therefore, this article attempts to provide a succinct overview of SNA in diverse topological networks (static, temporal, and evolving networks) and perspective (ego‐networks). As one of the primary applicability of SNA is in networked data mining, we provide a brief overview of network mining models as well; by this, we present the readers with a concise guided tour from analysis to mining of networks. This article is categorized under: Application Areas > Science and Technology Technologies > Machine Learning Fundamental Concepts of Data and Knowledge > Human Centricity and User Interaction Commercial, Legal, and Ethical Issues > Social Considerations
An example network representation
[ Normal View | Magnified View ]
Temporal networks represented as (a) contact sequence network and (b) interval graph
[ Normal View | Magnified View ]
An example network with three distinct communities: C1 = {A,B,C,D,E,F}, C2 = {G,H,I}, C3 = {J,K,L,M,N,O,P}
[ Normal View | Magnified View ]
Illustration of the process behind Pagerank algorithm in a network comprised of six nodes. The first network (a) corresponds to the initialization step. In network (b) are shown the updated Pagerank values at the end of the first iteration of the algorithm. Note that node D is so far the most authoritative node, with a Pagerank value of . The rightmost network (c) corresponds to the second (and last) iteration of Pagerank. Here, we notice that node B overtakes the position of node D in terms of Pagerank values
[ Normal View | Magnified View ]
Structurally different ego‐networks for demonstration
[ Normal View | Magnified View ]
A directed and unweighted graph G represented by means of an adjacency matrix (left‐side of the figure) and an adjacency list (right‐side of the figure)
[ Normal View | Magnified View ]

Related Articles

Social Networks and Data Mining

Browse by Topic

Application Areas > Science and Technology
Commercial, Legal, and Ethical Issues > Social Considerations
Fundamental Concepts of Data and Knowledge > Human Centricity and User Interaction
Technologies > Machine Learning

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts