Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007) 2007
DOI: 10.1109/icdmw.2007.73
|View full text |Cite
|
Sign up to set email alerts
|

A Divisive Hierarchical Structural Clustering Algorithm for Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(23 citation statements)
references
References 7 publications
0
21
0
Order By: Relevance
“…Step 6. appropriate weight w ij can be found in the literature, together with slight modifications of the above divisive algorithm [31,35,44]. Following the same spirit of GN-algorithm, in [35] a divisive hierarchical method is defined.…”
Section: Literature Review and Algorithmsmentioning
confidence: 99%
“…Step 6. appropriate weight w ij can be found in the literature, together with slight modifications of the above divisive algorithm [31,35,44]. Following the same spirit of GN-algorithm, in [35] a divisive hierarchical method is defined.…”
Section: Literature Review and Algorithmsmentioning
confidence: 99%
“…The best εt obtained manually is 0.5. We note that our method finishes clustering within eight iterative steps from 0.64 to 0.46, whereas the previous divisive method [28] finishes it with about 200 iterative steps. …”
Section: Football Datamentioning
confidence: 99%
“…There have been several heuristic algorithms for maximizing modularity. They all are classified into two categories: (1) bottomup (agglomerative) clustering [18]; and (2) top-down (divisive) clustering [28]. The former starts from all nodes, i.e., |Vt| clusters, and the latter from a graph Gt itself, i.e., a single cluster.…”
Section: Clustering Of Optimal Modularitymentioning
confidence: 99%
“…Another variant of clustering approach was presented by Yuruk et al [32] in which finding the hierarchical structure of clusters without any input parameters was discussed. They presented, a hierarchical structural clustering algorithm for networks.…”
Section: Graph Clustering Algorithmsmentioning
confidence: 99%
“…Apart from traditional force directed algorithms, significant research work has been done on clustering of the graphs [30,9,1,15,4,24,27,32]. Cluster graph is another important concept to visualize semantic nets.…”
Section: Graph Clustering Algorithmsmentioning
confidence: 99%