Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007) 2007
DOI: 10.1109/fskd.2007.55
|View full text |Cite
|
Sign up to set email alerts
|

A Mean Field Annealing Algorithm for Fuzzy Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2008
2008

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Here, the number Gi represents the coordinates of the cluster center of the digit i. In other words, it shows that the distances between the pair of digits (1,5), (4,6), (2,3), and (7,8) are closer than other cases. And it means that the shape of the digit 4 is close to that of 6, and so on, which coincides with the intuitive human judgment.…”
Section: Experiments and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, the number Gi represents the coordinates of the cluster center of the digit i. In other words, it shows that the distances between the pair of digits (1,5), (4,6), (2,3), and (7,8) are closer than other cases. And it means that the shape of the digit 4 is close to that of 6, and so on, which coincides with the intuitive human judgment.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…So, to realize the equation, one-variable SSA is used [6][7] [8]. The difference between SSA and onevariable SSA is that in the SSA, the perturbed state of all the n spins is regarded as a candidate solution, but in one-variable SSA, the average of the perturbed state of only one spin is regarded as an equilibrium average of that spin under the field of the rest of the system.…”
Section: One Variable Stochastic Simulated Annealing (Ovssa)mentioning
confidence: 99%