Fujipress Home | Search | About FINDER

Paper:
Language: English:

Algorithms of Hard c-Means Clustering Using Kernel Functions in Support Vector Machines


Sadaaki Miyamoto* and Youichi Nakayama**


*Institute of Engineering Mechanics and Systems, University of Tsukuba, Ibaraki 305-8573, Japan
**Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki 305-8573, Japan


Received: August 28, 2002

Accepted: November 18, 2002


Keywords: clustering, hard c-means, support vector machine

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.7, No.1 pp. 19-24, 2003

Abstract



We discuss hard c-means clustering using a mapping into a high-dimensional space considered within the theory of support vector machines. Two types of iterative algorithms are developed. Effectiveness of the proposed method is shown by numerical examples.
preview Preview (PDF)  full text Full Text (PDF 2665KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us