Code block for reading data.
Step 3: Data cleaning
Data cleaning means removing/cleaning the noise (NaN, Missing data) [19]. Data quality will have more impact in the model so using the data with less noise is recommended for better results. Missing values can be altered by generating the mean, median value and so on [20–22]. It completely depends upon the type of data.
Step 4: Read input
read_edgelist is a built-in function in NetworkX library. More details about it can be found in the documentation website. [23]
Figure 2.13 Code block for reading edge list.
Step 5: Visualizing the network
Figure 2.14 Visualization of Facebook users.
Step 6: Centrality measures
Figure 2.15 Code block for centrality measures.
Figure 2.16 Visualization of centrality measures on Facebook users.
2.8 Real-Time Product From SNA
One of the innovative and fancy real-time products out of network analysis is nevaal maps, which is created by nevaal AG, a German company focused mainly on network analysis for business.
Company Vision:
The motive of the company is to “create a front-line solution to visualize information from our social circles.”
2.8.1 Nevaal Maps
It is the SaaS application used in business network analytics. It connects the network (group of people) in the business network together to track them, getting in touch and to make better decision. The capability of it to handle the complex data makes it easier for any start-up to keep their organization in a structured manner.
The three important features about nevaal maps, which makes it more efficient, are as follows: scalable, secure, and customizable. The central mechanism can be adjusted according to individual customer need.
Usage
Visualizing the complex network data helps in
– Screening process and investment decisions.
– Enabling the internal/external process of data.
– Providing interactive and insightful view of the business data.
Significancy
The product is not only focusing on visualizing the network connection but also aids in manifesting communication processes, which is outcome focused.
Figure 2.17 Visualization of graph database used in business.
Social network analysis helps us in every domain, such as fake ID detection, terrorist activities, marketing, social media, and so on.
References
1. Mona, E., Hari, R.M., Somya, V., Sivakumari, M.S., Alumni Social Networking Site. Int. J. Sci. Res. Comput. Sci. Eng. Inf. Technol., 7, 467–472, 2021.
2. Otte, E. and Rousseau, R., Social network analysis: a powerful strategy, also for the information sciences. J. Inf. Sci., 28, 441–453, 2002.
3. Scott, J., Social Network Analysis. Sociology, 22, 109–127, 1988.
4. McGloin, J. and Kirk, D., An Overview of Social Network Analysis. J. Crim. Justice Educ., 21, 169–181, 2010.
6. Burcher, M., Social Network Analysis and the Characteristics of Criminal Networks, Australia, 2020.
7. Palus, S. and Kazienko, P., Social Network Analysis in Corporate Management, in: MISSI, 2010.
8. Wasserman, S. and Faust, K., Social Network Analysis: Methods and Applications, 1994.
9. Robins, G., A tutorial on methods for the modeling and analysis of social network data. J. Math. Psychol., 57, 261–274, 2013.
10. Gunawan, T.S., Abdullah, N.A., Kartiwi, M., Ihsanto, E., Social Network Analysis using Python Data Mining. 2020 8th International Conference on Cyber and IT Service Management (CITSM), pp. 1–6, 2020.
11. Haythornthwaite, C., Social network analysis: An approach and technique for the study of information exchange☆. Libr. Inf. Sci. Res., 18, 323–342, 1996.
12. Goldenberg, D., Social Network Analysis: From Graph Theory to Applications with Python, 2021, ArXiv, abs/2102.10014.
13. Hagberg, A., Schult, D., Swart, P., Exploring Network Structure, Dynamics, and Function using NetworkX, 2008.
14. Staudt, C., Sazonovs, A., Meyerhenke, H., NetworKit: A tool suite for large-scale complex network analysis. Netw. Sci., 4, 508–530, 2016.
15. Aslak, U. and Maier, B., Netwulf: Interactive visualization of networks in Python. J. Open Source Software, 4, 1425, 2019.
16. Brandes, U., A faster algorithm for betweenness centrality. J. Math. Sociol., 25, 163–177, 2001.
17. Bader, D.A., Kintali, S., Madduri, K., Mihail, M., Approximating Betweenness Centrality, in: WAW, 2007.
18. Green, O., McColl, R., Bader, D.A., A Fast Algorithm for Streaming Betweenness Centrality. 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing, pp. 11–20, 2012.
19. López-Acosta, A., García-Hernández, A., Vázquez-Reyes,
