Entropy-regularized fuzzy clustering for non-euclidean relational data and indefinite kernel data

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper, an entropy-regularized fuzzy clustering approach for non-Euclidean relational data and indefinite kernel data is developed that has not previously been discussed. It is important because relational data and kernel data are not always Euclidean and positive semi-definite, respectively. It is theoretically determined that an entropy-regularized approach for both non-Euclidean relational data and indefinite kernel data can be applied without using a β -spread transformation, and that two other options make the clustering results crisp for both data types. These results are in contrast to those from the standard approach. Numerical experiments are employed to verify the theoretical results, and the clustering accuracy of three entropy-regularized approaches for non-Euclidean relational data, and three for indefinite kernel data, is compared.

Original languageEnglish
Pages (from-to)784-792
Number of pages9
JournalJournal of Advanced Computational Intelligence and Intelligent Informatics
Volume16
Issue number7
Publication statusPublished - 2012 Nov

Fingerprint

Fuzzy clustering
Entropy
Experiments

Keywords

  • Entropy-regularized fuzzy c-means
  • Indefinite kernel
  • Non- Euclidean relational data

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Human-Computer Interaction

Cite this

@article{bed8f9671081475fa8d4b7fffd89ec75,
title = "Entropy-regularized fuzzy clustering for non-euclidean relational data and indefinite kernel data",
abstract = "In this paper, an entropy-regularized fuzzy clustering approach for non-Euclidean relational data and indefinite kernel data is developed that has not previously been discussed. It is important because relational data and kernel data are not always Euclidean and positive semi-definite, respectively. It is theoretically determined that an entropy-regularized approach for both non-Euclidean relational data and indefinite kernel data can be applied without using a β -spread transformation, and that two other options make the clustering results crisp for both data types. These results are in contrast to those from the standard approach. Numerical experiments are employed to verify the theoretical results, and the clustering accuracy of three entropy-regularized approaches for non-Euclidean relational data, and three for indefinite kernel data, is compared.",
keywords = "Entropy-regularized fuzzy c-means, Indefinite kernel, Non- Euclidean relational data",
author = "Yuchi Kanzawa",
year = "2012",
month = "11",
language = "English",
volume = "16",
pages = "784--792",
journal = "Journal of Advanced Computational Intelligence and Intelligent Informatics",
issn = "1343-0130",
publisher = "Fuji Technology Press",
number = "7",

}

TY - JOUR

T1 - Entropy-regularized fuzzy clustering for non-euclidean relational data and indefinite kernel data

AU - Kanzawa, Yuchi

PY - 2012/11

Y1 - 2012/11

N2 - In this paper, an entropy-regularized fuzzy clustering approach for non-Euclidean relational data and indefinite kernel data is developed that has not previously been discussed. It is important because relational data and kernel data are not always Euclidean and positive semi-definite, respectively. It is theoretically determined that an entropy-regularized approach for both non-Euclidean relational data and indefinite kernel data can be applied without using a β -spread transformation, and that two other options make the clustering results crisp for both data types. These results are in contrast to those from the standard approach. Numerical experiments are employed to verify the theoretical results, and the clustering accuracy of three entropy-regularized approaches for non-Euclidean relational data, and three for indefinite kernel data, is compared.

AB - In this paper, an entropy-regularized fuzzy clustering approach for non-Euclidean relational data and indefinite kernel data is developed that has not previously been discussed. It is important because relational data and kernel data are not always Euclidean and positive semi-definite, respectively. It is theoretically determined that an entropy-regularized approach for both non-Euclidean relational data and indefinite kernel data can be applied without using a β -spread transformation, and that two other options make the clustering results crisp for both data types. These results are in contrast to those from the standard approach. Numerical experiments are employed to verify the theoretical results, and the clustering accuracy of three entropy-regularized approaches for non-Euclidean relational data, and three for indefinite kernel data, is compared.

KW - Entropy-regularized fuzzy c-means

KW - Indefinite kernel

KW - Non- Euclidean relational data

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

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

M3 - Article

AN - SCOPUS:84872450322

VL - 16

SP - 784

EP - 792

JO - Journal of Advanced Computational Intelligence and Intelligent Informatics

JF - Journal of Advanced Computational Intelligence and Intelligent Informatics

SN - 1343-0130

IS - 7

ER -