2000
DOI: 10.1016/s0031-3203(99)00137-5
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithm-based clustering technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
524
0
19

Year Published

2003
2003
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 1,283 publications
(545 citation statements)
references
References 15 publications
2
524
0
19
Order By: Relevance
“…Also, valid solutions of the problem must be obtained by the genetic operators formulated on these codes. Therefore, to perform genetic algorithms efficiently to solve various problems, it is sometimes necessary to hybridize traditional genetic algorithms with some sort of optimization technique such as gradient descent or clustering [11,16]. Since texture is a regional property, the contextual constraint has to be taken into consideration during the analysis process.…”
Section: K-means Clustering Operatormentioning
confidence: 99%
See 1 more Smart Citation
“…Also, valid solutions of the problem must be obtained by the genetic operators formulated on these codes. Therefore, to perform genetic algorithms efficiently to solve various problems, it is sometimes necessary to hybridize traditional genetic algorithms with some sort of optimization technique such as gradient descent or clustering [11,16]. Since texture is a regional property, the contextual constraint has to be taken into consideration during the analysis process.…”
Section: K-means Clustering Operatormentioning
confidence: 99%
“…[3,8,16,22,24] due to their domain independent nature and its capability of finding optimal or near optimal solutions in a large search space. An approach hybridizing genetic algorithm with K-means clustering algorithm is proposed in this work in attempt to provide a low cost solution to the over-segmentation problem of Ref.…”
Section: Introductionmentioning
confidence: 99%
“…Mualik and Bandyopadhyay [16] proposed a genetic algorithm based method to solve the clustering problem and experiment on synthetic and real life datasets to evaluate the performance. The results showed that GA-based method might improve the final output of K-means.…”
Section: Introductionmentioning
confidence: 99%
“…One of the most important disadvantages of this algorithm is that it is very sensitive to the initial configuration and may be trapped in a local minimum [15]. Therefore, several approximate methods such as Simulated Annealing (SA) [6] and Genetic Algorithm (GA) [7] have been developed to solve the above problem.…”
Section: Clusteringmentioning
confidence: 99%
“…The clustering problem can be stated as finding the clusters such that the between-group scatter is maximized and withingroup scatter is minimized. Many heuristic techniques for clustering exist in the literatures, which address the global minimization of squared-error criterion function, Genetic Algorithms (GA) [1] [3][4] [7] and Simulated Annealing (SA) [6] are two of these techniques.…”
Section: Introductionmentioning
confidence: 99%