2020
DOI: 10.1109/tkde.2020.3002926
|View full text |Cite
|
Sign up to set email alerts
|

An efficient Split-Merge re-start for the K-means algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(13 citation statements)
references
References 30 publications
0
12
0
1
Order By: Relevance
“…Figure 2 is a block diagram of the system. e application system is based on the Telnet protocol; by intercepting the data packets transmitted in the network and performing corresponding protocol analysis, the commands submitted by the user to the Telnet host and the results returned by the host can be completely restored [15]. We combine each command submitted by the user with other attributes associated with it to form an audit record.…”
Section: Mining Principle and Basicmentioning
confidence: 99%
“…Figure 2 is a block diagram of the system. e application system is based on the Telnet protocol; by intercepting the data packets transmitted in the network and performing corresponding protocol analysis, the commands submitted by the user to the Telnet host and the results returned by the host can be completely restored [15]. We combine each command submitted by the user with other attributes associated with it to form an audit record.…”
Section: Mining Principle and Basicmentioning
confidence: 99%
“…3) K-means [58] method is adopted to cluster the raw data and the mining data, respectively. 4) Two metrics are used to evaluate the clustering performance, which are Normalized Mutual Information (NMI) [59] and Homogeneity (h) [60].…”
Section: Mining Abilitymentioning
confidence: 99%
“…The closer the si${s_i}$ is to 1, the number of clustering classes is best. Yinyang‐k‐Means++ improves the k‐Means++ algorithm effectively using the upper and lower limits of the distance between the data point and the centre point and avoids redundant distance calculations [25, 26]. The traditional k‐Means clustering algorithm (Lloyd) is mainly divided into two steps.…”
Section: Algorithm Selection and Evaluation Analysismentioning
confidence: 99%