乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:19:50Z","timestamp":1725614390500},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,20]]},"DOI":"10.1145\/2213836.2213974","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"865-865","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["SigSpot"],"prefix":"10.1145","author":[{"given":"Misael","family":"Mongiov\u00ec","sequence":"first","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, USA"}]},{"given":"Petko","family":"Bogdanov","sequence":"additional","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, USA"}]},{"given":"Razvan","family":"Ranca","sequence":"additional","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, USA"}]},{"given":"Ambuj K.","family":"Singh","sequence":"additional","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, USA"}]},{"given":"Evangelos E.","family":"Papalexakis","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.145"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00338-9"},{"key":"e_1_3_2_1_3_1","volume-title":"Army Sc. Conf.","author":"Akoglu L.","year":"2010","unstructured":"L. Akoglu and C. Faloutsos . Event detection in time series of mobile communication graphs . In Army Sc. Conf. , 2010 . L. Akoglu and C. Faloutsos. Event detection in time series of mobile communication graphs. In Army Sc. Conf., 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2011.6102321"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISI.2011.5984061"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063749"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-005-5377-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.35"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1558607.1558658"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88735-7_4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9384-1"},{"key":"e_1_3_2_1_14_1","volume-title":"April-May","author":"Henderson K.","year":"2010","unstructured":"K. Henderson , T. Eliassi-Rad , S. Papadimitriou , and C. Faloutsos . HCDF: A hybrid community discovery algorithm. SIAM (SDM'2010) , April-May 2010 . K. Henderson, T. Eliassi-Rad, S. Papadimitriou, and C. Faloutsos. HCDF: A hybrid community discovery algorithm. SIAM (SDM'2010), April-May 2010."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of SODA","author":"Johnson D. S.","year":"2000","unstructured":"D. S. Johnson , M. Minkoff , and S. Phillips . The Prize Collecting Steiner Tree Problem : Theory and Practice . Proc. of SODA , 2000 . D. S. Johnson, M. Minkoff, and S. Phillips. The Prize Collecting Steiner Tree Problem : Theory and Practice. Proc. of SODA, 2000."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2069216.2069227"},{"key":"e_1_3_2_1_17_1","volume-title":"ICDM","author":"Lin S.-d.","year":"2003","unstructured":"S.-d. Lin and H. Chalupsky . Unsupervised link discovery in multi-relational data via rarity analysis . In ICDM , 2003 . S.-d. Lin and H. Chalupsky. Unsupervised link discovery in multi-relational data via rarity analysis. In ICDM, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767947"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5144-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014082"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081897"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956831"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.87"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-005-5378-z"},{"key":"e_1_3_2_1_26_1","volume-title":"ISMB","author":"Ruzzo W. L.","year":"1999","unstructured":"W. L. Ruzzo and M. Tompa . A linear time algorithm for finding all maximal scoring subsequences . In ISMB , 1999 . W. L. Ruzzo and M. Tompa. A linear time algorithm for finding all maximal scoring subsequences. In ISMB, 1999."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117461"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529618"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04747-3_37"},{"key":"e_1_3_2_1_30_1","volume-title":"Botnet detection by monitoring similar communication patterns. CoRR, abs\/1004.1232","author":"Zeidanloo H. R.","year":"2010","unstructured":"H. R. Zeidanloo and A. B. A. Manaf . Botnet detection by monitoring similar communication patterns. CoRR, abs\/1004.1232 , 2010 . H. R. Zeidanloo and A. B. A. Manaf. Botnet detection by monitoring similar communication patterns. CoRR, abs\/1004.1232, 2010."},{"key":"e_1_3_2_1_31_1","volume-title":"ICCCAS","author":"Zhou Y.","year":"2009","unstructured":"Y. Zhou , G. Hu , and W. He . Using graph to detect network traffic anomaly . In ICCCAS , 2009 . Y. Zhou, G. Hu, and W. He. Using graph to detect network traffic anomaly. In ICCCAS, 2009."}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12"},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T03:17:41Z","timestamp":1672975061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213974"}},"subtitle":["mining significant anomalous regions from time-evolving networks (abstract only)"],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":30,"alternative-id":["10.1145\/2213836.2213974","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213974","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}