Making the invisible visible through SNA
•Télécharger en tant que PPT, PDF•
4 j'aime•2,072 vues
The science of networks is becoming an increasingly important and intriguing area of study that reveals many a patterns and relationships often hidden. This presentation is about the use of SNA to study the network of the Digital Library Community
![Making the invisible visible through Social Network Analysis Shalini Urs International School of Information Management University of Mysore, Mysore, India [email_address] CAMP 2010 - March 18, Shah Alam, Malaysia](https://image.slidesharecdn.com/camp2010-urs-march18-110422054243-phpapp01/85/Making-the-invisible-visible-through-SNA-1-320.jpg)
![Agenda ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommandé
Recommandé
Contenu connexe
Tendances
Tendances (20)
En vedette
En vedette (15)
Similaire à Making the invisible visible through SNA
Similaire à Making the invisible visible through SNA (20)
Plus de MYRA School of Business
Plus de MYRA School of Business (9)
Dernier
Dernier (20)
Making the invisible visible through SNA
- 1. Making the invisible visible through Social Network Analysis Shalini Urs International School of Information Management University of Mysore, Mysore, India [email_address] CAMP 2010 - March 18, Shah Alam, Malaysia
- 3. Networks are the talk of town ... ... since we're living in a world of relations Networks seem to be everywhere. Games about connectivity (Six Degrees of Kevin Bacon); understanding dynamics of food networks, World Wide Web, terrorist network to structure of collaboration networks
- 4. The Alibaba dataset- SNA Analysis Alibaba Scn 1: discover the plot. Alibaba Scenario 1: SNA (cluster analysis) Results: Alibaba Network Discovery. Robert Savell, SBP ‘08 April 1,2008 & Process Query Systems Group
- 21. Graph Theory and SNA The above graph has- vertex set V={a,b,c,d,e.f} and edge set E = {(a,b),(b,c),(c,d),(c,e),(d,e),(e,f)}. Two vertices u and v are adjacent if there exists an edge ( u,v ) that connects them. An edge e = (u,u) that links a vertex to itself is known as a self-loop or reflexive tie. The number of vertices in a graph is usually denoted n while the number of edges is usually denoted m
- 24. Turning Points and Social Change By measuring the patterns of interaction and communication among members of a network, one can uncover the origins of ideas and social change. There is increasing interest in linking the distribution of cultural ideas and practices to social communities Studies have been carried out to assess the relationship between network dynamics and community “readiness” to engage in the social change processes.
- 53. Coauthorship network between 11 top authors with coauthors
- 54. Coauthorship network between 11 top authors
- 55. Components of Digital Library community
- 56. Degree centrality of top 11 authors
- 57. Betweenness centrality of top11 authors
- 59. Co-authorship network of D-Lib and JODL research community
- 63. Network of Editors and the its components
- 69. THANK YOU Thank you
Notes de l'éditeur
- Refer to social networks here Began with Jacob Levy Moreno in the 1930s in attempt to quantify social relationships. Based on matrix algebra. Advanced statistics… Nodes can be people, departments, or organizations Networks consist of links that form a structure Links between nodes have different purposes , e.g., task or general advice, expertise, strategic information, navigating the organization (procedures, know-who, etc.) Links can be one or two directional Links can be both formal and informal Links can have different strengths
- Kohler (1925) is about how the mind works ; stressed the organized patterns that structure thoughts and