2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing 2009
DOI: 10.1109/dasc.2009.59
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Social Network Analysis Using Latent Space Model and an Integrated Clustering Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 16 publications
0
9
0
Order By: Relevance
“…For instance, Barabási and Albert (1999) allowed for time-varying nodes and edges, Crane (2015) assumed infinite population at every time point and allowed for random observations at different time points, to name but a few. In terms of the network models imposed for every time point, Snijders (2002) explored dynamic exponential random graph models, Tang et al (2013) studied a dynamic version of random dot product models, Ho et al (2011) extended the mixed membership models to a dynamic one, Xu and Zheng (2009), Sewell and Chen (2015) among others considered dynamic latent space models, and dynamic stochastic block models have also been extensively studied.…”
Section: We Letmentioning
confidence: 99%
“…For instance, Barabási and Albert (1999) allowed for time-varying nodes and edges, Crane (2015) assumed infinite population at every time point and allowed for random observations at different time points, to name but a few. In terms of the network models imposed for every time point, Snijders (2002) explored dynamic exponential random graph models, Tang et al (2013) studied a dynamic version of random dot product models, Ho et al (2011) extended the mixed membership models to a dynamic one, Xu and Zheng (2009), Sewell and Chen (2015) among others considered dynamic latent space models, and dynamic stochastic block models have also been extensively studied.…”
Section: We Letmentioning
confidence: 99%
“…This explains why, over the past few years, many research works on social computing [23], [28] have been proposed. These works include the analysis [2], [18], [29], mining [13], [15], [22], [30] and visualization [3] of, as well as information propagation [8], [17] in, complex social networks (e.g., communication, friendship, professional, and organizational networks). In general, social networks [6], [7], [12] are structures made of social entities (e.g., individuals, corporations, collective social units, or organizations) that are linked by some specific types of interdependency (e.g., kinship, friendship, common interest, beliefs, or financial exchange).…”
Section: Introductionmentioning
confidence: 99%
“…Social network can be generally defined as a group of individuals who are connected by a set of relationships [7]. For example, we can consider a research laboratory, illustrated by Fig.…”
Section: Communities and Contexts In Dynamic Social Networkmentioning
confidence: 99%
“…Furthermore, a key characteristic of social networks is their continual change [7]. Real-world social networks such as the research laboratory are not always static.…”
Section: Communities and Contexts In Dynamic Social Networkmentioning
confidence: 99%