{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T19:01:03Z","timestamp":1784919663932,"version":"3.55.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"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":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,4,30]]},"abstract":"<jats:p>In this article, we propose a new method to perform topological network sampling. Topological network sampling is a process for extracting a subset of nodes and edges from a network, such that analyses on the sample provide results and conclusions comparable to the ones they would return if run on whole structure. We need network sampling because the largest online network datasets are accessed through low-throughput application programming interface (API) systems, rendering the collection of the whole network infeasible. Our method is inspired by the literature on network backboning, specifically the noise-corrected backbone. We select the next node to explore by following the edge we identify as the one providing the largest information gain, given the topology of the sample explored so far. We evaluate our method against the most commonly used sampling methods. We do so in a realistic framework, considering a wide array of network topologies, network analysis, and features of API systems. There is no method that can provide the best sample in all possible scenarios, thus in our results section, we show the cases in which our method performs best and the cases in which it performs worst. Overall, the noise-corrected network sampling performs well: it has the best rank average among the tested methods across a wide range of applications.<\/jats:p>","DOI":"10.1145\/3434749","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T11:11:56Z","timestamp":1614942716000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Noise Corrected Sampling of Online Social Networks"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5984-5137","authenticated-orcid":false,"given":"Michele","family":"Coscia","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351316.2351324"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601438"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 2017 IEEE 33rd International Conference on Data Engineering (ICDE\u201917)","author":"Coscia Michele"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622486"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJITM.2019.099809"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s P.","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"e_1_2_1_10_1","volume-title":"Baci: International trade database at the product-level (the 1994-2007 version). CEPII Working Paper No. 2010-23.","author":"Gaulier Guillaume","year":"2010"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705148"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms1847"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","volume-title":"The Atlas of Economic Complexity: Mapping Paths to Prosperity","author":"Hausmann Ricardo","DOI":"10.7551\/mitpress\/9647.001.0001"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397741"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_2_1_18_1","volume-title":"Paul Erdos is Eighty 2, 1\u201346","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1993"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_13"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 105--113","author":"Arun"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08667-3"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1951.10500769"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_2_1_25_1","volume-title":"The Shortest Path Through a Maze","author":"Moore Edward F."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.052304"},{"key":"e_1_2_1_27_1","volume-title":"The value of complementary co-workers. Science Advances 5, 12","author":"Neffke Frank M. H.","year":"2019"},{"key":"e_1_2_1_28_1","volume-title":"Network reconstruction and error estimation with noisy network data. arXiv preprint arXiv:1803.02427","author":"Newman M.","year":"2018"},{"key":"e_1_2_1_29_1","first-page":"041011","article-title":"Reconstructing networks with unknown and heterogeneous errors","author":"Peixoto Tiago P.","year":"2018","journal-title":"Physical Review"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062215"},{"key":"e_1_2_1_31_1","volume-title":"Technical Report CIS-TR-08.","author":"Rasti Amir H.","year":"2008"},{"key":"e_1_2_1_32_1","volume-title":"Mohammad Mehdi Daliri Khomami, and Mohammad Reza Meybodi","author":"Rezvanian Alireza","year":"2019"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0081-1750.2004.00152.x"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0808904106"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0904725106"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988910"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"UN Procurement Division. 2013. Trends in International Migrant Stock. United Nations. DOI:https:\/\/doi.org\/10.18356\/ff46f041-en  UN Procurement Division. 2013. Trends in International Migrant Stock. United Nations. DOI:https:\/\/doi.org\/10.18356\/ff46f041-en","DOI":"10.18356\/ff46f041-en"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953024"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2015.49"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:58Z","timestamp":1750195918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,30]]}},"alternative-id":["10.1145\/3434749"],"URL":"https:\/\/doi.org\/10.1145\/3434749","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"2020-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}