{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:52:16Z","timestamp":1755838336325,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465319","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Quality and efficiency for kernel density estimates in large data"],"prefix":"10.1145","author":[{"given":"Yan","family":"Zheng","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"given":"Jeffrey","family":"Jestes","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"given":"Jeff M.","family":"Phillips","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"given":"Feifei","family":"Li","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0906008"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1950-0051437-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240239"},{"key":"e_1_3_2_1_4_1","volume-title":"SODA","author":"Callahan P. B.","year":"1995","unstructured":"P. B. Callahan and S. R. Kosaraju . Algorithms for dynamic closest-pair and n-body potential fields . In SODA , 1995 . P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest-pair and n-body potential fields. In SODA, 1995."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method","author":"Chazelle B.","year":"2000","unstructured":"B. Chazelle . The Discrepancy Method . Cambridge , 2000 . B. Chazelle. The Discrepancy Method. Cambridge, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0060"},{"key":"e_1_3_2_1_7_1","volume-title":"Conference on Uncertainty in Artificial Intellegence","author":"Chen Y.","year":"2010","unstructured":"Y. Chen , M. Welling , and A. Smola . Super-samples from kernel hearding . In Conference on Uncertainty in Artificial Intellegence , 2010 . Y. Chen, M. Welling, and A. Smola. Super-samples from kernel hearding. In Conference on Uncertainty in Artificial Intellegence, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142389"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807099"},{"key":"e_1_3_2_1_10_1","volume-title":"Scaling algorithms for approximate and exact maximum weight matching. Technical report, arXiv:1112.0790","author":"Duan R.","year":"2011","unstructured":"R. Duan , S. Pettie , and H.-H. Su . Scaling algorithms for approximate and exact maximum weight matching. Technical report, arXiv:1112.0790 , 2011 . R. Duan, S. Pettie, and H.-H. Su. Scaling algorithms for approximate and exact maximum weight matching. Technical report, arXiv:1112.0790, 2011."},{"key":"e_1_3_2_1_11_1","volume-title":"trees, and flowers. Canadian Journal of Mathematics, 17:449--467","author":"Edmonds J.","year":"1965","unstructured":"J. Edmonds . Paths , trees, and flowers. Canadian Journal of Mathematics, 17:449--467 , 1965 . J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449--467, 1965."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655593"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0912004"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375670"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132873"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335448"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031416"},{"key":"e_1_3_2_1_19_1","volume-title":"ICDE","author":"Harinarayan V.","year":"1997","unstructured":"V. Harinarayan , A. Rajaraman , and J. D. Ullman . Implementing data cubes efficiently . In ICDE , 1997 . V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In ICDE, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253274"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989401"},{"key":"e_1_3_2_1_22_1","volume-title":"VLDB","author":"Jagadish H. V.","year":"1998","unstructured":"H. V. Jagadish , N. Koudas , S. Muthukrishnan , V. Poosala , K. Sevcik , and T. Suel . Optimal histograms with quality guarantees . In VLDB , 1998 . H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, 1998."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1996.10476701"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998204"},{"key":"e_1_3_2_1_25_1","volume-title":"A new implementation of a minimum cost perfect matching algorithm. Mathematical Programming, 1(1)","author":"Kolmogorov V.","year":"2009","unstructured":"V. Kolmogorov . BLOSSOM V : A new implementation of a minimum cost perfect matching algorithm. Mathematical Programming, 1(1) , 2009 . V. Kolmogorov. BLOSSOM V: A new implementation of a minimum cost perfect matching algorithm. Mathematical Programming, 1(1), 2009."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335223"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.73"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276342"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103470"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"Matousek J.","year":"1999","unstructured":"J. Matousek . Geometric Discrepancy . Springer , 1999 . J. Matousek. Geometric Discrepancy. Springer, 1999."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704472"},{"key":"e_1_3_2_1_32_1","first-page":"155","volume-title":"Proceedings of the Symposium on Time Series Analysis","author":"Parzen E.","year":"1963","unstructured":"E. Parzen . Probability density functionals and reproducing kernel Hilbert spaces . In Proceedings of the Symposium on Time Series Analysis , pages 155 -- 169 , 1963 . E. Parzen. Probability density functionals and reproducing kernel Hilbert spaces. In Proceedings of the Symposium on Time Series Analysis, pages 155--169, 1963."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.116"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233342"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.53"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1198\/jcgs.2010.09046"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728190"},{"key":"e_1_3_2_1_38_1","volume-title":"Regularization, Optimization, and Beyond","author":"Scholkopf B.","year":"2002","unstructured":"B. Scholkopf and A. J. Smola . Learning with Kernels: Support Vector Machines , Regularization, Optimization, and Beyond . MIT Press , 2002 . B. Scholkopf and A. J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, 2002."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316849"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/975545"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755873"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3324-9"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1269-4"},{"key":"e_1_3_2_1_44_1","unstructured":"B. A. Turlach. Bandwidth selection in kernel density estimation: A review. Discussion paper 9317 Istitut de Statistique UCL Louvain-la-Neuve Belgium.  B. A. Turlach. Bandwidth selection in kernel density estimation: A review. Discussion paper 9317 Istitut de Statistique UCL Louvain-la-Neuve Belgium."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796458"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/288627.288645"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_2_1_49_1","volume-title":"NIPS","author":"Yang C.","year":"2004","unstructured":"C. Yang , R. Duraiswami , and L. S. Davis . Efficient kernel machines using the improved fast gauss transform . In NIPS , 2004 . C. Yang, R. Duraiswami, and L. S. Davis. Efficient kernel machines using the improved fast gauss transform. In NIPS, 2004."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946593"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312266"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:06Z","timestamp":1750235946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":51,"alternative-id":["10.1145\/2463676.2465319","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465319","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}