Biclustering with a quantum annealer
type: Item
instance of: scholarly article
title: Biclustering with a quantum annealer
zbMATH Open document ID: 1398.81049
author: Lorenzo Bottarelli
author: Manuele Bicego
author: Matteo Denitto
author: Alessandra Di Pierro
author: Alessandro Farinelli
author: Riccardo Mengoni
published in: Soft Computing
publication date: 2018-10-23T00:00:00Z
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 81P45
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 6963351
zbMATH Keywords: quantum annealing
zbMATH Keywords: D-wave
zbMATH Keywords: biclustering
describes a project that uses: APCluster
describes a project that uses: Bsig
describes a project that uses: apcluster
describes a project that uses: BiMine+
describes a project that uses: BicPAM
MaRDI profile type: Publication
full work available at URL: s00500-018-3034-z
OpenAlex ID: W2790067285
cites work: Fast clique minor generation in Chimera qubit connectivity graphs
cites work: A biclustering approach based on factor graphs and the max-sum algorithm
cites work: Clustering by Passing Messages Between Data Points
cites work: Bsig: evaluating the statistical significance of biclustering solutions
cites work: The unconstrained binary quadratic programming problem: a survey
cites work: A case study in programming a quantum annealer for hard operational planning problems
cites work: Optimization using quantum mechanics: quantum annealing through adiabatic evolution
DOI: 10.1007/S00500-018-3034-Z
description: scientific article; zbMATH DE number 6963351