Gaussian-kernel c-means clustering algorithms
Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inac...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Chang-Chien, Shou-Jen [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft computing - Springer Berlin Heidelberg, 1997, 25(2020), 3 vom: 15. Apr., Seite 1699-1716 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2020 ; number:3 ; day:15 ; month:04 ; pages:1699-1716 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-020-04924-6 |
|---|
| Katalog-ID: |
OLC2123661279 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2123661279 | ||
| 003 | DE-627 | ||
| 005 | 20230505074811.0 | ||
| 007 | tu | ||
| 008 | 230505s2020 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-020-04924-6 |2 doi | |
| 035 | |a (DE-627)OLC2123661279 | ||
| 035 | |a (DE-He213)s00500-020-04924-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 11 |2 ssgn | ||
| 100 | 1 | |a Chang-Chien, Shou-Jen |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Gaussian-kernel c-means clustering algorithms |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag GmbH Germany, part of Springer Nature 2020 | ||
| 520 | |a Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. | ||
| 650 | 4 | |a Clustering | |
| 650 | 4 | |a Hard | |
| 650 | 4 | |a -means (HCM) | |
| 650 | 4 | |a Fuzzy | |
| 650 | 4 | |a -means (FCM) | |
| 650 | 4 | |a Gaussian-kernel HCM (GK-HCM) | |
| 650 | 4 | |a Gaussian-kernel FCM (GK-FCM) | |
| 650 | 4 | |a MRI segmentation | |
| 700 | 1 | |a Nataliani, Yessica |4 aut | |
| 700 | 1 | |a Yang, Miin-Shen |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Soft computing |d Springer Berlin Heidelberg, 1997 |g 25(2020), 3 vom: 15. Apr., Seite 1699-1716 |w (DE-627)231970536 |w (DE-600)1387526-7 |w (DE-576)060238259 |x 1432-7643 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2020 |g number:3 |g day:15 |g month:04 |g pages:1699-1716 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00500-020-04924-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4277 | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2020 |e 3 |b 15 |c 04 |h 1699-1716 | ||
| author_variant |
s j c c sjcc y n yn m s y msy |
|---|---|
| matchkey_str |
article:14327643:2020----::asinenlmaslseig |
| hierarchy_sort_str |
2020 |
| publishDate |
2020 |
| allfields |
10.1007/s00500-020-04924-6 doi (DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Chang-Chien, Shou-Jen verfasserin aut Gaussian-kernel c-means clustering algorithms 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation Nataliani, Yessica aut Yang, Miin-Shen aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2020), 3 vom: 15. Apr., Seite 1699-1716 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 https://doi.org/10.1007/s00500-020-04924-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2020 3 15 04 1699-1716 |
| spelling |
10.1007/s00500-020-04924-6 doi (DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Chang-Chien, Shou-Jen verfasserin aut Gaussian-kernel c-means clustering algorithms 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation Nataliani, Yessica aut Yang, Miin-Shen aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2020), 3 vom: 15. Apr., Seite 1699-1716 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 https://doi.org/10.1007/s00500-020-04924-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2020 3 15 04 1699-1716 |
| allfields_unstemmed |
10.1007/s00500-020-04924-6 doi (DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Chang-Chien, Shou-Jen verfasserin aut Gaussian-kernel c-means clustering algorithms 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation Nataliani, Yessica aut Yang, Miin-Shen aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2020), 3 vom: 15. Apr., Seite 1699-1716 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 https://doi.org/10.1007/s00500-020-04924-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2020 3 15 04 1699-1716 |
| allfieldsGer |
10.1007/s00500-020-04924-6 doi (DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Chang-Chien, Shou-Jen verfasserin aut Gaussian-kernel c-means clustering algorithms 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation Nataliani, Yessica aut Yang, Miin-Shen aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2020), 3 vom: 15. Apr., Seite 1699-1716 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 https://doi.org/10.1007/s00500-020-04924-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2020 3 15 04 1699-1716 |
| allfieldsSound |
10.1007/s00500-020-04924-6 doi (DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Chang-Chien, Shou-Jen verfasserin aut Gaussian-kernel c-means clustering algorithms 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation Nataliani, Yessica aut Yang, Miin-Shen aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2020), 3 vom: 15. Apr., Seite 1699-1716 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 https://doi.org/10.1007/s00500-020-04924-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2020 3 15 04 1699-1716 |
| language |
English |
| source |
Enthalten in Soft computing 25(2020), 3 vom: 15. Apr., Seite 1699-1716 volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 |
| sourceStr |
Enthalten in Soft computing 25(2020), 3 vom: 15. Apr., Seite 1699-1716 volume:25 year:2020 number:3 day:15 month:04 pages:1699-1716 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Soft computing |
| authorswithroles_txt_mv |
Chang-Chien, Shou-Jen @@aut@@ Nataliani, Yessica @@aut@@ Yang, Miin-Shen @@aut@@ |
| publishDateDaySort_date |
2020-04-15T00:00:00Z |
| hierarchy_top_id |
231970536 |
| dewey-sort |
14 |
| id |
OLC2123661279 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2123661279</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505074811.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-020-04924-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2123661279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-020-04924-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chang-Chien, Shou-Jen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Gaussian-kernel c-means clustering algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Clustering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hard</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-means (HCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fuzzy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-means (FCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gaussian-kernel HCM (GK-HCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gaussian-kernel FCM (GK-FCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MRI segmentation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nataliani, Yessica</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Miin-Shen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">25(2020), 3 vom: 15. Apr., Seite 1699-1716</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:15</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:1699-1716</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-020-04924-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">15</subfield><subfield code="c">04</subfield><subfield code="h">1699-1716</subfield></datafield></record></collection>
|
| author |
Chang-Chien, Shou-Jen |
| spellingShingle |
Chang-Chien, Shou-Jen ddc 004 ssgn 11 misc Clustering misc Hard misc -means (HCM) misc Fuzzy misc -means (FCM) misc Gaussian-kernel HCM (GK-HCM) misc Gaussian-kernel FCM (GK-FCM) misc MRI segmentation Gaussian-kernel c-means clustering algorithms |
| authorStr |
Chang-Chien, Shou-Jen |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)231970536 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1432-7643 |
| topic_title |
004 VZ 11 ssgn Gaussian-kernel c-means clustering algorithms Clustering Hard -means (HCM) Fuzzy -means (FCM) Gaussian-kernel HCM (GK-HCM) Gaussian-kernel FCM (GK-FCM) MRI segmentation |
| topic |
ddc 004 ssgn 11 misc Clustering misc Hard misc -means (HCM) misc Fuzzy misc -means (FCM) misc Gaussian-kernel HCM (GK-HCM) misc Gaussian-kernel FCM (GK-FCM) misc MRI segmentation |
| topic_unstemmed |
ddc 004 ssgn 11 misc Clustering misc Hard misc -means (HCM) misc Fuzzy misc -means (FCM) misc Gaussian-kernel HCM (GK-HCM) misc Gaussian-kernel FCM (GK-FCM) misc MRI segmentation |
| topic_browse |
ddc 004 ssgn 11 misc Clustering misc Hard misc -means (HCM) misc Fuzzy misc -means (FCM) misc Gaussian-kernel HCM (GK-HCM) misc Gaussian-kernel FCM (GK-FCM) misc MRI segmentation |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Soft computing |
| hierarchy_parent_id |
231970536 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Soft computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 |
| title |
Gaussian-kernel c-means clustering algorithms |
| ctrlnum |
(DE-627)OLC2123661279 (DE-He213)s00500-020-04924-6-p |
| title_full |
Gaussian-kernel c-means clustering algorithms |
| author_sort |
Chang-Chien, Shou-Jen |
| journal |
Soft computing |
| journalStr |
Soft computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
txt |
| container_start_page |
1699 |
| author_browse |
Chang-Chien, Shou-Jen Nataliani, Yessica Yang, Miin-Shen |
| container_volume |
25 |
| class |
004 VZ 11 ssgn |
| format_se |
Aufsätze |
| author-letter |
Chang-Chien, Shou-Jen |
| doi_str_mv |
10.1007/s00500-020-04924-6 |
| dewey-full |
004 |
| title_sort |
gaussian-kernel c-means clustering algorithms |
| title_auth |
Gaussian-kernel c-means clustering algorithms |
| abstract |
Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. © Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| abstractGer |
Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. © Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| abstract_unstemmed |
Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation. © Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 |
| container_issue |
3 |
| title_short |
Gaussian-kernel c-means clustering algorithms |
| url |
https://doi.org/10.1007/s00500-020-04924-6 |
| remote_bool |
false |
| author2 |
Nataliani, Yessica Yang, Miin-Shen |
| author2Str |
Nataliani, Yessica Yang, Miin-Shen |
| ppnlink |
231970536 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-020-04924-6 |
| up_date |
2024-07-03T19:21:20.525Z |
| _version_ |
1803586875452030977 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2123661279</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505074811.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-020-04924-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2123661279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-020-04924-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chang-Chien, Shou-Jen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Gaussian-kernel c-means clustering algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-means (HCM) (or called k-means) and fuzzy c-means (FCM) are the most known clustering algorithms. However, these HCM and FCM algorithms work worse for data sets in a noisy environment and get inaccuracy when the data set has different shape clusters. For solving these drawbacks in HCM and FCM, Wu and Yang (Pattern Recognit 35:2267–2278, 2002) proposed the alternative c-means clustering with an exponential-type distance that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we construct a more generalization of AHCM and AFCM with Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. For theoretical behaviors of GK-FCM, we analyze the bordered Hessian matrix and then give the theoretical properties of the GK-FCM algorithm. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness. Finally, we apply the GK-FCM algorithm to MRI segmentation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Clustering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hard</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-means (HCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fuzzy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-means (FCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gaussian-kernel HCM (GK-HCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gaussian-kernel FCM (GK-FCM)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MRI segmentation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nataliani, Yessica</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Miin-Shen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">25(2020), 3 vom: 15. Apr., Seite 1699-1716</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:15</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:1699-1716</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-020-04924-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">15</subfield><subfield code="c">04</subfield><subfield code="h">1699-1716</subfield></datafield></record></collection>
|
| score |
7.3997965 |