{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T14:10:02Z","timestamp":1755871802187,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"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":[[2024,1,4]]},"DOI":"10.1145\/3632410.3633290","type":"proceedings-article","created":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T18:15:16Z","timestamp":1704305716000},"page":"484-488","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Unveiling Graph Structures for Machine Learning: Learning, Structuring, and Coarsening"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6379-0165","authenticated-orcid":false,"given":"Manoj","family":"Kumar","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0415-8625","authenticated-orcid":false,"given":"Sandeep","family":"Kumar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2293","article-title":"High-dimensional Gaussian graphical model selection: Walk summability and local separation criterion","author":"Anandkumar Animashree","year":"2012","unstructured":"Animashree Anandkumar, Vincent\u00a0YF Tan, Furong Huang, and Alan\u00a0S Willsky. 2012. High-dimensional Gaussian graphical model selection: Walk summability and local separation criterion. Journal of Machine Learning Research 13, Aug (2012), 2293\u20132337.","journal-title":"Journal of Machine Learning Research 13"},{"key":"e_1_3_2_1_2_1","volume-title":"Mar","author":"Banerjee Onureena","year":"2008","unstructured":"Onureena Banerjee, Laurent\u00a0El Ghaoui, and Alexandre d\u2019Aspremont. 2008. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. Journal of Machine Learning Research 9, Mar (2008), 485\u2013516."},{"volume-title":"Network Sciene","author":"Albert-L\u00e1szl\u00f3","key":"e_1_3_2_1_3_1","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si 2016. Network Sciene. Cambridge university press."},{"key":"e_1_3_2_1_4_1","volume-title":"Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261","author":"Battaglia W","year":"2018","unstructured":"Peter\u00a0W Battaglia, Jessica\u00a0B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, 2018. Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261 (2018)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40324-021-00282-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"e_1_3_2_1_7_1","volume-title":"Covariance selection. Biometrics","author":"Dempster P","year":"1972","unstructured":"Arthur\u00a0P Dempster. 1972. Covariance selection. Biometrics (1972), 157\u2013175."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asq060"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Simultaneous Clustering and Estimation of Heterogeneous Graphical Models","volume":"18","author":"Hao Botao","year":"2018","unstructured":"Botao Hao, Will\u00a0Wei Sun, Yufeng Liu, and Guang Cheng. 2018. Simultaneous Clustering and Estimation of Heterogeneous Graphical Models. Journal of Machine Learning Research 18, 217 (2018), 1\u201358.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume":"95","author":"Hendrickson Bruce","year":"1995","unstructured":"Bruce Hendrickson, Robert\u00a0W Leland, 1995. A Multi-Level Algorithm For Partitioning Graphs.SC 95, 28 (1995), 1\u201314.","journal-title":"A Multi-Level Algorithm For Partitioning Graphs.SC"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467256"},{"key":"e_1_3_2_1_15_1","volume-title":"Graph condensation for graph neural networks. arXiv preprint arXiv:2110.07580","author":"Jin Wei","year":"2021","unstructured":"Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, and Neil Shah. 2021. Graph condensation for graph neural networks. arXiv preprint arXiv:2110.07580 (2021)."},{"key":"e_1_3_2_1_16_1","unstructured":"Vassilis Kalofolias. 2016. How to learn a graph from smooth signals. In Artificial intelligence and statistics. PMLR 920\u2013929."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"A Unified Framework for Optimization-Based Graph Coarsening","volume":"24","author":"Kumar Manoj","year":"2023","unstructured":"Manoj Kumar, Anurag Sharma, and Sandeep Kumar. 2023. A Unified Framework for Optimization-Based Graph Coarsening. Journal of Machine Learning Research 24, 118 (2023), 1\u201350.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_19_1","unstructured":"Manoj Kumar Anurag Sharma Shashwat Saxena and Sandeep Kumar. 2023. Featured Graph Coarsening with Similarity Guarantees. (2023)."},{"key":"e_1_3_2_1_20_1","volume-title":"A Unified Framework for Structured Graph Learning via Spectral Constraints.Journal of Machine Learning Research 21, 22","author":"Kumar Sandeep","year":"2020","unstructured":"Sandeep Kumar, Jiaxi Ying, Jos\u00e9\u00a0Vin\u00edcius de Miranda\u00a0Cardoso, and Daniel\u00a0P Palomar. 2020. A Unified Framework for Structured Graph Learning via Spectral Constraints.Journal of Machine Learning Research 21, 22 (2020), 1\u201360."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.04.007"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. 40\u201348","author":"Liu Qiang","year":"2011","unstructured":"Qiang Liu and Alexander Ihler. 2011. Learning scale free networks by reweighted l1 regularization. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. 40\u201348."},{"key":"e_1_3_2_1_23_1","volume-title":"Graph summarization methods and applications: A survey. ACM computing surveys (CSUR) 51, 3","author":"Liu Yike","year":"2018","unstructured":"Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra. 2018. Graph summarization methods and applications: A survey. ACM computing surveys (CSUR) 51, 3 (2018), 1\u201334."},{"key":"e_1_3_2_1_24_1","volume-title":"Graph Reduction with Spectral and Cut Guarantees.Journal of Machine Learning Research 20, 116","author":"Loukas Andreas","year":"2019","unstructured":"Andreas Loukas. 2019. Graph Reduction with Spectral and Cut Guarantees.Journal of Machine Learning Research 20, 116 (2019), 1\u201342."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of Machine Learning Research, 3237\u20133246","author":"Loukas Andreas","year":"2018","unstructured":"Andreas Loukas and Pierre Vandergheynst. 2018. Spectrally approximating large graphs with smaller graphs. In International Conference on Machine Learning. Proceedings of Machine Learning Research, 3237\u20133246."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17072"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553465"},{"key":"e_1_3_2_1_28_1","volume-title":"High-dimensional graphs and variable selection with the lasso. The annals of statistics 34, 3","author":"Meinshausen Nicolai","year":"2006","unstructured":"Nicolai Meinshausen, Peter B\u00fchlmann, 2006. High-dimensional graphs and variable selection with the lasso. The annals of statistics 34, 3 (2006), 1436\u20131462."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2731051"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-05469-x"},{"key":"e_1_3_2_1_31_1","first-page":"7101","article-title":"Nonconvex sparse graph learning under Laplacian constrained graphical model","volume":"33","author":"Ying Jiaxi","year":"2020","unstructured":"Jiaxi Ying, Jos\u00e9\u00a0Vin\u00edcius de Miranda\u00a0Cardoso, and Daniel Palomar. 2020. Nonconvex sparse graph learning under Laplacian constrained graphical model. Advances in Neural Information Processing Systems 33 (2020), 7101\u20137113.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.2172\/816202"}],"event":{"name":"CODS-COMAD 2024: 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)","acronym":"CODS-COMAD 2024","location":"Bangalore India"},"container-title":["Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632410.3633290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632410.3633290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:35:01Z","timestamp":1755869701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632410.3633290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":32,"alternative-id":["10.1145\/3632410.3633290","10.1145\/3632410"],"URL":"https:\/\/doi.org\/10.1145\/3632410.3633290","relation":{},"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"2024-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}