Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이정훈 | - |
dc.date.accessioned | 2023-07-12T02:03:09Z | - |
dc.date.available | 2023-07-12T02:03:09Z | - |
dc.date.issued | 2009-08 | - |
dc.identifier.citation | IEEE International Conference on Fuzzy Systems, Page. 480-483 | - |
dc.identifier.issn | 1098-7584 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/5277167?arnumber=5277167&SID=EBSCO:edseee | en_US |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/183129 | - |
dc.description.abstract | The Possibilistic C-means (PCM) was proposed to overcome some of the drawbacks associated with the Fuzzy C-means (FCM) such as improved performance for noise data. However, PCM possesses some drawbacks such as sensitivity in the initial parameter values and to patterns that have relatively short distances between the prototypes. To overcome theses drawbacks, we propose an interval type-2 fuzzy approach to PCM by considering uncertainty in the fuzzy parameter m in the PCM algorithm. ©2009 IEEE. | - |
dc.language | en | - |
dc.publisher | IEEE | - |
dc.subject | Fuzzy C-means | - |
dc.subject | Possibilistic c-means | - |
dc.subject | Fuzzy approach | - |
dc.subject | Fuzzy parameter | - |
dc.subject | Pattern recognition | - |
dc.subject | Initial parameter | - |
dc.subject | Short distances | - |
dc.subject | Pulse code modulation | - |
dc.subject | Noise data | - |
dc.subject | Fuzzy systems | - |
dc.title | An interval type-2 fuzzy PCM algorithm for pattern recognition | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/FUZZY.2009.5277167 | - |
dc.relation.page | 480-483 | - |
dc.relation.journal | IEEE International Conference on Fuzzy Systems | - |
dc.contributor.googleauthor | Min, Ji-Hee | - |
dc.contributor.googleauthor | Shim, Eun-A | - |
dc.contributor.googleauthor | Rhee, Frank Chung-Hoon | - |
dc.sector.campus | E | - |
dc.sector.daehak | 공학대학 | - |
dc.sector.department | 전자공학부 | - |
dc.identifier.pid | frhee | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.