CoChat

Towards a Quantum-Inspired Binary Classifier

Open access
Tiwari, Prayag, Melucci, Massimo · 2019 · IEEE Access
Cited by 58

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Several research works have demonstrated the effectiveness of machine learning algorithms but the state-of-the-art algorithms are based on the classical theories of probability and logic. Quantum Mechanics (QM) has already shown its effectiveness in many fields and researchers have proposed several interesting results which cannot be obtained through classical theory. In recent years, researchers have been trying to investigate whether the QM can help to improve the classical machine learning algorithms. It is believed that the theory of QM may also inspire an effective algorithm if it is implemented properly. From this inspiration, we propose the quantum-inspired binary classifier, which is based on quantum detection theory. We used text corpora and image corpora to explore the effect of our proposed model. Our proposed model outperforms the state-of-the-art models in terms of precision, recall, and F-measure for several topics (categories) in the 20 newsgroup text corpora. Our proposed model outperformed all the baselines in terms of recall when the MNIST handwritten image dataset was used; F-measure is also higher for most of the categories and precision is also higher for some categories. Our proposed model suggests that binary classification effectiveness can be achieved by using quantum detection theory. In particular, we found that our Quantum-Inspired Binary Classifier can increase the precision, recall, and F-measure of classification where the state-of-the-art methods cannot.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2019.2904624

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

Metadata

Authors
Tiwari, P., & Melucci, M.
Venue
IEEE Access
Published
2019
Volume
7
Pages
42354-42372
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2922968028
Cited by
58
References
5
FWCI
3.91
Type
journal article
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.