An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index

Hsiang Chuan Liu; Yen Kuei Yu; Hsien-Chang Tsai; Tung Sheng Liu; Bai Cheng Jeng

doi:10.1109/ICMLC.2011.6016708

An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index

Hsiang Chuan Liu, Yen Kuei Yu, Hsien-Chang Tsai, Tung Sheng Liu, Bai Cheng Jeng

Department of Biology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, a novel fuzzy c-means algorithm based on an intuitionistic extension index for any n-dimensional point set, namely the E-FCM algorithm, is being proposed. If the intuitionistic extension index is equal to 0, then the proposed new algorithm is just the traditional fuzzy c-means algorithm (FCM), in other words, the E-FCM algorithm is a generalization of the FCM algorithm. It is quite different from Xu and Wu's intuitionistic fuzzy C-means clustering algorithm (IFCM algorithm), since the latter can only be used for intuitionistic fuzzy sets, but not for any n-dimensional point set. The experimental results of three benchmark data sets show that the proposed E-FCM algorithm outperforms the FCM algorithm.

Original language	English
Title of host publication	Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
Pages	199-203
Number of pages	5
Volume	1
DOIs	https://doi.org/10.1109/ICMLC.2011.6016708
Publication status	Published - 2011 Nov 7
Event	2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 - Guilin, Guangxi, China Duration: 2011 Jul 10 → 2011 Jul 13

Other

Other	2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
Country	China
City	Guilin, Guangxi
Period	11-07-10 → 11-07-13

Fingerprint

All Science Journal Classification (ASJC) codes

Artificial Intelligence
Computational Theory and Mathematics
Computer Networks and Communications
Human-Computer Interaction

Cite this

Liu, H. C., Yu, Y. K., Tsai, H-C., Liu, T. S., & Jeng, B. C. (2011). An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index. In Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 (Vol. 1, pp. 199-203). [6016708] https://doi.org/10.1109/ICMLC.2011.6016708

@inproceedings{820b546e1450489d90a20da0be22c99d,

title = "An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index",

abstract = "In this paper, a novel fuzzy c-means algorithm based on an intuitionistic extension index for any n-dimensional point set, namely the E-FCM algorithm, is being proposed. If the intuitionistic extension index is equal to 0, then the proposed new algorithm is just the traditional fuzzy c-means algorithm (FCM), in other words, the E-FCM algorithm is a generalization of the FCM algorithm. It is quite different from Xu and Wu's intuitionistic fuzzy C-means clustering algorithm (IFCM algorithm), since the latter can only be used for intuitionistic fuzzy sets, but not for any n-dimensional point set. The experimental results of three benchmark data sets show that the proposed E-FCM algorithm outperforms the FCM algorithm.",

author = "Liu, {Hsiang Chuan} and Yu, {Yen Kuei} and Hsien-Chang Tsai and Liu, {Tung Sheng} and Jeng, {Bai Cheng}",

year = "2011",

month = nov

day = "7",

doi = "10.1109/ICMLC.2011.6016708",

language = "English",

isbn = "9781457703065",

volume = "1",

pages = "199--203",

booktitle = "Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011",

note = "2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 ; Conference date: 10-07-2011 Through 13-07-2011",

}

Liu, HC, Yu, YK, Tsai, H-C, Liu, TS & Jeng, BC 2011, An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index. in Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. vol. 1, 6016708, pp. 199-203, 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011, Guilin, Guangxi, China, 11-07-10. https://doi.org/10.1109/ICMLC.2011.6016708

An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index. / Liu, Hsiang Chuan; Yu, Yen Kuei; Tsai, Hsien-Chang; Liu, Tung Sheng; Jeng, Bai Cheng.

Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. Vol. 1 2011. p. 199-203 6016708.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An extensional fuzzy c-means clustering algorithm based on intuitionistic extension index

AU - Liu, Hsiang Chuan

AU - Yu, Yen Kuei

AU - Tsai, Hsien-Chang

AU - Liu, Tung Sheng

AU - Jeng, Bai Cheng

PY - 2011/11/7

Y1 - 2011/11/7

N2 - In this paper, a novel fuzzy c-means algorithm based on an intuitionistic extension index for any n-dimensional point set, namely the E-FCM algorithm, is being proposed. If the intuitionistic extension index is equal to 0, then the proposed new algorithm is just the traditional fuzzy c-means algorithm (FCM), in other words, the E-FCM algorithm is a generalization of the FCM algorithm. It is quite different from Xu and Wu's intuitionistic fuzzy C-means clustering algorithm (IFCM algorithm), since the latter can only be used for intuitionistic fuzzy sets, but not for any n-dimensional point set. The experimental results of three benchmark data sets show that the proposed E-FCM algorithm outperforms the FCM algorithm.

AB - In this paper, a novel fuzzy c-means algorithm based on an intuitionistic extension index for any n-dimensional point set, namely the E-FCM algorithm, is being proposed. If the intuitionistic extension index is equal to 0, then the proposed new algorithm is just the traditional fuzzy c-means algorithm (FCM), in other words, the E-FCM algorithm is a generalization of the FCM algorithm. It is quite different from Xu and Wu's intuitionistic fuzzy C-means clustering algorithm (IFCM algorithm), since the latter can only be used for intuitionistic fuzzy sets, but not for any n-dimensional point set. The experimental results of three benchmark data sets show that the proposed E-FCM algorithm outperforms the FCM algorithm.

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

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

U2 - 10.1109/ICMLC.2011.6016708

DO - 10.1109/ICMLC.2011.6016708

M3 - Conference contribution

AN - SCOPUS:80155150876

SN - 9781457703065

VL - 1

SP - 199

EP - 203

BT - Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011

T2 - 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011

Y2 - 10 July 2011 through 13 July 2011

ER -

Access to Document

10.1109/ICMLC.2011.6016708