Scalable Community Detection through Content and Link Analysis in Social Networks
Journal Title: Journal of Information Systems and Telecommunication - Year 2015, Vol 3, Issue 4
Abstract
Social network analysis is an important problem that has been attracting a great deal of attention in recent years. Such networks provide users many different applications and features; as a result, they have been mentioned as the most important event of recent decades. Using features that are available in the social networks, first discovering a complete and comprehensive communication should be done. Many methods have been proposed to explore the community, which are community detections through link analysis and nodes content. Most of the research exploring the social communication network only focuses on the one method, while attention to only one of the methods would be a confusion and incomplete exploration. Community detections is generally associated with graph clustering, most clustering methods rely on analyzing links, and no attention to regarding the content that improves the clustering quality. In this paper, to scalable community detections, an integral algorithm is proposed to cluster graphs according to link structure and nodes content, and it aims finding clusters in the groups with similar features. To implement the Integral Algorithm, first a graph is weighted by the algorithm according to the node content, and then network graph is analyzed using Markov Clustering Algorithm, in other word, strong relationships are distinguished from weak ones. Markov Clustering Algorithm is proposed as a Multi-Level one to be scalable. The proposed Integral Algorithm was tested on real datasets, and the effectiveness of the proposed method is evaluated.
Authors and Affiliations
Zahra Arefian, Mohammad Reza Khayyam Bashi
Keywords
Related Articles
- EP ID EP184609
- DOI 10.7508/jist.2015.04.003
- Views 132
- Downloads 0
Application of Curve Fitting in Hyperspectral Data Classification and Compression
Regarding to the high between-band correlation and large volumes of hyperspectral data, feature reduction (either feature selection or extraction) is an important part of classification process for this data type. A vari...
A Stochastic Lyapunov Theorem with Application to Stability Analysis of Networked Control Systems
The source of randomness in stochastic systems is an input with stochastic behavior as treated in the existing literature. Special types of stochastic processes such as the Wiener process or the Brownian motion have serv...
A Conflict Resolution Approach using Prioritization Strategy
In current air traffic control system and especially in free flight method, the resolution of conflicts between different aircrafts is a critical problem. In recent years, conflict detection and resolution problem has be...
Fusion of Learning Automata to Optimize Multi-constraint Problem
This paper aims to introduce an effective classification method of learning for partitioning the data in statistical spaces. The work is based on using multi-constraint partitioning on the stochastic learning automata. S...
Improving Accuracy, Area and Speed of Approximate Floating-Point Multiplication Using Carry Prediction
The arithmetic units are the most essential in digital circuits’ construct, and the enhancement of their operation would optimize the whole digital system. Among them, multipliers are the most important operational units...