Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Supervised machine learning is a popular approach to the solution of many real‐life problems. This approach is characterized by the use of labeled datasets to train algorithms for classifying data or predicting outcomes accurately. The question of the extent to which quantum computation can help improve existing classical supervised learning methods is the subject of intense research in the area of quantum machine learning. The debate centers on whether an advantage can be achieved already with current noisy quantum computer prototypes or it is strictly dependent on the full power of a fault‐tolerant quantum computer. The current proposals can be classified into methods that can be suitably implemented on near‐term quantum computers but are essentially empirical, and methods that use quantum algorithms with a provable advantage over their classical counterparts but only when implemented on the still unavailable fault‐tolerant quantum computer.It turns out that, for the latter class, the benefit offered by quantum computation can be shown rigorously using quantum kernels, whereas the approach based on near‐term quantum computers is very unlikely to bring any advantage if implemented in the form of hybrid algorithms that delegate the hard part (optimization) to the far more powerful classical computers.
Supervised machine learning is a popular approach to the solution of many real‐life problems. This approach is characterized by the use of labeled datasets to train algorithms for classifying data or predicting outcomes accurately. The question of the extent to which quantum computation can help improve existing classical supervised learning methods is the subject of intense research in the area of quantum machine learning. The debate centers on whether an advantage can be achieved already with current noisy quantum computer prototypes or it is strictly dependent on the full power of a fault‐tolerant quantum computer. The current proposals can be classified into methods that can be suitably implemented on near‐term quantum computers but are essentially empirical, and methods that use quantum algorithms with a provable advantage over their classical counterparts but only when implemented on the still unavailable fault‐tolerant quantum computer.It turns out that, for the latter class, the benefit offered by quantum computation can be shown rigorously using quantum kernels, whereas the approach based on near‐term quantum computers is very unlikely to bring any advantage if implemented in the form of hybrid algorithms that delegate the hard part (optimization) to the far more powerful classical computers.
The aim of this study is to enhance the extraction of informative features from complex data through the application of topological data analysis (TDA) using novel topological overlapping measures. Topological data analysis has emerged as a promising methodology for extracting meaningful insights from complex datasets. Existing approaches in TDA often involve extrapolating data points using distance correlation measures, which subsequently constrain downstream predictive tasks. Our objective is to improve the construction of the Vietoris–Rips simplicial complex by introducing topological overlapping measures. These measures take into account the interplay of direct connection strengths and shared neighbours, leading to the identification of persistent topological features. We propose the utilisation of topological overlapping measures to optimise the construction of the Vietoris–Rips simplicial complex, offering a more refined representation of complex data structures. The application of topological overlapping measures results in the identification of plentiful persistent topological features. This enhancement contributes to an improvement of up to 20% in cancer phenotype prediction across different cancer types. Our study demonstrates the effectiveness of utilising topological overlapping measures in optimising the construction of the Vietoris–Rips simplicial complex. The identified persistent topological features significantly enhance the predictive accuracy of cancer phenotypes. This novel approach has the potential to advance the field of topological data analysis and improve our understanding of complex data structures, particularly in the context of cancer research and predictive modelling. Further exploration and application of these measures may yield valuable insights in various domains dealing with intricate datasets.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.