2012
DOI: 10.1007/978-3-642-29216-3_8
|View full text |Cite
|
Sign up to set email alerts
|

K-Means Clustering of Use-Cases Using MDL

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Hierarchical clustering 5 19,30,33,35,38 Customized clustering algorithm 4 [22][23][24]43 K-means 1 50 Seed algorithm 1 41 Cohesion algorithm 1 41 Graph-based clustering 1 21 Heuristic/Metaheuristic Technique Genetic algorithm (GA) 4 2,27,28,47 Particle swarm optimization (PSO) 1…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…Hierarchical clustering 5 19,30,33,35,38 Customized clustering algorithm 4 [22][23][24]43 K-means 1 50 Seed algorithm 1 41 Cohesion algorithm 1 41 Graph-based clustering 1 21 Heuristic/Metaheuristic Technique Genetic algorithm (GA) 4 2,27,28,47 Particle swarm optimization (PSO) 1…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…Clustering is the process of grouping together items that share some common characteristics. It has been used for several problems such as document classification, crime identity localization, insurance fraud detection and other problems [20]. There exist several types of clustering techniques such as Agglomerative Hierarchical Clustering, Expectation-Maximization (EM) Clustering, Mean-Shift Clustering, K-Means Clustering and more where each excels under some circumstances.…”
Section: Clusteringmentioning
confidence: 99%
“…Now that the problem became of a large scale, we expect to have a wider gap between the two methods. Figures 17,18,19,and 20 show the experimental results. A wider gap is observed as the number of hosts and services increase.…”
Section: Quality Of Solutionsmentioning
confidence: 99%