A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm"
This letter is a supplement to the previous paper “A Direct Approach for Determining the Switch Points in the Karnik-Mendel Algorithm”. In the previous paper, the enhanced iterative algorithm with stop condition (EIASC) was shown to be the most inefficient in R. Such outcome is apparently different...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018
|
| Online Access: | https://eprints.nottingham.ac.uk/54722/ |
| _version_ | 1848799069392076800 |
|---|---|
| author | Chen, Chao Wu, Dongrui Garibaldi, Jonathan M. John, Robert Twycross, Jamie Mendel, Jerry |
| author_facet | Chen, Chao Wu, Dongrui Garibaldi, Jonathan M. John, Robert Twycross, Jamie Mendel, Jerry |
| author_sort | Chen, Chao |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | This letter is a supplement to the previous paper “A Direct Approach for Determining the Switch Points in the Karnik-Mendel Algorithm”. In the previous paper, the enhanced iterative algorithm with stop condition (EIASC) was shown to be the most inefficient in R. Such outcome is apparently different from the results in another paper in which EIASC was illustrated to be the most efficient in Matlab. An investigation has been made into this apparent inconsistency and it can be confirmed that both the results in R and Matlab are valid for the EIASC algorithm. The main reason for such phenomenon is the efficiency difference of loop operations in R and Matlab. It should be noted that the efficiency of an algorithm is closely related to its implementation in practice. In this letter, we update the comparisons of the three algorithms in the previous paper based on optimised implementations under five programming languages (Matlab, R, Python, C and Java). From this, we conclude that results in one programming language cannot be simply extended to all languages. |
| first_indexed | 2025-11-14T20:29:48Z |
| format | Article |
| id | nottingham-54722 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T20:29:48Z |
| publishDate | 2018 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-547222018-09-13T08:44:55Z https://eprints.nottingham.ac.uk/54722/ A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" Chen, Chao Wu, Dongrui Garibaldi, Jonathan M. John, Robert Twycross, Jamie Mendel, Jerry This letter is a supplement to the previous paper “A Direct Approach for Determining the Switch Points in the Karnik-Mendel Algorithm”. In the previous paper, the enhanced iterative algorithm with stop condition (EIASC) was shown to be the most inefficient in R. Such outcome is apparently different from the results in another paper in which EIASC was illustrated to be the most efficient in Matlab. An investigation has been made into this apparent inconsistency and it can be confirmed that both the results in R and Matlab are valid for the EIASC algorithm. The main reason for such phenomenon is the efficiency difference of loop operations in R and Matlab. It should be noted that the efficiency of an algorithm is closely related to its implementation in practice. In this letter, we update the comparisons of the three algorithms in the previous paper based on optimised implementations under five programming languages (Matlab, R, Python, C and Java). From this, we conclude that results in one programming language cannot be simply extended to all languages. IEEE 2018-08-13 Article PeerReviewed application/pdf en https://eprints.nottingham.ac.uk/54722/1/08434351%20John.pdf Chen, Chao, Wu, Dongrui, Garibaldi, Jonathan M., John, Robert, Twycross, Jamie and Mendel, Jerry (2018) A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm". IEEE Transactions on Fuzzy Systems . ISSN 1063-6706 https://ieeexplore.ieee.org/document/8434351/ doi:10.1109/tfuzz.2018.2865134 doi:10.1109/tfuzz.2018.2865134 |
| spellingShingle | Chen, Chao Wu, Dongrui Garibaldi, Jonathan M. John, Robert Twycross, Jamie Mendel, Jerry A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title | A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title_full | A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title_fullStr | A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title_full_unstemmed | A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title_short | A Comment on "A direct approach for determining the switch soints in the Karnik-Mendel algorithm" |
| title_sort | comment on "a direct approach for determining the switch soints in the karnik-mendel algorithm" |
| url | https://eprints.nottingham.ac.uk/54722/ https://eprints.nottingham.ac.uk/54722/ https://eprints.nottingham.ac.uk/54722/ |