{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T19:49:02Z","timestamp":1780516142760,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["No. N00014-15-1-2821"],"award-info":[{"award-number":["No. N00014-15-1-2821"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-16-1-0168"],"award-info":[{"award-number":["W911NF-16-1-0168"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01LM011986"],"award-info":[{"award-number":["R01LM011986"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["No HDTRA1-16-0017"],"award-info":[{"award-number":["No HDTRA1-16-0017"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["No. IIS-1552654 and IIS-1651203"],"award-info":[{"award-number":["No. IIS-1552654 and IIS-1651203"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Region II University Transportation Center","award":["49997-33 25"],"award-info":[{"award-number":["49997-33 25"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098015","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"655-664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["A Local Algorithm for Structure-Preserving Graph Cut"],"prefix":"10.1145","author":[{"given":"Dawei","family":"Zhou","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Si","family":"Zhang","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehmet Yigit","family":"Yildirim","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Alcorn","sequence":"additional","affiliation":[{"name":"Early Warnings LLC., Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hasan","family":"Davulcu","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingrui","family":"He","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Limit distribution of a high order Markov chain. J R Stat Soc","author":"SR","year":"1988","unstructured":"SR A and SR D. 1988. Limit distribution of a high order Markov chain. J R Stat Soc ( 1988 ). SR A and SR D. 1988. Limit distribution of a high order Markov chain. J R Stat Soc (1988)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"R. Andersen F. Chung and K. Lang. 2006. Local graph partitioning using pagerank vectors. In IEEE FOCS (2006).  R. Andersen F. Chung and K. Lang. 2006. Local graph partitioning using pagerank vectors. In IEEE FOCS (2006).","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_13"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"R. Andersen S. O. Gharan Y. Peres and L. Trevisan. 2016. Almost Optimal Local Graph Clustering Using Evolving Sets. JACM (2016).  R. Andersen S. O. Gharan Y. Peres and L. Trevisan. 2016. Almost Optimal Local Graph Clustering Using Evolving Sets. JACM (2016).","DOI":"10.1145\/2856030"},{"key":"e_1_3_2_2_5_1","volume":"201","author":"Benson A. R","unstructured":"A. R Benson , D. F Gleich , and J. Leskovec. 201 5. Tensor spectral clustering for partitioning higher-order network structures. In SIAM SDM (2015). A. R Benson, D. F Gleich, and J. Leskovec. 2015. Tensor spectral clustering for partitioning higher-order network structures. In SIAM SDM (2015).","journal-title":"J. Leskovec."},{"key":"e_1_3_2_2_6_1","volume-title":"The Spacey Random Walk: A stochastic Process for Higher-Order Data. arXiv preprint arXiv:1602.02102","author":"Benson A. R","year":"2016","unstructured":"A. R Benson , D. F Gleich , and L.-H. Lim . 2016. The Spacey Random Walk: A stochastic Process for Higher-Order Data. arXiv preprint arXiv:1602.02102 ( 2016 ). A. R Benson, D. F Gleich, and L.-H. Lim. 2016. The Spacey Random Walk: A stochastic Process for Higher-Order Data. arXiv preprint arXiv:1602.02102 (2016)."},{"key":"e_1_3_2_2_7_1","volume-title":"Modern graph theory","author":"Bollob\u00e1s B","year":"2013","unstructured":"B Bollob\u00e1s . 2013. Modern graph theory . Springer Science & Business Media ( 2013 ). B Bollob\u00e1s. 2013. Modern graph theory. Springer Science & Business Media (2013)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"C. Chen J. He N. Bliss and H. Tong. 2015. On the connectivity of multi-layered networks: Models measures and optimal control. In IEEE ICDM (2015).  C. Chen J. He N. Bliss and H. Tong. 2015. On the connectivity of multi-layered networks: Models measures and optimal control. In IEEE ICDM (2015).","DOI":"10.1109\/ICDM.2015.104"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939784"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"F. Chierichetti R. Kumar P. Raghavan and T. Sarlos. 2012. Are web users really markovian?. In ACM WWW (2012).  F. Chierichetti R. Kumar P. Raghavan and T. Sarlos. 2012. Are web users really markovian?. In ACM WWW (2012).","DOI":"10.1145\/2187836.2187919"},{"key":"e_1_3_2_2_11_1","volume-title":"Money laundering risks of prepaid stored value cards. Aus- tralian Institute of Criminology","author":"Choo K.-K. R.","year":"2008","unstructured":"K.-K. R. Choo . 2008. Money laundering risks of prepaid stored value cards. Aus- tralian Institute of Criminology ( 2008 ). K.-K. R. Choo. 2008. Money laundering risks of prepaid stored value cards. Aus- tralian Institute of Criminology (2008)."},{"key":"e_1_3_2_2_12_1","volume-title":"Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding","author":"Ding C.","year":"2008","unstructured":"C. Ding , T. Li , and M. I Jordan . 2008. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding . In IEEE ICDM ( 2008 ) . C. Ding, T. Li, and M. I Jordan. 2008. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding. In IEEE ICDM (2008) ."},{"key":"e_1_3_2_2_13_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato S.","year":"2010","unstructured":"S. Fortunato . 2010. Community detection in graphs. Physics reports ( 2010 ). S. Fortunato. 2010. Community detection in graphs. Physics reports (2010)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"S. O. Gharan and L. Trevisan. 2012. Approximating the expansion profile and almost optimal local graph clustering. In IEEE FOCS (2012).  S. O. Gharan and L. Trevisan. 2012. Approximating the expansion profile and almost optimal local graph clustering. In IEEE FOCS (2012).","DOI":"10.1109\/FOCS.2012.85"},{"key":"e_1_3_2_2_15_1","unstructured":"D. F Gleich L.-H. Lim and Y. Yu. 2015. Multilinear PageRank. SIMAX (2015).  D. F Gleich L.-H. Lim and Y. Yu. 2015. Multilinear PageRank. SIMAX (2015)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_2_17_1","volume-title":"B Hollingshead et al","author":"A.","year":"1975","unstructured":"A. B Hollingshead et al . 1975 . Four factor index of social status. (1975). A. B Hollingshead et al. 1975. Four factor index of social status. (1975)."},{"key":"e_1_3_2_2_18_1","volume":"200","author":"C.","unstructured":"C. J. Hoofnagle. 200 7. Identity theft: Making the known unknowns known. Harv. JL & Tech. (2007). C. J. Hoofnagle. 2007. Identity theft: Making the known unknowns known. Harv. JL & Tech. (2007).","journal-title":"J. Hoofnagle."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"T. Leighton and S. Rao. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM (1999).  T. Leighton and S. Rao. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM (1999).","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_2_20_1","unstructured":"J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014).  J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_2_21_1","volume-title":"Radar: Residual Analysis for Anomaly Detection in Attributed Networks. In IJCAI","author":"Li J.","year":"2017","unstructured":"J. Li , H. Dani , X. Hu , and H. Liu . 2017 . Radar: Residual Analysis for Anomaly Detection in Attributed Networks. In IJCAI (2017). J. Li, H. Dani, X. Hu, and H. Liu. 2017. Radar: Residual Analysis for Anomaly Detection in Attributed Networks. In IJCAI (2017)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"J. Li X. Hu L. Jian and H. Liu. 2016. Toward Time-Evolving Feature Selection on Dynamic Networks. In IEEE ICDM (2016).  J. Li X. Hu L. Jian and H. Liu. 2016. Toward Time-Evolving Feature Selection on Dynamic Networks. In IEEE ICDM (2016).","DOI":"10.1109\/ICDM.2016.0127"},{"key":"e_1_3_2_2_23_1","volume-title":"On the limiting probability distribution of a transition probability tensor. Linear and Multilinear Algebra","author":"Li W.","year":"2014","unstructured":"W. Li and M. K Ng . 2014. On the limiting probability distribution of a transition probability tensor. Linear and Multilinear Algebra ( 2014 ). W. Li and M. K Ng. 2014. On the limiting probability distribution of a transition probability tensor. Linear and Multilinear Algebra (2014)."},{"key":"e_1_3_2_2_24_1","unstructured":"L. Lov\u00e1sz and M. Simonovits. 1990. The mixing rate of Markov chains an isoperimetric inequality and computing the volume. In IEEE FOCS (1990).  L. Lov\u00e1sz and M. Simonovits. 1990. The mixing rate of Markov chains an isoperimetric inequality and computing the volume. In IEEE FOCS (1990)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz and M. Simonovits. 1993. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms (1993).  L. Lov\u00e1sz and M. Simonovits. 1993. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms (1993).","DOI":"10.1002\/rsa.3240040402"},{"key":"e_1_3_2_2_26_1","volume-title":"A model for high-order Markov chains. J R Stat Soc Series B Stat Methodol","author":"Raftery A. E","year":"1985","unstructured":"A. E Raftery . 1985. A model for high-order Markov chains. J R Stat Soc Series B Stat Methodol ( 1985 ). A. E Raftery. 1985. A model for high-order Markov chains. J R Stat Soc Series B Stat Methodol (1985)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"M. Rosvall A. V Esquivel A. Lancichinetti J. D West and R. Lambiotte. 2014. Memory in network flows and its effects on spreading dynamics and community detection. Nature communications (2014).  M. Rosvall A. V Esquivel A. Lancichinetti J. D West and R. Lambiotte. 2014. Memory in network flows and its effects on spreading dynamics and community detection. Nature communications (2014).","DOI":"10.1038\/ncomms5630"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"J. \u0160\u00edma and S. E. Schaeffer. 2006. On the NP-completeness of some graph cluster measures. In Springer SOFSEM (2006).  J. \u0160\u00edma and S. E. Schaeffer. 2006. On the NP-completeness of some graph cluster measures. In Springer SOFSEM (2006).","DOI":"10.1007\/11611257_51"},{"key":"e_1_3_2_2_29_1","volume-title":"A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SICOMP","author":"Spielman D. A","year":"2013","unstructured":"D. A Spielman and S.-H. Teng . 2013. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SICOMP ( 2013 ). D. A Spielman and S.-H. Teng. 2013. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SICOMP (2013)."},{"key":"e_1_3_2_2_30_1","volume-title":"Markov Chains: Models, Algorithms and Applications. JASA","author":"Teugels J. L","year":"2008","unstructured":"J. L Teugels . 2008 . Markov Chains: Models, Algorithms and Applications. JASA (2008). J. L Teugels. 2008. Markov Chains: Models, Algorithms and Applications. JASA (2008)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"C. Tsourakakis F. Bonchi A. Gionis F. Gullo and M. Tsiarli. 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In ACM SIGKDD (2013).  C. Tsourakakis F. Bonchi A. Gionis F. Gullo and M. Tsiarli. 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In ACM SIGKDD (2013).","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"C. E Tsourakakis J. Pachocki and M. Mitzenmacher. 2017. Scalable motif-aware graph clustering. In WWW (2017).  C. E Tsourakakis J. Pachocki and M. Mitzenmacher. 2017. Scalable motif-aware graph clustering. In WWW (2017).","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_2_33_1","volume-title":"NIPS","author":"Wu T.","year":"2016","unstructured":"T. Wu , A. R Benson , and D. F Gleich . 2016. General tensor spectral co-clustering for higher-order data . In NIPS ( 2016 ). T. Wu, A. R Benson, and D. F Gleich. 2016. General tensor spectral co-clustering for higher-order data. In NIPS (2016)."},{"key":"e_1_3_2_2_34_1","volume-title":"MUVIR: Multi-View Rare Category Detection.. In IJCAI","author":"Zhou D.","year":"2015","unstructured":"D. Zhou , J. He , K.-S. Candan , and H. Davulcu . 2015 . MUVIR: Multi-View Rare Category Detection.. In IJCAI (2015). D. Zhou, J. He, K.-S. Candan, and H. Davulcu. 2015. MUVIR: Multi-View Rare Category Detection.. In IJCAI (2015)."},{"key":"e_1_3_2_2_35_1","first-page":"i","volume":"201","author":"Zhou D.","unstructured":"D. Zhou , J. He , Y. Cao , and J. Seo. 201 6. B i -level Rare Temporal Pattern Detection. In IEEE ICDM (2016). D. Zhou, J. He, Y. Cao, and J. Seo. 2016. Bi-level Rare Temporal Pattern Detection. In IEEE ICDM (2016).","journal-title":"J. Seo."},{"key":"e_1_3_2_2_36_1","volume":"201","author":"Zhou D.","unstructured":"D. Zhou , A. Karthikeyan , K. Wang , N. Cao , and J. He. 201 6. Discovering rare categories from graph streams. Springer DMKD (2016). D. Zhou, A. Karthikeyan, K. Wang, N. Cao, and J. He. 2016. Discovering rare categories from graph streams. Springer DMKD (2016).","journal-title":"J. He."},{"key":"e_1_3_2_2_37_1","volume":"201","author":"Zhou D.","unstructured":"D. Zhou , K. Wang , N. Cao , and J. He. 201 5. Rare category detection on time- evolving graphs. In IEEE ICDM (2015). D. Zhou, K. Wang, N. Cao, and J. He. 2015. Rare category detection on time- evolving graphs. In IEEE ICDM (2015).","journal-title":"J. He."},{"key":"e_1_3_2_2_38_1","volume":"201","author":"Zhou Y.","unstructured":"Y. Zhou and J. He. 201 6. Crowdsourcing via tensor augmentation and completion. In IJCAI (2016). Y. Zhou and J. He. 2016. Crowdsourcing via tensor augmentation and completion. In IJCAI (2016).","journal-title":"J. He."},{"key":"e_1_3_2_2_39_1","volume":"201","author":"Zhou Y.","unstructured":"Y. Zhou , L. Ying , and J. He. 201 7. MultiC2: an Optimization Framework for Learning from Task and Worker Dual Heterogeneity. In SIAM SDM (2017). Y. Zhou, L. Ying, and J. He. 2017. MultiC2: an Optimization Framework for Learning from Task and Worker Dual Heterogeneity. In SIAM SDM (2017).","journal-title":"J. He."}],"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.3098015","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098015","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:43Z","timestamp":1750273423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":39,"alternative-id":["10.1145\/3097983.3098015","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098015","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}