Mining heterogeneous social networks for egocentric information abstraction

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Social network is a powerful data structure that allows the depiction of relationship information between entities. However, real-world social networks are sometimes too complex for human to pursue further analysis. In this work, an unsupervised mechanism is proposed for egocentric information abstraction in heterogeneous social networks. To achieve this goal, we propose a vector space representation for heterogeneous social networks to identify combination of relations as features and compute statistical dependencies as feature values. These features, either linear or eyelie, intend to capture the semantic information in the surrounding environment of the ego. Then we design three abstraction measures to distill representative and important information to construct the abstracted graphs for visual presentation. The evaluations conducted on a real world movie datasct and an artificial crime dataset demonstrate that the abstractions can indeed retain significant information and facilitate more accurate and efficient human analysis. © 2010 Springer-Verlag Wien.

Cite

CITATION STYLE

APA

Li, C. T., & Lin, S. D. (2010). Mining heterogeneous social networks for egocentric information abstraction. In From Sociology to Computing in Social Networks: Theory, Foundations and Applications (pp. 35–58). Springer Vienna. https://doi.org/10.1007/978-3-7091-0294-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free