2022
DOI: 10.1109/tse.2020.3022212
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Clustering Algorithm for Modularization of Large-Scale Software Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(19 citation statements)
references
References 33 publications
0
19
0
Order By: Relevance
“…Teymourian et al [25] presented an approach for the evaluation of dynamic clustering. ey used both static and dynamic features for the modularization process.…”
Section: Related Workmentioning
confidence: 99%
“…Teymourian et al [25] presented an approach for the evaluation of dynamic clustering. ey used both static and dynamic features for the modularization process.…”
Section: Related Workmentioning
confidence: 99%
“…In the fast sorting phase, the remaining nodes are sorted and divided into communities according to the obtained elite structure. Inspired by the fast clustering algorithm (FCA) [21], a series of operations are defined on the graph of the community, and we extracted several features from it. The nodes are ordered according to a set of features by utilizing mathematical operations on the graph.…”
Section: Fast Elite Population Initializationmentioning
confidence: 99%
“…In the past years, many methods for the CD have been proposed, such as node importance-based (NIB) methods [5][6][7], good initial substructure-based (GISB) methods [8][9][10], non-negative matrix factorization-based (NMFB) methods [11][12][13][14], deep learningbased (DLB) methods [15][16][17][18], and population intelligence-based (PIB) methods [1,14,19,20]. The methods of NIB, which find the existing dependency and apply mathematical operations between nodes in the graph, or the methods of GISB, which find good initial substructure, can divide the network faster and more efficiently, so they are chosen by more researchers [21,22].…”
Section: Introductionmentioning
confidence: 99%
“…Hierarchical clustering has high temporal and spatial complexity, low clustering efficiency and large error. The fast hierarchical clustering HAC algorithm reduces the space-time complexity and computation (Teymourian et al. , 2022).…”
Section: Index Classification and Stratificationmentioning
confidence: 99%