{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:31Z","timestamp":1750307731289,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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.1557140","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"1115-1124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Pervasive parallelism in data mining"],"prefix":"10.1145","author":[{"given":"Srivatsava","family":"Daruru","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Nena M.","family":"Marin","sequence":"additional","affiliation":[{"name":"Pervasive Software, Inc., Austin, TX, USA"}]},{"given":"Matt","family":"Walker","sequence":"additional","affiliation":[{"name":"Pervasive Software, Inc., Austin, TX, USA"}]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Netflix inc. netflix data. http:\/\/www.netflixprize.com\/\/download Oct 2006.  Netflix inc. netflix data. http:\/\/www.netflixprize.com\/\/download Oct 2006."},{"key":"e_1_3_2_2_2_1","unstructured":"Pervasive software inc. pervasive data rush. http:\/\/www.pervasivedatarush.com\/downloads 2007.  Pervasive software inc. pervasive data rush. http:\/\/www.pervasivedatarush.com\/downloads 2007."},{"key":"e_1_3_2_2_3_1","unstructured":"Timely development. netflix prize. http:\/\/www.timelydevelopment.com\/demos\/NetflixPrize.aspx 2007.  Timely development. netflix prize. http:\/\/www.timelydevelopment.com\/demos\/NetflixPrize.aspx 2007."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281199"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1314498.1314563"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281206"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281222"},{"key":"e_1_3_2_2_8_1","first-page":"1265","article-title":"A divisive information-theoretic feature clustering algorithm for text classification","volume":"3","author":"Dhillon I.","year":"2003","unstructured":"I. Dhillon , S. Mallela , and R. Kumar . A divisive information-theoretic feature clustering algorithm for text classification . Journal of Machine Learning , 3 : 1265 -- 1287 , 2003 . I. Dhillon, S. Mallela, and R. Kumar. A divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning, 3:1265--1287, 2003.","journal-title":"Journal of Machine Learning"},{"key":"e_1_3_2_2_9_1","volume-title":"Pattern Classification","author":"Duda R.","year":"2001","unstructured":"R. Duda , P. Hart , and D. Stork . Pattern Classification . John Wiley and Sons, Inc , 2001 . R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley and Sons, Inc, 2001."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.14"},{"key":"e_1_3_2_2_11_1","volume-title":"Matrix Computations","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. V. Loan . Matrix Computations . John Hopkins University Press , Baltimore , 1996 . G. Golub and C. V. Loan. Matrix Computations. John Hopkins University Press, Baltimore, 1996."},{"key":"e_1_3_2_2_12_1","volume-title":"Introduction to Parallel Computing","author":"Grama A.","year":"2003","unstructured":"A. Grama , A. Gupta , G. Karypis , and V. Kumar . Introduction to Parallel Computing . Addison-Wesley , 2003 . A. Grama, A. Gupta, G. Karypis, and V. Kumar. Introduction to Parallel Computing. Addison-Wesley, 2003."},{"key":"e_1_3_2_2_13_1","volume-title":"Four Paths to Java Parallelism","author":"Irwin K.","year":"2008","unstructured":"K. Irwin and M. Walker . Four Paths to Java Parallelism ., volume 13 . Java Developer.s Journal , 2008 . K. Irwin and M. Walker. Four Paths to Java Parallelism., volume 13. Java Developer.s Journal, 2008."},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. of the IFIP Congress 74","author":"Kahn G.","year":"1974","unstructured":"G. Kahn . The semantics of a simple language for parallel programming . Proc. of the IFIP Congress 74 , North-Holland Publishing Co., Holland , 1974 . G. Kahn. The semantics of a simple language for parallel programming. Proc. of the IFIP Congress 74, North-Holland Publishing Co., Holland, 1974."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA439541"},{"key":"e_1_3_2_2_18_1","unstructured":"S.Funk. Netflix update: Try this at home. http:\/\/sifter.org\/ simon\/journal\/20061211.html 2006.  S.Funk. Netflix update: Try this at home. http:\/\/sifter.org\/ simon\/journal\/20061211.html 2006."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"}],"event":{"name":"KDD09: The 15th 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":"Paris France","acronym":"KDD09"},"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.1557140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557140","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.1557140"}},"subtitle":["dataflow solution to co-clustering large and sparse Netflix data"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":19,"alternative-id":["10.1145\/1557019.1557140","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557140","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"}}]}}