2011 10th International Conference on Machine Learning and Applications and Workshops 2011
DOI: 10.1109/icmla.2011.57
|View full text |Cite
|
Sign up to set email alerts
|

Discovering Communities in Social Networks Using Topology and Attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…In Comito et al (2019) an algorithm to identify social neighbourhood using word embedding is proposed. Salem et al (2011) proposed a community discovery algorithm using network topology. Schreckenberger et al (2018) presents a survey on predicting the next location of users in location-based social networks.…”
Section: Related Literaturementioning
confidence: 99%
“…In Comito et al (2019) an algorithm to identify social neighbourhood using word embedding is proposed. Salem et al (2011) proposed a community discovery algorithm using network topology. Schreckenberger et al (2018) presents a survey on predicting the next location of users in location-based social networks.…”
Section: Related Literaturementioning
confidence: 99%
“…It is obvious that network topological structure and attribute information can be used to identify some hidden patterns in communities. In this study, IAC clustering algorithm [11] is applied to detect communities in social network graphs. Figure 2 shows a pseudo code of the algorithm where it accepts an attribute augmented graph and return a clustered graph as output.…”
Section: Discovering Community the Social Network Graphmentioning
confidence: 99%
“…Figure 2. IAC Clustering Algorithm [11] An augmented graph is a graph G = (V, E, ߯), where V = {v 1 , v 2 , v 3 , …,v n } is the set of nodes and n = |V| denotes the number of nodes in the graph, E ⊂ V× V is the set of edges,E = {(v i , v j ): v i , v j ∈V}, and ߯∈ R |v| × d is the nodes attribute matrix. First of all, the algorithm creates the similarity matrix C, then according to K (K = ߙ× E) it adds the set of edges to the graph and the elements which belong to these edges are set to 1 in matrix S. As well as matrix W is made by summation of S and A.…”
Section: Discovering Community the Social Network Graphmentioning
confidence: 99%
“…One may refer to Refs. [ [6] , [7] , [8] , [9] , [10] , [11] , [12] , [13] ] for recent research on topological aspects of social networks. Also [ 14 , 15 ], can be considered to find connections between social networks and computer science.…”
Section: Introductionmentioning
confidence: 99%