{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:48:16Z","timestamp":1769914096351,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"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":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098196","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"2021-2030","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Application Identification from Billions of Files"],"prefix":"10.1145","author":[{"given":"Kyle","family":"Soska","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Gates","sequence":"additional","affiliation":[{"name":"Symantec, Culver City, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin A.","family":"Roundy","sequence":"additional","affiliation":[{"name":"Symantec, Culver City, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Christin","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315460"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Noga Alon Yossi Matias and Mario Szegedy 1996. The space complexity of approximating the frequency moments Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM 20--29.  Noga Alon Yossi Matias and Mario Szegedy 1996. The space complexity of approximating the frequency moments Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM 20--29.","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_3_1","volume-title":"An optimal algorithm for l1-heavy hitters in insertion streams and related problems Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, 385--400","author":"Bhattacharyya Arnab","unstructured":"Arnab Bhattacharyya , Palash Dey , and David P Woodruff . 2016. An optimal algorithm for l1-heavy hitters in insertion streams and related problems Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, 385--400 . Arnab Bhattacharyya, Palash Dey, and David P Woodruff. 2016. An optimal algorithm for l1-heavy hitters in insertion streams and related problems Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, 385--400."},{"key":"e_1_3_2_1_4_1","volume-title":"Engineering efficient and effective non-metric space library International Conference on Similarity Search and Applications","author":"Boytsov Leonid","unstructured":"Leonid Boytsov and Bilegsaikhan Naidan 2013. Engineering efficient and effective non-metric space library International Conference on Similarity Search and Applications . Springer , 280--293. Leonid Boytsov and Bilegsaikhan Naidan 2013. Engineering efficient and effective non-metric space library International Conference on Similarity Search and Applications. Springer, 280--293."},{"key":"e_1_3_2_1_5_1","volume-title":"BPTree: an heavy hitters algorithm using constant memory. arXiv preprint arXiv:1603.00759","author":"Braverman Vladimir","year":"2016","unstructured":"Vladimir Braverman , Stephen R Chestnut , Nikita Ivkin , Jelani Nelson , David P Woodruff , and Zhengyu Wang 2016. BPTree: an heavy hitters algorithm using constant memory. arXiv preprint arXiv:1603.00759 ( 2016 ). Vladimir Braverman, Stephen R Chestnut, Nikita Ivkin, Jelani Nelson, David P Woodruff, and Zhengyu Wang 2016. BPTree: an heavy hitters algorithm using constant memory. arXiv preprint arXiv:1603.00759 (2016)."},{"key":"e_1_3_2_1_6_1","volume-title":"Beating CountSketch for heavy hitters in insertion streams. arXiv preprint arXiv:1511.00661","author":"Braverman Vladimir","year":"2015","unstructured":"Vladimir Braverman , Stephen R Chestnut , Nikita Ivkin , and David P Woodruff 2015. Beating CountSketch for heavy hitters in insertion streams. arXiv preprint arXiv:1511.00661 ( 2015 ). Vladimir Braverman, Stephen R Chestnut, Nikita Ivkin, and David P Woodruff 2015. Beating CountSketch for heavy hitters in insertion streams. arXiv preprint arXiv:1511.00661 (2015)."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of Compression and Complexity of Sequences. 21--29","author":"Broder Andrei Z.","year":"1997","unstructured":"Andrei Z. Broder . 1997 . On the resemblance and containment of documents . Proceedings of Compression and Complexity of Sequences. 21--29 . Andrei Z. Broder. 1997. On the resemblance and containment of documents. Proceedings of Compression and Complexity of Sequences. 21--29."},{"key":"e_1_3_2_1_8_1","volume-title":"Density-Based Clustering over an Evolving Data Stream with Noise. SDM","author":"Cao Feng","unstructured":"Feng Cao , Martin Ester , Weining Qian , and Aoying Zhou . 2006. Density-Based Clustering over an Evolving Data Stream with Noise. SDM , Vol. Vol. 6 . SIAM , 328--339. Feng Cao, Martin Ester, Weining Qian, and Aoying Zhou. 2006. Density-Based Clustering over an Evolving Data Stream with Noise. SDM, Vol. Vol. 6. SIAM, 328--339."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_3_2_1_10_1","volume-title":"Polonium: Tera-scale graph mining and inference for malware detection Proceedings of the 2011 SIAM International Conference on Data Mining","author":"Chau Duen Horng","year":"2011","unstructured":"Duen Horng Chau , Carey Nachenberg , Jeffrey Wilhelm , Adam Wright , and Christos Faloutsos . 2011 . Polonium: Tera-scale graph mining and inference for malware detection Proceedings of the 2011 SIAM International Conference on Data Mining . SIAM , 131--142. Duen Horng Chau, Carey Nachenberg, Jeffrey Wilhelm, Adam Wright, and Christos Faloutsos. 2011. Polonium: Tera-scale graph mining and inference for malware detection Proceedings of the 2011 SIAM International Conference on Data Mining. SIAM, 131--142."},{"key":"e_1_3_2_1_11_1","volume-title":"Analyzing File-to-File Relation Network in Malware Detection International Conference on Web Information Systems Engineering (WISE).","author":"Chen Lingwei","year":"2015","unstructured":"Lingwei Chen , William Hardy , Yanfang Ye , and Tao Li . 2015 . Analyzing File-to-File Relation Network in Malware Detection International Conference on Web Information Systems Engineering (WISE). Lingwei Chen, William Hardy, Yanfang Ye, and Tao Li. 2015. Analyzing File-to-File Relation Network in Malware Detection International Conference on Web Information Systems Engineering (WISE)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_14_1","volume-title":"Efficient k-nearest neighbor graph construction for generic similarity measures Proceedings of the 20th international conference on World wide web. ACM, 577--586","author":"Dong Wei","unstructured":"Wei Dong , Charikar Moses , and Kai Li 2011. Efficient k-nearest neighbor graph construction for generic similarity measures Proceedings of the 20th international conference on World wide web. ACM, 577--586 . Wei Dong, Charikar Moses, and Kai Li 2011. Efficient k-nearest neighbor graph construction for generic similarity measures Proceedings of the 20th international conference on World wide web. ACM, 577--586."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the ASPLOS Exascale Evaluation and Research Techniques Workshop.","author":"Dumitras Tudor","year":"2011","unstructured":"Tudor Dumitras . 2011 . Field Data Available at Symantec Research Labs: The Worldwide Intelligence Network Environment (WINE) . In Proceedings of the ASPLOS Exascale Evaluation and Research Techniques Workshop. Tudor Dumitras. 2011. Field Data Available at Symantec Research Labs: The Worldwide Intelligence Network Environment (WINE). In Proceedings of the ASPLOS Exascale Evaluation and Research Techniques Workshop."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining (KDD)","volume":"96","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , Xiaowei Xu , and others 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise . Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining (KDD) , Vol. Vol. 96 . 226--231. Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, Xiaowei Xu, and others 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), Vol. Vol. 96. 226--231."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani 1998. Approximate nearest neighbors: towards removing the curse of dimensionality Proceedings of the thirtieth annual ACM symposium on Theory of computing. ACM 604--613.  Piotr Indyk and Rajeev Motwani 1998. Approximate nearest neighbors: towards removing the curse of dimensionality Proceedings of the thirtieth annual ACM symposium on Theory of computing. ACM 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798347177"},{"key":"e_1_3_2_1_19_1","volume-title":"WACV'07","author":"Liu Ting","year":"2007","unstructured":"Ting Liu , Charles Rosenberg , and Henry A Rowley . 2007 . Clustering billions of images with large scale nearest neighbor search Applications of Computer Vision, 2007 . WACV'07 . IEEE Workshop on. IEEE, 28--28. Ting Liu, Charles Rosenberg, and Henry A Rowley. 2007. Clustering billions of images with large scale nearest neighbor search Applications of Computer Vision, 2007. WACV'07. IEEE Workshop on. IEEE, 28--28."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_3_2_1_21_1","volume-title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv preprint arXiv:1603.09320","author":"Malkov Yu A","year":"2016","unstructured":"Yu A Malkov and DA Yashunin 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv preprint arXiv:1603.09320 ( 2016 ). Yu A Malkov and DA Yashunin 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv preprint arXiv:1603.09320 (2016)."},{"key":"e_1_3_2_1_22_1","volume-title":"Efficient computation of frequent and top-k elements in data streams International Conference on Database Theory","author":"Metwally Ahmed","unstructured":"Ahmed Metwally , Divyakant Agrawal , and Amr El Abbadi . 2005. Efficient computation of frequent and top-k elements in data streams International Conference on Database Theory . Springer , 398--412. Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams International Conference on Database Theory. Springer, 398--412."},{"key":"e_1_3_2_1_23_1","volume-title":"Automatically detecting vulnerable websites before they turn malicious Proceedings of the 23rd USENIX Security Symposium (USENIX Security'14)","author":"Soska Kyle","unstructured":"Kyle Soska and Nicolas Christin 2014. Automatically detecting vulnerable websites before they turn malicious Proceedings of the 23rd USENIX Security Symposium (USENIX Security'14) . San Diego, CA , 625--640. Kyle Soska and Nicolas Christin 2014. Automatically detecting vulnerable websites before they turn malicious Proceedings of the 23rd USENIX Security Symposium (USENIX Security'14). San Diego, CA, 625--640."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623342"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2005.10.001"},{"key":"e_1_3_2_1_26_1","volume-title":"Satisfying general proximity\/similarity queries with metric trees. Information processing letters","author":"Uhlmann Jeffrey K","year":"1991","unstructured":"Jeffrey K Uhlmann . 1991. Satisfying general proximity\/similarity queries with metric trees. Information processing letters Vol. 40 , 4 ( 1991 ), 175--179. Jeffrey K Uhlmann. 1991. Satisfying general proximity\/similarity queries with metric trees. Information processing letters Vol. 40, 4 (1991), 175--179."},{"key":"e_1_3_2_1_27_1","volume-title":"New Algorithms for Heavy Hitters in Data Streams. arXiv preprint arXiv:1603.01733","author":"Woodruff David P","year":"2016","unstructured":"David P Woodruff . 2016. New Algorithms for Heavy Hitters in Data Streams. arXiv preprint arXiv:1603.01733 ( 2016 ). David P Woodruff. 2016. New Algorithms for Heavy Hitters in Data Streams. arXiv preprint arXiv:1603.01733 (2016)."},{"key":"e_1_3_2_1_28_1","volume-title":"Umesh Gupta Egemen Tas, and Melih Abdulhayoglu","author":"Ye Yanfang","year":"2011","unstructured":"Yanfang Ye , Tao Li , Shenghuo Zhu , Weiwei Zhuang , Umesh Gupta Egemen Tas, and Melih Abdulhayoglu 2011 . Combining file content and file relations for cloud based malware detection Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining (KDD) . Yanfang Ye, Tao Li, Shenghuo Zhu, Weiwei Zhuang, Umesh Gupta Egemen Tas, and Melih Abdulhayoglu 2011. Combining file content and file relations for cloud based malware detection Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining (KDD)."},{"key":"e_1_3_2_1_29_1","volume-title":"Data structures and algorithms for nearest neighbor search in general metric spaces SODA","author":"Yianilos Peter N","unstructured":"Peter N Yianilos . 1993. Data structures and algorithms for nearest neighbor search in general metric spaces SODA , Vol. Vol. 93 . 311--21. Peter N Yianilos. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces SODA, Vol. Vol. 93. 311--21."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:03Z","timestamp":1750217403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":29,"alternative-id":["10.1145\/3097983.3098196","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098196","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}