Skip to main content

2016 | OriginalPaper | Buchkapitel

A Quantum Annealing Approach to Biclustering

verfasst von : Lorenzo Bottarelli, Manuele Bicego, Matteo Denitto, Alessandra Di Pierro, Alessandro Farinelli

Erschienen in: Theory and Practice of Natural Computing

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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 be clustered simultaneously. Quantum information processing could provide a viable alternative to combat such a complexity. A notable work in this direction is the recent development of the D-Wave™  computer, whose processor is able to exploit quantum mechanical effects in order to perform quantum annealing. The question motivating this work is whether the use of this special hardware is a viable approach to efficiently solve the biclustering problem. As a first step towards the solution of this problem, we show a feasible encoding of biclustering into the D-Wave™  quantum annealing hardware, and provide a theoretical analysis of its correctness.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
According to the quantum adiabatic theorem, a quantum system that begins in the non-degenerate ground state of a time-dependent Hamiltonian will remain in the instantaneous ground state provided the Hamiltonian changes sufficiently slowly.
 
Literatur
1.
Zurück zum Zitat Ayadi, W., Elloumi, M., Hao, J.: Bimine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Knowl. Based Syst. 35, 224–234 (2012)CrossRef Ayadi, W., Elloumi, M., Hao, J.: Bimine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Knowl. Based Syst. 35, 224–234 (2012)CrossRef
2.
Zurück zum Zitat Badea, L.: Generalized clustergrams for overlapping biclusters. In: IJCAI, pp. 1383–1388 (2009) Badea, L.: Generalized clustergrams for overlapping biclusters. In: IJCAI, pp. 1383–1388 (2009)
3.
Zurück zum Zitat Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15(10), 3241–3253 (1982)MathSciNetCrossRef Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15(10), 3241–3253 (1982)MathSciNetCrossRef
4.
Zurück zum Zitat Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: The order-preserving submatrix problem. J. Comput. Biol. 10(3–4), 373–384 (2003)CrossRef Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: The order-preserving submatrix problem. J. Comput. Biol. 10(3–4), 373–384 (2003)CrossRef
5.
Zurück zum Zitat Bicego, M., Lovato, P., Ferrarini, A., Delledonne, M.: Biclustering of expression microarray data with topic models. In: International Conference on Pattern Recognition (ICPR2010), pp. 2728–2731 (2010) Bicego, M., Lovato, P., Ferrarini, A., Delledonne, M.: Biclustering of expression microarray data with topic models. In: International Conference on Pattern Recognition (ICPR2010), pp. 2728–2731 (2010)
6.
Zurück zum Zitat Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. ArXiv e-prints, June 2014 Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. ArXiv e-prints, June 2014
7.
Zurück zum Zitat Cheng, Y., Church, G.: Biclustering of expression data. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB00), pp. 93–103 (2000) Cheng, Y., Church, G.: Biclustering of expression data. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB00), pp. 93–103 (2000)
9.
Zurück zum Zitat Denchev, V.S., Boixo, S., Isakov, S.V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., Neven, H.: What is the computational value of finite-range tunneling? Phys. Rev. X 6(3), 031015 (2016) Denchev, V.S., Boixo, S., Isakov, S.V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., Neven, H.: What is the computational value of finite-range tunneling? Phys. Rev. X 6(3), 031015 (2016)
10.
Zurück zum Zitat Denitto, M., Farinelli, A., Franco, G., Bicego, M.: A binary factor graph model for biclustering. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 394–403. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44415-3_40 Denitto, M., Farinelli, A., Franco, G., Bicego, M.: A binary factor graph model for biclustering. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 394–403. Springer, Heidelberg (2014). doi:10.​1007/​978-3-662-44415-3_​40
11.
Zurück zum Zitat Dhillon, I.: Coclustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 269–274 (2001) Dhillon, I.: Coclustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 269–274 (2001)
12.
Zurück zum Zitat Dolnicar, S., Kaiser, S., Lazarevski, K., Leisch, F.: Biclustering : overcoming data dimensionality problems in market segmentation. J. Travel Res. Q. Publ. Travel Tourism Res. Assoc. 51(1), 41–49 (2012) Dolnicar, S., Kaiser, S., Lazarevski, K., Leisch, F.: Biclustering : overcoming data dimensionality problems in market segmentation. J. Travel Res. Q. Publ. Travel Tourism Res. Assoc. 51(1), 41–49 (2012)
13.
14.
Zurück zum Zitat Finnila, A.B., Gomez, M.A., Sebenik, C., Stenson, C., Doll, J.D.: Quantum annealing: A new method for minimizing multidimensional functions. Chem. Phys. Lett. 219, 343–348 (1994)CrossRef Finnila, A.B., Gomez, M.A., Sebenik, C., Stenson, C., Doll, J.D.: Quantum annealing: A new method for minimizing multidimensional functions. Chem. Phys. Lett. 219, 343–348 (1994)CrossRef
15.
Zurück zum Zitat Flores, J.L., Inza, I., Larranaga, P., Calvo, B.: A new measure for gene expression biclustering based on non-parametric correlation. Comput. Methods Programs Biomed. 112(3), 367–397 (2013)CrossRef Flores, J.L., Inza, I., Larranaga, P., Calvo, B.: A new measure for gene expression biclustering based on non-parametric correlation. Comput. Methods Programs Biomed. 112(3), 367–397 (2013)CrossRef
16.
Zurück zum Zitat Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355–5363 (1998)CrossRef Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355–5363 (1998)CrossRef
17.
Zurück zum Zitat Kochenberger, G., Hao, J., Glover, F., Lewis, M., Lü, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58–81 (2014)MathSciNetCrossRefMATH Kochenberger, G., Hao, J., Glover, F., Lewis, M., Lü, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58–81 (2014)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Kurihara, K., Tanaka, S., Miyashita, S.: Quantum annealing for clustering. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 321–328. UAI 2009, AUAI Press, Arlington, Virginia, United States (2009) Kurihara, K., Tanaka, S., Miyashita, S.: Quantum annealing for clustering. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 321–328. UAI 2009, AUAI Press, Arlington, Virginia, United States (2009)
19.
Zurück zum Zitat Madeira, S., Oliveira, A.: Biclustering algorithms for biological data analysis: a survey. IEEE Trans. Comput. Biol. Bioinform. 1, 24–44 (2004)CrossRef Madeira, S., Oliveira, A.: Biclustering algorithms for biological data analysis: a survey. IEEE Trans. Comput. Biol. Bioinform. 1, 24–44 (2004)CrossRef
20.
Zurück zum Zitat Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.: Survey of multiobjective evolutionary algorithms for data mining: Part ii. Evol. Comput. IEEE Trans. 18(1), 20–35 (2014)CrossRef Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.: Survey of multiobjective evolutionary algorithms for data mining: Part ii. Evol. Comput. IEEE Trans. 18(1), 20–35 (2014)CrossRef
21.
Zurück zum Zitat Neven, H., Rose, G., Macready, W.G.: Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization, ArXiv e-prints, April 2008 Neven, H., Rose, G., Macready, W.G.: Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization, ArXiv e-prints, April 2008
24.
Zurück zum Zitat Prelić, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., Zitzler, E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122–1129 (2006)CrossRef Prelić, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., Zitzler, E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122–1129 (2006)CrossRef
25.
Zurück zum Zitat Rieffel, E.G., Venturelli, D., O’Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum annealer for hard operational planning problems. Quantum Inform. Process. 14, 1–36 (2015)CrossRefMATH Rieffel, E.G., Venturelli, D., O’Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum annealer for hard operational planning problems. Quantum Inform. Process. 14, 1–36 (2015)CrossRefMATH
26.
Zurück zum Zitat Santoro, G.E., Tosatti, E.: Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A Math. Gen. 39(36), R393–R431 (2006)MathSciNetCrossRefMATH Santoro, G.E., Tosatti, E.: Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A Math. Gen. 39(36), R393–R431 (2006)MathSciNetCrossRefMATH
27.
Zurück zum Zitat Tu, K., Ouyang, X., Han, D., Honavar, V.: Exemplar-based robust coherent biclustering. In: SDM, pp. 884–895. SIAM (2011) Tu, K., Ouyang, X., Han, D., Honavar, V.: Exemplar-based robust coherent biclustering. In: SDM, pp. 884–895. SIAM (2011)
Metadaten
Titel
A Quantum Annealing Approach to Biclustering
verfasst von
Lorenzo Bottarelli
Manuele Bicego
Matteo Denitto
Alessandra Di Pierro
Alessandro Farinelli
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-49001-4_14

Premium Partner