2022
DOI: 10.1007/s41060-021-00303-y
|View full text |Cite
|
Sign up to set email alerts
|

DPISCAN: Distributed and parallel architecture with indexing for structural clustering of massive dynamic graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 45 publications
0
0
0
Order By: Relevance
“…Clustering algorithms can generally be used in partition-based [8], hierarchy-based [9], density-based [10], grid-based [11], model-based [12], and graph-based [13] ways to perform classification. The k-means algorithm is the most traditional method of partitioning clusters [14].…”
Section: Introductionmentioning
confidence: 99%
“…Clustering algorithms can generally be used in partition-based [8], hierarchy-based [9], density-based [10], grid-based [11], model-based [12], and graph-based [13] ways to perform classification. The k-means algorithm is the most traditional method of partitioning clusters [14].…”
Section: Introductionmentioning
confidence: 99%