{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:02Z","timestamp":1750306562947,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"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":[[2014,11,3]]},"DOI":"10.1145\/2661829.2661991","type":"proceedings-article","created":{"date-parts":[[2014,11,7]],"date-time":"2014-11-07T17:10:54Z","timestamp":1415380254000},"page":"1749-1758","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Hotspot Detection in a Service-Oriented Architecture"],"prefix":"10.1145","author":[{"given":"Pranay","family":"Anchuri","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY, USA"}]},{"given":"Roshan","family":"Sumbaly","sequence":"additional","affiliation":[{"name":"Coursera Inc, Mountain View, CA, USA"}]},{"given":"Sam","family":"Shah","sequence":"additional","affiliation":[{"name":"LinkedIn Corporation, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948219"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-540-39763-2_17","volume-title":"Algorithms in Bioinformatics","author":"Amenta N.","year":"2003","unstructured":"N. Amenta, F. Clarke, and K. S. John. A linear-time majority tree algorithm. In Algorithms in Bioinformatics, volume 2812 of Lecture Notes in Computer Science, pages 216--227. Springer Berlin Heidelberg, 2003."},{"key":"e_1_3_2_1_3_1","first-page":"90","volume-title":"Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003","author":"Borgelt C.","year":"2003","unstructured":"C. Borgelt. Efficient implementations of apriori and eclat. In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003), page 90, 2003."},{"key":"e_1_3_2_1_4_1","volume-title":"On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30(2)","author":"Brandes U.","year":"2008","unstructured":"U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30(2), 2008."},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/978-3-642-10625-5_39","volume-title":"QSHINE","author":"Cuzzocrea A.","year":"2009","unstructured":"A. Cuzzocrea, D. Katsaros, Y. Manolopoulos, and A. Papadimitriou. EBC: A topology control algorithm for achieving high qos in sensor networks. In QSHINE, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pages 613--626, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1973430.1973450"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_9_1","volume-title":"Survey on frequent pattern mining. Technical report","author":"Goethals B.","year":"2003","unstructured":"B. Goethals. Survey on frequent pattern mining. Technical report, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2010.73"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209229"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015474"},{"key":"e_1_3_2_1_14_1","first-page":"1689","volume-title":"INFOCOM","author":"Hu N.","year":"2005","unstructured":"N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, and J. Wang. A measurement study of internet bottlenecks. In INFOCOM, pages 1689--1700. IEEE, 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2170444.2170464"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"M. Marzolla and R. Mirandola. Performance prediction of web service workflows. In S. Overhage C. A. Szyperski R. Reussner and J. A. Stafford editors QoSA volume 4880 of Lecture Notes in Computer Science pages 127--144. Springer 2007.","DOI":"10.5555\/1784860.1784872"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34321-6_1"},{"key":"e_1_3_2_1_19_1","volume-title":"LADIS","author":"Ostrowski K.","year":"2011","unstructured":"K. Ostrowski, G. Mann, and M. Sandler. Diagnosing latency in multi-tier black-box services. In LADIS, 2011."},{"key":"e_1_3_2_1_20_1","volume-title":"In Proc. of the First Bandwidth Estimation Workshop","author":"Ribeiro V. J.","year":"2003","unstructured":"V. J. Ribeiro, R. H. Riedi, and R. G. Baraniuk. Spatio-temporal available bandwidth estimation for high-speed networks. In In Proc. of the First Bandwidth Estimation Workshop, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972457.1972463"},{"key":"e_1_3_2_1_22_1","volume-title":"Google","author":"Sigelman B. H.","year":"2010","unstructured":"B. H. Sigelman, L. A. Barroso, M. Burrows, P. Stephenson, M. Plakal, D. Beaver, S. Jaspan, and C. Shanbhag. Dapper, a large-scale distributed systems tracing infrastructure. Technical report, Google, Inc., 2010."},{"key":"e_1_3_2_1_23_1","volume-title":"Fast hashing algorithms to summarize large collections of evolutionary trees","author":"Sul S.","year":"2008","unstructured":"S. Sul and T. L. Williams. Fast hashing algorithms to summarize large collections of evolutionary trees, 2008."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSNT.2012.6526314"}],"event":{"name":"CIKM '14: 2014 ACM Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Shanghai China","acronym":"CIKM '14"},"container-title":["Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661829.2661991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2661829.2661991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:06Z","timestamp":1750227186000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661829.2661991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":24,"alternative-id":["10.1145\/2661829.2661991","10.1145\/2661829"],"URL":"https:\/\/doi.org\/10.1145\/2661829.2661991","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}