Multi-type Relational Data Clustering for Community Detection by Exploiting Content and Structure Information in Social Networks

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

Abstract

Social Networks popularity has facilitated the providers with an opportunity to target specific user groups for various applications such as viral marketing and customized programs. However, the volume and variety of data present in a network challenge the identification of user communities effectively. The sparseness and heterogeneity in a network make it difficult to group the users with similar interests whereas the high dimensionality and sparseness in text pose difficulty in finding content focused groups. We present this problem of discovering user communities with common interests as the multi-type relational data (MTRD) learning with the content and structural information, and propose a novel solution based on non-negative matrix factorization with added regularization. We empirically evaluate the effectiveness of the proposed method on real-world Twitter datasets benchmarking with the state-of-the-art community discovery and clustering methods.

Cite

CITATION STYLE

APA

Gayani Tennakoon, T. M., Luong, K., Mohotti, W., Chakravarthy, S., & Nayak, R. (2019). Multi-type Relational Data Clustering for Community Detection by Exploiting Content and Structure Information in Social Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11671 LNAI, pp. 541–554). Springer Verlag. https://doi.org/10.1007/978-3-030-29911-8_42

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