Biclustering with a quantum annealer
Several problem in Artificial Intelligence and Pattern Recognition are computationally intractable due to their inherent complexity and the exponential size of the solution space. One example of such problems is biclustering, a specific clustering problem where rows and columns of a data-matrix must...
Saved in:
Published in | Soft computing (Berlin, Germany) Vol. 22; no. 18; pp. 6247 - 6260 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.09.2018
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!