Tools
Tools
Pourabdollah, A. 
ORCID: 0000-0001-7737-1393 and Mendel, J.M.,
2024.
A non-iterative quantum computation for Karnik-Mendel algorithms.
IEEE International Fuzzy Systems Conference. Proceedings.
ISSN 1544-5615
|
Text
2237693_Pourabdollah.pdf - Post-print Download (554kB) | Preview |
Abstract
Karnik-Mendel method (KM) is widely known for type-reduction of interval type-2 fuzzy sets. The original and enhanced solutions of KM use various forms of iteration to converge onto the result, leading to different levels of computational complexities. Based on the algorithmic advancements in quantum computing, this paper proposes a non-iterative quantum computing solution to KM. We map the KM problem to the problem of minimising an objective function in the form of a binary constrained quadratic model (CQM) which can then be solved in a single run using “quantum annealing”. The algorithms used in each step, together with a numerical example and the results from real quantum computer are provided. Quantum technology permitting in the future, the proposed solution can potentially remove the known defuzzification bottleneck of designing type-2 fuzzy systems.
| Item Type: | Journal article | ||||||
|---|---|---|---|---|---|---|---|
| Publication Title: | IEEE International Fuzzy Systems Conference. Proceedings | ||||||
| Creators: | Pourabdollah, A. and Mendel, J.M. | ||||||
| Publisher: | Institute of Electrical and Electronics Engineers | ||||||
| Date: | 5 August 2024 | ||||||
| ISSN: | 1544-5615 | ||||||
| Identifiers: |
|
||||||
| Divisions: | Schools > School of Science and Technology | ||||||
| Record created by: | Jeremy Silvester | ||||||
| Date Added: | 18 Oct 2024 08:57 | ||||||
| Last Modified: | 18 Oct 2024 08:57 | ||||||
| URI: | https://irep.ntu.ac.uk/id/eprint/52436 |
Actions (login required)
 |
Edit View |
Views
Views per month over past year
Downloads
Downloads per month over past year
