{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:53:41Z","timestamp":1754110421488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319786797"},{"type":"electronic","value":"9783319786803"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78680-3_5","type":"book-chapter","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T08:35:24Z","timestamp":1521794124000},"page":"65-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Branders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,24]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller, M.: Subgroup discovery. Wiley Interdiscipl. Rev. Data Mining Knowl. Discov. 5(1), 35\u201349 (2015)","journal-title":"Wiley Interdiscipl. Rev. Data Mining Knowl. Discov."},{"issue":"9","key":"5_CR2","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J Bentley","year":"1984","unstructured":"Bentley, J.: Programming pearls: algorithm design techniques. Commun. ACM 27(9), 865\u2013873 (1984)","journal-title":"Commun. ACM"},{"unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: ISMB, vol. 8, pp. 93\u2013103 (2000)","key":"5_CR3"},{"unstructured":"Dawande, M., Keskinocak, P., Tayur, S.: On the biclique problem in bipartite graphs (1996)","key":"5_CR4"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1111\/exsy.12088","volume":"32","author":"H Fanaee-T","year":"2015","unstructured":"Fanaee-T, H., Gama, J.: Eigenspace method for spatiotemporal hotspot detection. Expert Syst. 32(3), 454\u2013464 (2015). eXSY-Nov-13-198.R1","journal-title":"Expert Syst."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2011","unstructured":"Herrera, F., Carmona, C.J., Gonz\u00e1lez, P., del Jesus, M.J.: An overview on subgroup discovery: foundations and applications. Knowl. Inf. Syst. 29(3), 495\u2013525 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-662-44851-9_7","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Le Van","year":"2014","unstructured":"Le Van, T., van Leeuwen, M., Nijssen, S., Fierro, A.C., Marchal, K., De Raedt, L.: Ranked tiling. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 98\u2013113. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44851-9_7"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.ejor.2013.10.043","volume":"235","author":"M L\u00f3pez-Ib\u00e1nez","year":"2014","unstructured":"L\u00f3pez-Ib\u00e1nez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of optimisation algorithms. Eur. J. Oper. Res. 235(3), 569\u2013582 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB) 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer programming and combinatorial optimization. Wiley, Chichester (1988). Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S.: Constraint classification for mixed integer programming formulations. COAL Bull. 20, 8\u201312 (1992)","key":"5_CR10","DOI":"10.1002\/9781118627372.ch2"},{"unstructured":"OscaR Team: OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar","key":"5_CR11"},{"issue":"8","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1200\/JCO.2008.18.1370","volume":"27","author":"JS Parker","year":"2009","unstructured":"Parker, J.S., Mullins, M., Cheang, M.C., Leung, S., Voduc, D., Vickery, T., Davies, S., Fauron, C., He, X., Hu, Z., et al.: Supervised risk predictor of breast cancer based on intrinsic subtypes. J. Clin. Oncol. 27(8), 1160\u20131167 (2009)","journal-title":"J. Clin. Oncol."},{"issue":"6797","key":"5_CR13","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1038\/35021093","volume":"406","author":"CM Perou","year":"2000","unstructured":"Perou, C.M., S\u00f8rlie, T., Eisen, M.B., van de Rijn, M., Jeffrey, S.S., Rees, C.A., Pollack, J.R., Ross, D.T., Johnsen, H., Akslen, L.A., et al.: Molecular portraits of human breast tumours. Nature 406(6797), 747\u2013752 (2000)","journal-title":"Nature"},{"issue":"7","key":"5_CR14","doi-asserted-by":"publisher","first-page":"S8","DOI":"10.1186\/1471-2105-14-S7-S8","volume":"14","author":"G Pio","year":"2013","unstructured":"Pio, G., Ceci, M., D\u2019Elia, D., Loglisci, C., Malerba, D.: A novel biclustering algorithm for the discovery of meaningful biological correlations between micrornas and their target genes. BMC Bioinform. 14(7), S8 (2013)","journal-title":"BMC Bioinform."},{"issue":"9","key":"5_CR15","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1471-2105-16-S9-S7","volume":"16","author":"G Pio","year":"2015","unstructured":"Pio, G., Ceci, M., Malerba, D., D\u2019Elia, D.: Comirnet: a web-based system for the analysis of mirna-gene regulatory networks. BMC Bioinform. 16(9), S7 (2015)","journal-title":"BMC Bioinform."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jbi.2015.06.028","volume":"57","author":"B Pontes","year":"2015","unstructured":"Pontes, B., Gir\u00e1ldez, R., Aguilar-Ruiz, J.S.: Biclustering on expression data: a review. J. Biomed. Inform. 57, 163\u2013180 (2015)","journal-title":"J. Biomed. Inform."},{"unstructured":"de Saint-Marcq, V.l.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: CP Workshop on Techniques foR Implementing Constraint programming Systems (TRICS), pp. 1\u201310 (2013)","key":"5_CR17"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S1571-0661(04)00313-5","volume":"61","author":"T Takaoka","year":"2002","unstructured":"Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Electron. Not. Theoret. Comput. Sci. 61, 191\u2013200 (2002)","journal-title":"Electron. Not. Theoret. Comput. Sci."},{"unstructured":"Tamaki, H., Tokuyama, T.: Algorithms for the maximum subarray problem based on matrix multiplication. In: SODA 1998, pp. 446\u2013452 (1998)","key":"5_CR19"},{"unstructured":"Yang, J., Wang, H., Wang, W., Yu, P.: Enhanced biclustering on expression data. In: Proceedings of the Third IEEE Symposium on Bioinformatics and Bioengineering, pp. 321\u2013327. IEEE (2003)","key":"5_CR20"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78680-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:05:48Z","timestamp":1709809548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78680-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319786797","9783319786803"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78680-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFMCP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on New Frontiers in Mining Complex Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Skopje","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macedonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfmcp2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.di.uniba.it\/~loglisci\/NFmcp17\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}