{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:47Z","timestamp":1750307807775,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401935","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"345-353","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Interpretable nonnegative matrix decompositions"],"prefix":"10.1145","author":[{"given":"Saara","family":"Hyv\u00f6nen","sequence":"first","affiliation":[{"name":"Fonecta Ltd., Helsinki, Finland"}]},{"given":"Pauli","family":"Miettinen","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Evimaria","family":"Terzi","sequence":"additional","affiliation":[{"name":"IBM Almaden, San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2006.11.006"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067967.1067972"},{"key":"e_1_3_2_1_3_1","volume-title":"Finding maximum","author":"Civril A.","year":"2007","unstructured":"A. \u00b8 Civril and M. Magdon-Ismail . Finding maximum volume sub-matrices of a matrix. Technical Report 07- 08 , Department of Computer Science, Rensselaer Polytechnic Institute , 2007 . A. \u00b8 Civril and M. Magdon-Ismail. Finding maximum volume sub-matrices of a matrix. Technical Report 07-08, Department of Computer Science, Rensselaer Polytechnic Institute, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_30"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_29"},{"key":"e_1_3_2_1_7_1","volume-title":"Aug.","author":"Drineas P.","year":"2007","unstructured":"P. Drineas , M. W. Mahoney , and S. Muthukrishnan . Relative-error CUR matrix decompositions , Aug. 2007 . arXiv:0708.3696v1 {cs.DS}. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Relative-error CUR matrix decompositions, Aug. 2007. arXiv:0708.3696v1 {cs.DS}."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/09296179708590082"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1076\/jqul.7.3.227.4109"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"e_1_3_2_1_11_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan . Matrix Computations . JHU Press , 1996 . G. H. Golub and C. F. Van Loan. Matrix Computations. JHU Press, 1996."},{"issue":"5","key":"e_1_3_2_1_12_1","first-page":"1108","article-title":"Polynomial solvability of convex quadratic programming","volume":"20","author":"Kozlov M. K.","year":"1979","unstructured":"M. K. Kozlov , S. P. Tarasov , and L. G. Ha\u010dijan . Polynomial solvability of convex quadratic programming . Soviet Math. Dokl. , 20 ( 5 ): 1108 -- 1111 , 1979 . M. K. Kozlov, S. P. Tarasov, and L. G. Ha\u010dijan. Polynomial solvability of convex quadratic programming. Soviet Math. Dokl., 20(5):1108--1111, 1979.","journal-title":"Soviet Math. Dokl."},{"key":"e_1_3_2_1_13_1","volume-title":"Combinatorial Optimization Algorithms and Complexity","author":"Papadimitriou C.","year":"1998","unstructured":"C. Papadimitriou and K. Steiglitz . Combinatorial Optimization Algorithms and Complexity . Dover Publications , 1998 . C. Papadimitriou and K. Steiglitz. Combinatorial Optimization Algorithms and Complexity. Dover Publications, 1998."}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Las Vegas Nevada USA","acronym":"KDD08"},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:40Z","timestamp":1750255000000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":13,"alternative-id":["10.1145\/1401890.1401935","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401935","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}