Indefinite kernel fuzzy c-means clustering algorithms

Yuchi Kanzawa, Yasunori Endo, Sadaaki Miyamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. The first proposed algorithm adaptively updated the indefinite kernel matrix such that the dissimilarity between each datum and each cluster center in the feature space is non-negative, instead of subtracting the minimal eigenvalue of the given kernel matrix as its preprocess. This derivation follows the manner in which the non-Euclidean relational fuzzy c-means algorithm is derived from the original relational fuzzy c-means one. The second proposed method produces the memberships by solving the optimization problem in which the constraint of non-negative memberships is added to the one of K-sFCM. This derivation follows the manner in which the non-Euclidean fuzzy relational clustering algorithm is derived from the original relational fuzzy c-means one. Through a numerical example, the proposed algorithms are discussed.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages116-128
Number of pages13
Volume6408 LNAI
DOIs
Publication statusPublished - 2010
Event7th International Conference on Modeling Decisions for Artificial Intelligence, MDAI 2010 - Perpignan
Duration: 2010 Oct 272010 Oct 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6408 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Conference on Modeling Decisions for Artificial Intelligence, MDAI 2010
CityPerpignan
Period10/10/2710/10/29

Fingerprint

Clustering algorithms

Keywords

  • Indefinite kernel
  • Kernel fuzzy c-means
  • Non-Euclidean fuzzy relational clustering
  • Non-Euclidean relational fuzzy c-means

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kanzawa, Y., Endo, Y., & Miyamoto, S. (2010). Indefinite kernel fuzzy c-means clustering algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6408 LNAI, pp. 116-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6408 LNAI). https://doi.org/10.1007/978-3-642-16292-3_13

Indefinite kernel fuzzy c-means clustering algorithms. / Kanzawa, Yuchi; Endo, Yasunori; Miyamoto, Sadaaki.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6408 LNAI 2010. p. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6408 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kanzawa, Y, Endo, Y & Miyamoto, S 2010, Indefinite kernel fuzzy c-means clustering algorithms. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6408 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6408 LNAI, pp. 116-128, 7th International Conference on Modeling Decisions for Artificial Intelligence, MDAI 2010, Perpignan, 10/10/27. https://doi.org/10.1007/978-3-642-16292-3_13
Kanzawa Y, Endo Y, Miyamoto S. Indefinite kernel fuzzy c-means clustering algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6408 LNAI. 2010. p. 116-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-16292-3_13
Kanzawa, Yuchi ; Endo, Yasunori ; Miyamoto, Sadaaki. / Indefinite kernel fuzzy c-means clustering algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6408 LNAI 2010. pp. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{490277de535b4b80a94a72645b876b89,
title = "Indefinite kernel fuzzy c-means clustering algorithms",
abstract = "This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. The first proposed algorithm adaptively updated the indefinite kernel matrix such that the dissimilarity between each datum and each cluster center in the feature space is non-negative, instead of subtracting the minimal eigenvalue of the given kernel matrix as its preprocess. This derivation follows the manner in which the non-Euclidean relational fuzzy c-means algorithm is derived from the original relational fuzzy c-means one. The second proposed method produces the memberships by solving the optimization problem in which the constraint of non-negative memberships is added to the one of K-sFCM. This derivation follows the manner in which the non-Euclidean fuzzy relational clustering algorithm is derived from the original relational fuzzy c-means one. Through a numerical example, the proposed algorithms are discussed.",
keywords = "Indefinite kernel, Kernel fuzzy c-means, Non-Euclidean fuzzy relational clustering, Non-Euclidean relational fuzzy c-means",
author = "Yuchi Kanzawa and Yasunori Endo and Sadaaki Miyamoto",
year = "2010",
doi = "10.1007/978-3-642-16292-3_13",
language = "English",
isbn = "3642162916",
volume = "6408 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "116--128",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Indefinite kernel fuzzy c-means clustering algorithms

AU - Kanzawa, Yuchi

AU - Endo, Yasunori

AU - Miyamoto, Sadaaki

PY - 2010

Y1 - 2010

N2 - This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. The first proposed algorithm adaptively updated the indefinite kernel matrix such that the dissimilarity between each datum and each cluster center in the feature space is non-negative, instead of subtracting the minimal eigenvalue of the given kernel matrix as its preprocess. This derivation follows the manner in which the non-Euclidean relational fuzzy c-means algorithm is derived from the original relational fuzzy c-means one. The second proposed method produces the memberships by solving the optimization problem in which the constraint of non-negative memberships is added to the one of K-sFCM. This derivation follows the manner in which the non-Euclidean fuzzy relational clustering algorithm is derived from the original relational fuzzy c-means one. Through a numerical example, the proposed algorithms are discussed.

AB - This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. The first proposed algorithm adaptively updated the indefinite kernel matrix such that the dissimilarity between each datum and each cluster center in the feature space is non-negative, instead of subtracting the minimal eigenvalue of the given kernel matrix as its preprocess. This derivation follows the manner in which the non-Euclidean relational fuzzy c-means algorithm is derived from the original relational fuzzy c-means one. The second proposed method produces the memberships by solving the optimization problem in which the constraint of non-negative memberships is added to the one of K-sFCM. This derivation follows the manner in which the non-Euclidean fuzzy relational clustering algorithm is derived from the original relational fuzzy c-means one. Through a numerical example, the proposed algorithms are discussed.

KW - Indefinite kernel

KW - Kernel fuzzy c-means

KW - Non-Euclidean fuzzy relational clustering

KW - Non-Euclidean relational fuzzy c-means

UR - http://www.scopus.com/inward/record.url?scp=79956276305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956276305&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16292-3_13

DO - 10.1007/978-3-642-16292-3_13

M3 - Conference contribution

AN - SCOPUS:79956276305

SN - 3642162916

SN - 9783642162916

VL - 6408 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 116

EP - 128

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -