乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:08:56Z","timestamp":1730326136709,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2022-0-00871 & 2019-0-00075"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583332","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"317-327","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes"],"prefix":"10.1145","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0971-3934","authenticated-orcid":false,"given":"Hyunju","family":"Kim","sequence":"first","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3223-8318","authenticated-orcid":false,"given":"Jihoon","family":"Ko","sequence":"additional","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0497-3902","authenticated-orcid":false,"given":"Fanchen","family":"Bu","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Republic of Korea"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Nesreen\u00a0K Ahmed Jennifer Neville Ryan\u00a0A Rossi and Nick Duffield. 2015. Efficient graphlet counting for large networks. In ICDM.","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981920"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_6_1","volume-title":"Guise: Uniform sampling of graphlets for large graph analysis. In ICDM.","author":"Bhuiyan A","year":"2012","unstructured":"Mansurul\u00a0A Bhuiyan, Mahmudur Rahman, Mahmuda Rahman, and Mohammad Al\u00a0Hasan. 2012. Guise: Uniform sampling of graphlets for large graph analysis. In ICDM."},{"volume-title":"Higher-order networks","author":"Bianconi Ginestra","key":"e_1_3_2_1_7_1","unstructured":"Ginestra Bianconi. 2021. Higher-order networks. Cambridge University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Marco Bressan Flavio Chierichetti Ravi Kumar Stefano Leucci and Alessandro Panconesi. 2017. Counting graphlets: Space vs time. In ICDM.","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_9_1","volume-title":"Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data 12, 4","author":"Bressan Marco","year":"2018","unstructured":"Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, and Alessandro Panconesi. 2018. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data 12, 4 (2018), 1\u201325."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"volume-title":"Frequent pattern mining","author":"Cheng Hong","key":"e_1_3_2_1_11_1","unstructured":"Hong Cheng, Xifeng Yan, and Jiawei Han. 2014. Mining graph patterns. In Frequent pattern mining. Springer, 307\u2013338."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2017.11.003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/pan\/mpl002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.11.003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Guyue Han and Harish Sethu. 2016. Waddling random walk: Fast and accurate mining of motif statistics in large graphs. In ICDM.","DOI":"10.1109\/ICDM.2016.0029"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897795.2897806"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt717"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10431-6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.015"},{"volume-title":"Simplicial complexes of graphs","author":"Jonsson Jakob","key":"e_1_3_2_1_20_1","unstructured":"Jakob Jonsson. 2007. Simplicial complexes of graphs. Springer Science & Business Media."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Hyunju Kim Jihoon Ko Fanchen Bu and Kijung Shin. 2023. Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes (Code Datasets and Appendix). https:\/\/github.com\/hhyy0401\/SC3.","DOI":"10.1145\/3543507.3583332"},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"From local patterns to global models: the LeGo approach to data mining","volume":"8","author":"Knobbe Arno","year":"2008","unstructured":"Arno Knobbe, Bruno Cr\u00e9milleux, Johannes F\u00fcrnkranz, and Martin Scholz. 2008. From local patterns to global models: the LeGo approach to data mining. LeGo 8 (2008), 1\u201316.","journal-title":"LeGo"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407823"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.111307"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-022-00858-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.08.019"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0898"},{"key":"e_1_3_2_1_30_1","volume-title":"Optimal network alignment with graphlet degree vectors. Cancer informatics 9","author":"Milenkovi\u0107 Tijana","year":"2010","unstructured":"Tijana Milenkovi\u0107, Weng\u00a0Leong Ng, Wayne Hayes, and Nata\u0161a Pr\u017eulj. 2010. Optimal network alignment with graphlet degree vectors. Cancer informatics 9 (2010), CIN\u2013S4744."},{"key":"e_1_3_2_1_31_1","volume-title":"The geometric realization of a semi-simplicial complex. Annals of Mathematics","author":"Milnor John","year":"1957","unstructured":"John Milnor. 1957. The geometric realization of a semi-simplicial complex. Annals of Mathematics (1957), 357\u2013362."},{"key":"e_1_3_2_1_32_1","volume-title":"Superfamilies of evolved and designed networks. Science 303, 5663","author":"Milo Ron","year":"2004","unstructured":"Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. 2004. Superfamilies of evolved and designed networks. Science 303, 5663 (2004), 1538\u20131542."},{"key":"e_1_3_2_1_33_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824\u2013827."},{"key":"e_1_3_2_1_34_1","volume-title":"Escape: Efficiently counting all 5-vertex subgraphs. In WWW.","author":"Pinar Ali","year":"2017","unstructured":"Ali Pinar, C Seshadhri, and Vaidyanathan Vishal. 2017. Escape: Efficiently counting all 5-vertex subgraphs. In WWW."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Giulia Preti Gianmarco De\u00a0Francisci\u00a0Morales and Francesco Bonchi. 2022. FreSCo: Mining Frequent Patterns in Simplicial Complexes. In WWW.","DOI":"10.1145\/3485447.3512191"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_37_1","volume-title":"Modeling interactome: scale-free or geometric\u00bfBioinformatics 20, 18","author":"Pr\u017eulj Natasa","year":"2004","unstructured":"Natasa Pr\u017eulj, Derek\u00a0G Corneil, and Igor Jurisica. 2004. Modeling interactome: scale-free or geometric\u00bfBioinformatics 20, 18 (2004), 3508\u20133515."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6404\/aae790"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1201019"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108149"},{"key":"e_1_3_2_1_42_1","unstructured":"Nino Shervashidze SVN Vishwanathan Tobias Petri Kurt Mehlhorn and Karsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AISTATS."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Arnab Sinha Zhihong Shen Yang Song Hao Ma Darrin Eide Bo-June Hsu and Kuansan Wang. 2015. An overview of microsoft academic service (mas) and applications. In WWW.","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"George\u00a0M Slota and Kamesh Madduri. 2013. Fast approximate subgraph counting and enumeration. In ICPP.","DOI":"10.1109\/ICPP.2013.30"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(87)90137-X"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1355896"},{"volume-title":"Graph theory. Vol.\u00a021","author":"Tutte William\u00a0Thomas","key":"e_1_3_2_1_48_1","unstructured":"William\u00a0Thomas Tutte and William\u00a0Thomas Tutte. 2001. Graph theory. Vol.\u00a021. Cambridge university press."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2020.126895"},{"key":"e_1_3_2_1_50_1","volume-title":"Efficiently estimating motif statistics of large networks. ACM Transactions on Knowledge Discovery from Data 9, 2","author":"Wang Pinghui","year":"2014","unstructured":"Pinghui Wang, John\u00a0CS Lui, Bruno Ribeiro, Don Towsley, Junzhou Zhao, and Xiaohong Guan. 2014. Efficiently estimating motif statistics of large networks. ACM Transactions on Knowledge Discovery from Data 9, 2 (2014), 1\u201327."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"e_1_3_2_1_53_1","unstructured":"Daniel\u00a0M Yellin. 1992. Algorithms for subset testing and finding maximal sets. In SODA."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Hao Yin Austin\u00a0R Benson Jure Leskovec and David\u00a0F Gleich. 2017. Local higher-order graph clustering. In KDD.","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3130321"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T18:58:28Z","timestamp":1709233108000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":54,"alternative-id":["10.1145\/3543507.3583332","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583332","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}