{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:30:50Z","timestamp":1783791050756,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-17-2-0095 (D3M)"],"award-info":[{"award-number":["FA8750-17-2-0095 (D3M)"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-17-1-2562"],"award-info":[{"award-number":["N00014-17-1-2562"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1704417"],"award-info":[{"award-number":["CCF-1704417"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196930","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"757-772","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Sketching Linear Classifiers over Data Streams"],"prefix":"10.1145","author":[{"given":"Kai Sheng","family":"Tai","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vatsal","family":"Sharan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Bailis","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory","family":"Valiant","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"e_1_3_2_1_2_1","unstructured":"Jimmy Ba and Rich Caruana. 2014. Do deep nets really need to be deep?. In Advances in neural information processing systems. 2654--2662.   Jimmy Ba and Rich Caruana. 2014. Do deep nets really need to be deep?. In Advances in neural information processing systems. 2654--2662."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035928"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247510"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307439"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733016"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2187306"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150464"},{"key":"e_1_3_2_1_9_1","unstructured":"Robert Calderbank Sina Jafarpour and Robert Schapire . {n. d.}. Compressed Learning: Universal Sparse Dimensionality Reduction and Learning in the Measurement Domain. (.{n. d.}).  Robert Calderbank Sina Jafarpour and Robert Schapire . {n. d.}. Compressed Learning: Universal Sparse Dimensionality Reduction and Learning in the Measurement Domain. (.{n. d.})."},{"key":"e_1_3_2_1_10_1","volume-title":"Finding frequent items in data streams. Automata, languages and programming","author":"Charikar Moses","year":"2002","unstructured":"Moses Charikar , Kevin Chen , and Martin Farach-Colton . 2002. Finding frequent items in data streams. Automata, languages and programming ( 2002 ), 784--784. Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. Automata, languages and programming (2002), 784--784."},{"key":"e_1_3_2_1_11_1","volume-title":"One billion word benchmark for measuring progress in statistical language modeling. arXiv preprint arXiv:1312.3005","author":"Chelba Ciprian","year":"2013","unstructured":"Ciprian Chelba , Tomas Mikolov , Mike Schuster , Qi Ge , Thorsten Brants , Phillipp Koehn , and Tony Robinson . 2013. One billion word benchmark for measuring progress in statistical language modeling. arXiv preprint arXiv:1312.3005 ( 2013 ). Ciprian Chelba, Tomas Mikolov, Mike Schuster, Qi Ge, Thorsten Brants, Phillipp Koehn, and Tony Robinson. 2013. One billion word benchmark for measuring progress in statistical language modeling. arXiv preprint arXiv:1312.3005 (2013)."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings. 20th International Conference on. IEEE, 449--460","author":"Considine Jeffrey","year":"2004","unstructured":"Jeffrey Considine , Feifei Li , George Kollios , and John Byers . 2004 . Approximate aggregation techniques for sensor databases Data Engineering, 2004 . Proceedings. 20th International Conference on. IEEE, 449--460 . Jeffrey Considine, Feifei Li, George Kollios, and John Byers. 2004. Approximate aggregation techniques for sensor databases Data Engineering, 2004. Proceedings. 20th International Conference on. IEEE, 449--460."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098095"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.860096"},{"key":"e_1_3_2_1_17_1","unstructured":"Koby Crammer Jaz Kandola and Yoram Singer. 2004. Online classification on a budget. In Advances in neural information processing systems. 225--232.   Koby Crammer Jaz Kandola and Yoram Singer. 2004. Online classification on a budget. In Advances in neural information processing systems. 225--232."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2012.6135854"},{"key":"e_1_3_2_1_19_1","volume-title":"The Forgetron: A kernel-based perceptron on a fixed budget Advances in neural information processing systems. 259--266.","author":"Dekel Ofer","year":"2006","unstructured":"Ofer Dekel , Shai Shalev-Shwartz , and Yoram Singer . 2006 . The Forgetron: A kernel-based perceptron on a fixed budget Advances in neural information processing systems. 259--266. Ofer Dekel, Shai Shalev-Shwartz, and Yoram Singer. 2006. The Forgetron: A kernel-based perceptron on a fixed budget Advances in neural information processing systems. 259--266."},{"key":"e_1_3_2_1_20_1","volume-title":"Frequency estimation of internet packet streams with limited space European Symposium on Algorithms","author":"Demaine Erik D","unstructured":"Erik D Demaine , Alejandro L\u00f3pez-Ortiz , and J Ian Munro . 2002. Frequency estimation of internet packet streams with limited space European Symposium on Algorithms . Springer , 348--360. Erik D Demaine, Alejandro L\u00f3pez-Ortiz, and J Ian Munro. 2002. Frequency estimation of internet packet streams with limited space European Symposium on Algorithms. Springer, 348--360."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755882"},{"key":"e_1_3_2_1_22_1","unstructured":"Benjamin V Durme and Ashwin Lall. 2009. Streaming pointwise mutual information. In Advances in Neural Information Processing Systems. 1892--1900.   Benjamin V Durme and Ashwin Lall. 2009. Streaming pointwise mutual information. In Advances in Neural Information Processing Systems. 1892--1900."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.11.003"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934993"},{"key":"e_1_3_2_1_25_1","volume-title":"Large-scale learning with less ram via randomization Proceedings of the 30th International Conference on Machine Learning (ICML-13). 325--333","author":"Golovin Daniel","unstructured":"Daniel Golovin , D Sculley , Brendan McMahan , and Michael Young . 2013. Large-scale learning with less ram via randomization Proceedings of the 30th International Conference on Machine Learning (ICML-13). 325--333 . Daniel Golovin, D Sculley, Brendan McMahan, and Michael Young. 2013. Large-scale learning with less ram via randomization Proceedings of the 30th International Conference on Machine Learning (ICML-13). 325--333."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_3_2_1_27_1","volume-title":"Ankit Goyal, Harsha Vardhan Simhadri, Bhargavi Paranjape, Ashish Kumar, Saurabh Goyal, Raghavendra Udupa, Manik Varma, and Prateek Jain.","author":"Gupta Chirag","year":"2017","unstructured":"Chirag Gupta , Arun Sai Suggala , Ankit Goyal, Harsha Vardhan Simhadri, Bhargavi Paranjape, Ashish Kumar, Saurabh Goyal, Raghavendra Udupa, Manik Varma, and Prateek Jain. 2017 . ProtoNN: Compressed and Accurate kNN for Resource-scarce Devices International Conference on Machine Learning . 1331--1340. Chirag Gupta, Arun Sai Suggala, Ankit Goyal, Harsha Vardhan Simhadri, Bhargavi Paranjape, Ashish Kumar, Saurabh Goyal, Raghavendra Udupa, Manik Varma, and Prateek Jain. 2017. ProtoNN: Compressed and Accurate kNN for Resource-scarce Devices International Conference on Machine Learning. 1331--1340."},{"key":"e_1_3_2_1_28_1","volume-title":"Gutmann and Aapo Hyv\u00e4models Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. 297--304","author":"Michael","unstructured":"Michael Gutmann and Aapo Hyv\u00e4models Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. 297--304 . Michael Gutmann and Aapo Hyv\u00e4models Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. 297--304."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_1_31_1","volume-title":"Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531","author":"Hinton Geoffrey","year":"2015","unstructured":"Geoffrey Hinton , Oriol Vinyals , and Jeff Dean . 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 ( 2015 ). Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351316.2351329"},{"key":"e_1_3_2_1_33_1","volume-title":"Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics","author":"Johnson William B","year":"1984","unstructured":"William B Johnson and Joram Lindenstrauss . 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics Vol. 26 , 189--206 ( 1984 ), 1. William B Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics Vol. 26, 189--206 (1984), 1."},{"key":"e_1_3_2_1_34_1","volume-title":"Incremental skip-gram model with negative sampling. arXiv preprint arXiv:1704.03956","author":"Kaji Nobuhiro","year":"2017","unstructured":"Nobuhiro Kaji and Hayato Kobayashi . 2017. Incremental skip-gram model with negative sampling. arXiv preprint arXiv:1704.03956 ( 2017 ). Nobuhiro Kaji and Hayato Kobayashi. 2017. Incremental skip-gram model with negative sampling. arXiv preprint arXiv:1704.03956 (2017)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559902"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2354893"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_3_2_1_38_1","volume-title":"Federated optimization: Distributed optimization beyond the datacenter. arXiv preprint arXiv:1511.03575","author":"Konevcn\u1ef3 Jakub","year":"2015","unstructured":"Jakub Konevcn\u1ef3 , Brendan McMahan , and Daniel Ramage . 2015. Federated optimization: Distributed optimization beyond the datacenter. arXiv preprint arXiv:1511.03575 ( 2015 ). Jakub Konevcn\u1ef3, Brendan McMahan, and Daniel Ramage. 2015. Federated optimization: Distributed optimization beyond the datacenter. arXiv preprint arXiv:1511.03575 (2015)."},{"key":"e_1_3_2_1_39_1","unstructured":"Ashish Kumar Saurabh Goyal and Manik Varma. 2017. Resource-efficient Machine Learning in 2 KB RAM for the Internet of Things International Conference on Machine Learning. 1935--1944.  Ashish Kumar Saurabh Goyal and Manik Varma. 2017. Resource-efficient Machine Learning in 2 KB RAM for the Internet of Things International Conference on Machine Learning. 1935--1944."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577097"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.16"},{"key":"e_1_3_2_1_42_1","unstructured":"Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization Advances in neural information processing systems. 2177--2185.   Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization Advances in neural information processing systems. 2177--2185."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.PERVASIVEHEALTH2010.8851"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0424-7"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553462"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287400"},{"key":"e_1_3_2_1_48_1","volume-title":"Benjamin Van Durme, and Ashwin Lall","author":"May Chandler","year":"2017","unstructured":"Chandler May , Kevin Duh , Benjamin Van Durme, and Ashwin Lall . 2017 . Streaming Word Embeddings with the Space-Saving Algorithm . arXiv preprint arXiv:1704.07463 (2017). Chandler May, Kevin Duh, Benjamin Van Durme, and Ashwin Lall. 2017. Streaming Word Embeddings with the Space-Saving Algorithm. arXiv preprint arXiv:1704.07463 (2017)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472820"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488200"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733070"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_1_53_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0382-5"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939778"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028814"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"e_1_3_2_1_59_1","volume-title":"Without-Replacement Sampling for Stochastic Gradient Methods. Advances in Neural Information Processing Systems 29, bibfieldeditor","author":"Shamir Ohad","unstructured":"Ohad Shamir . 2016. Without-Replacement Sampling for Stochastic Gradient Methods. Advances in Neural Information Processing Systems 29, bibfieldeditor D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (Eds.). Curran Associates, Inc ., 46--54. http:\/\/papers.nips.cc\/paper\/6245-without-replacement-sampling-for-stochastic-gradient-methods.pdf Ohad Shamir. 2016. Without-Replacement Sampling for Stochastic Gradient Methods. Advances in Neural Information Processing Systems 29, bibfieldeditorD. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (Eds.). Curran Associates, Inc., 46--54. http:\/\/papers.nips.cc\/paper\/6245-without-replacement-sampling-for-stochastic-gradient-methods.pdf"},{"key":"e_1_3_2_1_60_1","unstructured":"Qinfeng Shi James Petterson Gideon Dror John Langford Alexander L Strehl Alex J Smola and SVN Vishwanathan. 2009. Hash kernels International Conference on Artificial Intelligence and Statistics. 496--503.  Qinfeng Shi James Petterson Gideon Dror John Langford Alexander L Strehl Alex J Smola and SVN Vishwanathan. 2009. Hash kernels International Conference on Artificial Intelligence and Statistics. 496--503."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031524"},{"key":"e_1_3_2_1_62_1","unstructured":"Virginia Smith Chao-Kai Chiang Maziar Sanjabi and Ameet S Talwalkar. 2017. Federated Multi-Task Learning. In Advances in Neural Information Processing Systems. 4427--4437.  Virginia Smith Chao-Kai Chiang Maziar Sanjabi and Ameet S Talwalkar. 2017. Federated Multi-Task Learning. In Advances in Neural Information Processing Systems. 4427--4437."},{"key":"e_1_3_2_1_63_1","volume-title":"Algebra I 2008--2009","author":"Stamper J.","year":"2010","unstructured":"J. Stamper , A. Niculescu-Mizil , S. Ritter , G.J. Gordon , and K.R. Koedinger . 2010 . Algebra I 2008--2009 . Challenge data set from KDD Cup 2010 Educational Data Mining Challenge. (2010). Find it at http:\/\/pslcdatashop.web.cmu.edu\/KDDCup\/downloads.jsp. J. Stamper, A. Niculescu-Mizil, S. Ritter, G.J. Gordon, and K.R. Koedinger. 2010. Algebra I 2008--2009. Challenge data set from KDD Cup 2010 Educational Data Mining Challenge. (2010). Find it at http:\/\/pslcdatashop.web.cmu.edu\/KDDCup\/downloads.jsp."},{"key":"e_1_3_2_1_64_1","unstructured":"Jacob Steinhardt and John Duchi. 2015. Minimax rates for memory-bounded sparse linear regression Conference on Learning Theory. 1564--1587.  Jacob Steinhardt and John Duchi. 2015. Minimax rates for memory-bounded sparse linear regression Conference on Learning Theory. 1564--1587."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/1861751.1861756"},{"key":"e_1_3_2_1_66_1","unstructured":"CAIDA UCSD. 2008. The CAIDA UCSD Anonymized Passive OC48 Internet Traces Dataset. (2008). http:\/\/www.caida.org\/data\/passive\/passive_oc48_dataset.xml  CAIDA UCSD. 2008. The CAIDA UCSD Anonymized Passive OC48 Internet Traces Dataset. (2008). http:\/\/www.caida.org\/data\/passive\/passive_oc48_dataset.xml"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851208"},{"key":"e_1_3_2_1_68_1","volume-title":"New streaming algorithms for fast detection of superspreaders. Department of Electrical and Computing Engineering","author":"Venkataraman Shoba","year":"2005","unstructured":"Shoba Venkataraman , Dawn Song , Phillip B Gibbons , and Avrim Blum . 2005. New streaming algorithms for fast detection of superspreaders. Department of Electrical and Computing Engineering ( 2005 ), 6. Shoba Venkataraman, Dawn Song, Phillip B Gibbons, and Avrim Blum. 2005. New streaming algorithms for fast detection of superspreaders. Department of Electrical and Computing Engineering (2005), 6."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953017"},{"key":"e_1_3_2_1_72_1","unstructured":"Tianbao Yang Lijun Zhang Rong Jin and Shenghuo Zhu. 2015. Theory of dual-sparse regularized randomized reduction International Conference on Machine Learning. 305--314.   Tianbao Yang Lijun Zhang Rong Jin and Shenghuo Zhu. 2015. Theory of dual-sparse regularized randomized reduction International Conference on Machine Learning. 305--314."},{"key":"e_1_3_2_1_73_1","first-page":"2010","volume-title":"et almbox","author":"Yu Hsiang-Fu","year":"2010","unstructured":"Hsiang-Fu Yu , Hung-Yi Lo , Hsun-Ping Hsieh , Jing-Kai Lou , Todd G McKenzie , Jung-Wei Chou , Po-Han Chung , Chia-Hua Ho , Chun-Fu Chang , Yin-Hsuan Wei , et almbox .. 2010 . Feature engineering and classifier ensemble for KDD cup 2010 KDD Cup . Hsiang-Fu Yu, Hung-Yi Lo, Hsun-Ping Hsieh, Jing-Kai Lou, Todd G McKenzie, Jung-Wei Chou, Po-Han Chung, Chia-Hua Ho, Chun-Fu Chang, Yin-Hsuan Wei, et almbox.. 2010. Feature engineering and classifier ensemble for KDD cup 2010 KDD Cup."},{"key":"e_1_3_2_1_74_1","volume-title":"NSDI","volume":"13","author":"Yu Minlan","year":"2013","unstructured":"Minlan Yu , Lavanya Jose , and Rui Miao . 2013 . Software Defined Traffic Measurement with OpenSketch . NSDI , Vol. Vol. 13 . 29--42. Minlan Yu, Lavanya Jose, and Rui Miao. 2013. Software Defined Traffic Measurement with OpenSketch. NSDI, Vol. Vol. 13. 29--42."},{"key":"e_1_3_2_1_75_1","unstructured":"Tong Yu Yong Zhuang Ole J Mengshoel and Osman Yagan. 2016. Hybridizing personal and impersonal machine learning models for activity recognition on mobile devices.  Tong Yu Yong Zhuang Ole J Mengshoel and Osman Yagan. 2016. Hybridizing personal and impersonal machine learning models for activity recognition on mobile devices."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2877204"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359204"},{"key":"e_1_3_2_1_78_1","volume-title":"Online convex programming and generalized infinitesimal gradient ascent Proceedings of the 20th International Conference on Machine Learning (ICML-03). 928--936","author":"Zinkevich Martin","unstructured":"Martin Zinkevich . 2003. Online convex programming and generalized infinitesimal gradient ascent Proceedings of the 20th International Conference on Machine Learning (ICML-03). 928--936 . Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent Proceedings of the 20th International Conference on Machine Learning (ICML-03). 928--936."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196930","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":79,"alternative-id":["10.1145\/3183713.3196930","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196930","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}