earticle

논문검색

Social Network Partition Method based on Concentricity-Controllable Routing

초록

영어

In allusion to issues that partitioning algorithm of traditional social network community is generally lacking in comprehensive consideration of node and link attributes as well as full expression of model and mechanism using attributes of node and link. This paper presents a social network community partitioning algorithm fusing node and link attributes. The algorithm has blended similarity of node properties, link weights between nodes and link attribute information, making definition of the similar weights, and on this basis, social networking community division is realized combined with condensation algorithms. Experiments show that the algorithm has remarkable effects on community partition with obvious attributes in social network.

목차

Abstract
 1. Introduction
 1. Model and Related Definitions
  1.1. Social Networking Model and Definitions
  1.2. Information Gain
  1.3. Modularity
  1.4. Normalized Mutual Information
 2. Community Partitioning Algorithm Based on Similar Weights
  2.1. General Idea of Algorithm
  2.2. Several Definitions Involved in Algorithm
  2.3. Community Partitioning Algorithm Implementation Based on Similar Weights
 3. Experiment and Analysis
  3.1. Attribute-Based DBLP Data Sets Experiment
  3.2. Attribute-Based Telephone Network User Data Experiment
 4. Summary and Outlook
 Acknowledgements
 References

저자정보

  • Huang Jian-Heng School of Civil Engineering, Xi’an University of Architecture & Technology, Xi’an, China
  • Yu Jun-Qi School of Civil Engineering, Xi’an University of Architecture & Technology, Xi’an, China
  • Zhao Min-Hua School of Information & Control Engineering, Xi’an University of Architecture & Technology, Xi’an, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.