{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:21Z","timestamp":1725798861308},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319101590"},{"type":"electronic","value":"9783319101606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10160-6_31","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T23:14:54Z","timestamp":1408490094000},"page":"345-356","source":"Crossref","is-referenced-by-count":4,"title":["A Scalable Algorithm for Banded Pattern Mining in Multi-dimensional Zero-One Data"],"prefix":"10.1007","author":[{"given":"Fatimah B.","family":"Abdullahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frans","family":"Coenen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993 pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"31_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01188581","volume":"13","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F., Karp, R.M., Newberg, L.A., Weisser, D.K.: Physical mapping of chromosomes: A combinatorial problem in molecular biology. Algorithmica\u00a013, 52\u201376 (1995)","journal-title":"Algorithmica"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"J. Atkins","year":"1999","unstructured":"Atkins, J., Boman, E., Hendrickson, B.: Spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput.\u00a028, 297\u2013310 (1999)","journal-title":"SIAM J. Comput."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C. Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., Catalyurek, U.: Permuting sparse rectangular matrices into block-diagonal form. SIAM Journal on Scientific Computing\u00a025, 1860\u20131879 (2004)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"31_CR6","unstructured":"Baeza-Yates, R., RibeiroNeto., B.: Modern Information Retrieval. Addison-Wesley (1999)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Krumpelman, C., Ghosh, J., Basu, S., Mooney, R.: Model-based overlapping clustering. In: Proceedings of Knowledge Discovery and DataMining, pp. 532\u2013537 (2005)","DOI":"10.1145\/1081870.1081932"},{"key":"31_CR8","unstructured":"Blake, C.L, Merz, C.J.: Uci repository of machine learning databases (1998), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.htm"},{"key":"31_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44794-6_5","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"F.P. Coenen","year":"2001","unstructured":"Coenen, F.P., Goulbourne, G., Leng, P.: Computing association rules using partial totals. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, pp. 54\u201366. Springer, Heidelberg (2001)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Cuthill, A.E., McKee, J.: Reducing bandwidth of sparse symmentric matrices. In: Proceedings of the 1969 29th ACM National Conference, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Fortelius, M., Puolamaki, M.F.K., Mannila, H.: Seriation in paleontological data using markov chain monte method. PLoS Computational Biology, 2 (2006)","DOI":"10.1371\/journal.pcbi.0020006"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10115-010-0319-7","volume":"28","author":"G.C. Garriga","year":"2011","unstructured":"Garriga, G.C., Junttila, E., Mannila, H.: Banded structures in binary matrices. Knowledge Discovery and Information System\u00a028, 197\u2013226 (2011)","journal-title":"Knowledge Discovery and Information System"},{"key":"31_CR13","unstructured":"Junttila, E.: Pattern in Permuted Binary Matrices. Ph.D. thesis (2011)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U.A. Luxburg Von","year":"2007","unstructured":"Von Luxburg, U.A.: A tutorial on spectral clustering. Statistical Computation\u00a017, 395\u2013416 (2007)","journal-title":"Statistical Computation"},{"key":"31_CR15","unstructured":"Mueller, C.: Sparse matrix reordering algorithms for cluster identification. Machune Learning in Bioinformatics (2004)"},{"key":"31_CR16","first-page":"357","volume":"29","author":"E.. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, E., Siirtola, H.: The barycenter heuristic and the reorderable matrix. Informatica\u00a029, 357\u2013363 (2005)","journal-title":"Informatica"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Rosen, R.: Matrix bandwidth minimisation. In: ACM National conference Proceedings, pp. 585\u2013595 (1968)","DOI":"10.1145\/800186.810622"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10160-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:31:38Z","timestamp":1558960298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10160-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319101590","9783319101606"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10160-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}