{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:34:44Z","timestamp":1791149684262,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557103","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"757-766","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Mining discrete patterns via binary matrix factorization"],"prefix":"10.1145","author":[{"given":"Bao-Hong","family":"Shen","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuiwang","family":"Ji","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_3_2_2_2_1","volume-title":"Activity Analysis of Production and Allocation","author":"Dantzig G.","year":"1951","unstructured":"G. Dantzig . Maximization of a linear function of variables subject to linear inequalities . In Activity Analysis of Production and Allocation . Wiley , 1951 . G. Dantzig. Maximization of a linear function of variables subject to linear inequalities. In Activity Analysis of Production and Allocation. Wiley, 1951."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_2_4_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan . Matrix Computations . The Johns Hopkins University Press , Baltimore, MD, USA , 3 rd edition, 1996 . G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD, USA, 3rd edition, 1996.","edition":"3"},{"key":"e_1_3_2_2_5_1","first-page":"247","volume-title":"An extension of a theorem of Dantzig's. Ann. of Math. Stud., no. 38","author":"Heller I.","year":"1956","unstructured":"I. Heller and C. B. Tompkins . An extension of a theorem of Dantzig's. Ann. of Math. Stud., no. 38 , pages 247 -- 254 . 1956 . I. Heller and C. B. Tompkins. An extension of a theorem of Dantzig's. Ann. of Math. Stud., no. 38, pages 247--254. 1956."},{"issue":"4","key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1093\/forestscience\/43.4.544","article-title":"Forest harvesting and minimum cuts: a new approach to handling spatial constraints","volume":"43","author":"Hochbaum D. S.","year":"1997","unstructured":"D. S. Hochbaum and A. Pathria . Forest harvesting and minimum cuts: a new approach to handling spatial constraints . Forest Science , 43 ( 4 ): 544 -- 554 , 1997 . D. S. Hochbaum and A. Pathria. Forest harvesting and minimum cuts: a new approach to handling spatial constraints. Forest Science, 43(4):544--554, 1997.","journal-title":"Forest Science"},{"key":"e_1_3_2_2_7_1","first-page":"223","volume-title":"Integral boundary points of convex polyhedra. Annals of Mathematics Studies, no. 38","author":"Hoffman A. J.","year":"1956","unstructured":"A. J. Hoffman and J. B. Kruskal . Integral boundary points of convex polyhedra. Annals of Mathematics Studies, no. 38 , pages 223 -- 246 . Princeton University Press , 1956 . A. J. Hoffman and J. B. Kruskal. Integral boundary points of convex polyhedra. Annals of Mathematics Studies, no. 38, pages 223--246. Princeton University Press, 1956."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132524"},{"key":"e_1_3_2_2_10_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming {in russian}","volume":"244","author":"Khachiyan L. G.","year":"1979","unstructured":"L. G. Khachiyan . A polynomial algorithm in linear programming {in russian} . Doklady Akademii Nauk SSSR , 244 : 1093 -- 1096 , 1979 . English translation: Soviet Mathematics Doklady 20 (1979), 191--194. L. G. Khachiyan. A polynomial algorithm in linear programming {in russian}. Doklady Akademii Nauk SSSR, 244:1093--1096, 1979. English translation: Soviet Mathematics Doklady 20 (1979), 191--194.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"e_1_3_2_2_11_1","first-page":"159","volume-title":"III","author":"Klee V.","year":"1972","unstructured":"V. Klee and G. J. Minty . How good is the simplex algorithm? In Inequalities , III , pages 159 -- 175 . Academic Press , New York , 1972 . V. Klee and G. J. Minty. How good is the simplex algorithm? In Inequalities, III, pages 159--175. Academic Press, New York, 1972."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/291128.291131"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956770"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.55"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132976"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.787003"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","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"]},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:42Z","timestamp":1750253922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":18,"alternative-id":["10.1145\/1557019.1557103","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557103","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}