LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Zheng, G.L.; Billings, S.A. (1997)
Publisher: Department of Automatic Control and Systems Engineering
Languages: English
Types: Book
Subjects:

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_PATTERNRECOGNITION, ComputingMilieux_MISCELLANEOUS
arxiv: Computer Science::Computer Science and Game Theory
A sequential fuzzy clustering algorithm is proposed based on a modification to the objective function used in the fuzzy competitive learning algorithm. The new learning algorithm can be used to enhance the excitation on the non-winning centroids and to reduce the excitation on the winning centroid when the fuzziness parameter is close to unity. The excitation on the winning centroid can be further reduced when the input pattern is far away from the winning centroid. An excitation-inhibition mechanism can also be introduced into the learning such that the non-winning centroids move towards the input pattern, while the winning centroid moves away from the input pattern when the winning centroid is far away from the input pattern. The new algorithm overcomes the problem of under utilization of centroids found in the k-means or related clustering algorithms and in the fuzzy competitive learning algorithm when the fuzziness parameter is close to unity. The performance of the new algorithm is demonstrated on the IRIS data set.

Share - Bookmark

Cite this article