Applying Social Network Analysis to Analyze a Web-Based Community
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2012, Vol 3, Issue 2
Abstract
This paper deals with a very renowned website (that is Book-Crossing) from two angles: The first angle focuses on the direct relations between users and books. Many things can be inferred from this part of analysis such as who is more interested in book reading than others and why? Which books are most popular and which users are most active and why? The task requires the use of certain social network analysis measures (e.g. degree centrality). What does it mean when two users like the same book? Is it the same when other two users have one thousand books in common? Who is more likely to be a friend of whom and why? Are there specific people in the community who are more qualified to establish large circles of social relations? These questions (and of course others) were answered through the other part of the analysis, which will take us to probe the potential social relations between users in this community. Although these relationships do not exist explicitly, they can be inferred with the help of affiliation network analysis and techniques such as m-slice. Book-Crossing dataset, which covered four weeks of users' activities during 2004, has always been the focus of investigation for researchers interested in discovering patterns of users' preferences in order to offer the most possible accurate recommendations. However; the implicit social relationships among users that emerge (when putting users in groups based on similarity in book preferences) did not gain the same amount of attention. This could be due to the importance recommender systems attain these days (as compared to other research fields) as a result to the rapid spread of e-commerce websites that seek to market their products online. Certain social network analysis software, namely Pajek, was used to explore different structural aspects of this community such as brokerage roles, triadic constraints and levels of cohesion. Some overall statistics were also obtained such as network density, average geodesic distance and average degree.
Authors and Affiliations
Mohammed Al-Taie , Seifedine Kadry
Keywords
Related Articles
- EP ID EP103317
- DOI 10.14569/IJACSA.2012.030206
- Views 134
- Downloads 0
Emotion Recognition based on EEG using LSTM Recurrent Neural Network
Emotion is the most important component in daily interaction between people. Nowadays, it is important to make the computers understand user’s emotion who interacts with it in human-computer interaction (HCI) systems. El...
An Efficient Density based Improved K- Medoids Clustering algorithm
Clustering is the process of classifying objects into different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-medoids and k-medoids. H...
A Decision Tree Approach for Predicting Student Grades in Research Project using Weka
Data mining in education is an emerging multidiscipline research field especially with the upsurge of new technologies used in educational systems that led to the storage of massive student data. This study used classifi...
MITIGATING BLACK HOLE ATTACK IN MANET BY EXTENDING NETWORK KNOWLEDGE
The Optimized Link State Routing Protocol is developed for Mobile Ad Hoc Network. It operates as a table driven, proactive protocol. The core of the OLSR protocol is the selection of Multipoint Relays (MPRs), used as a f...
Facial Expression Recognition using Hybrid Texture Features based Ensemble Classifier
Communication is fundamental to humans. In the literature, it has been shown through many scientific research studies that human communication ranges from 54 to 94 percent is non-verbal. Facial expressions are the most o...