Learning Systems and Intelligent Robots 1974
DOI: 10.1007/978-1-4684-2106-4_15
|View full text |Cite
|
Sign up to set email alerts
|

Computational Algorithms for Interactive Pattern Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…To evaluate the performance of GTKMeans algorithm, it was compared with the KMeans algorithm on the British Town data set [4]. Since KMeans and GTKMeans algorithms have same starting points, and both methods identify same clusters during the initialization phase, the initial knowledge of the environment is same for these methods.…”
Section: Experiments With Existing Data Setsmentioning
confidence: 99%
See 1 more Smart Citation
“…To evaluate the performance of GTKMeans algorithm, it was compared with the KMeans algorithm on the British Town data set [4]. Since KMeans and GTKMeans algorithms have same starting points, and both methods identify same clusters during the initialization phase, the initial knowledge of the environment is same for these methods.…”
Section: Experiments With Existing Data Setsmentioning
confidence: 99%
“…A set consisting of the four principal socioeconomic data components of 50 British towns. The data set was obtained from [4]. .…”
Section: Simulation Setupmentioning
confidence: 99%