{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T06:24:24Z","timestamp":1770099864016,"version":"3.49.0"},"reference-count":35,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2021,12,11]],"date-time":"2021-12-11T00:00:00Z","timestamp":1639180800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Purpose<\/jats:title>\n                    <jats:p>With the availability and utilization of Inter-Country Input-Output (ICIO) tables, it is possible to construct quantitative indices to assess its impact on the Global Value Chain (GVC). For the sake of visualization, ICIO networks with tremendous low- weight edges are too dense to show the substantial structure. These redundant edges, inevitably make the network data full of noise and eventually exert negative effects on Social Network Analysis (SNA). In this case, we need a method to filter such edges and obtain a sparser network with only the meaningful connections.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Design\/methodology\/approach<\/jats:title>\n                    <jats:p>In this paper, we propose two parameterless pruning algorithms from the global and local perspectives respectively, then the performance of them is examined using the ICIO table from different databases.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Findings<\/jats:title>\n                    <jats:p>The Searching Paths (SP) method extracts the strongest association paths from the global perspective, while Filtering Edges (FE) method captures the key links according to the local weight ratio. The results show that the FE method can basically include the SP method and become the best solution for the ICIO networks.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Research limitations<\/jats:title>\n                    <jats:p>There are still two limitations in this research. One is that the computational complexity may increase rapidly while processing the large-scale networks, so the proposed method should be further improved. The other is that much more empirical networks should be introduced to testify the scientificity and practicability of our methodology.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Practical implications<\/jats:title>\n                    <jats:p>The network pruning methods we proposed will promote the analysis of the ICIO network, in terms of community detection, link prediction, and spatial econometrics, etc. Also, they can be applied to many other complex networks with similar characteristics.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Originality\/value<\/jats:title>\n                    <jats:p>This paper improves the existing research from two aspects, namely, considering the heterogeneity of weights and avoiding the interference of parameters. Therefore, it provides a new idea for the research of network backbone extraction.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.2478\/jdis-2022-0002","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T21:32:49Z","timestamp":1639171969000},"page":"57-75","source":"Crossref","is-referenced-by-count":5,"title":["Parameterless Pruning Algorithms for Similarity-Weight Network and Its Application in Extracting the Backbone of Global Value Chain"],"prefix":"10.2478","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9554-5414","authenticated-orcid":false,"given":"Lizhi","family":"Xing","sequence":"first","affiliation":[{"name":"College of Economics and Management , Beijing University of Technology , Beijing , China"},{"name":"International Business School , Beijing Foreign Studies University , Beijing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Han","sequence":"additional","affiliation":[{"name":"College of Economics and Management , Beijing University of Technology , Beijing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"2026020218172715443_j_jdis-2022-0002_ref_001","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., & Kompella, R. (2014). Network sampling: From static to streaming graphs. ACM Trans. Knowl. Discov. Data, 8(2), 1\u201356.","DOI":"10.1145\/2601438"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_002","doi-asserted-by":"crossref","unstructured":"Blagus, N., \u0160ubelj, L., & Bajec, M. (2012). Self-similar scaling of density in complex real-world networks. Physica A, 391(8), 2794\u20132802.","DOI":"10.1016\/j.physa.2011.12.055"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_003","doi-asserted-by":"crossref","unstructured":"Bu, Z., Wu, Z.A., Qian, L.Q., Cao, J., & Xu, G.D. (2014). A backbone extraction method with local search for complex weighted networks. In: 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, 85\u201388.","DOI":"10.1109\/ASONAM.2014.6921564"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_004","doi-asserted-by":"crossref","unstructured":"Burt, R.S (1992). Structural holes: The social structure of competition. Harvard University Press.","DOI":"10.4159\/9780674029095"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_005","doi-asserted-by":"crossref","unstructured":"Cao, J., Ding, C.L., & Shi, B.Y. (2019). Motif-based functional backbone extraction of complex networks. Physica A, 526, 121123.","DOI":"10.1016\/j.physa.2019.121123"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_006","doi-asserted-by":"crossref","unstructured":"Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007). A model of internet topology using k-shell decomposition. In: Proceedings of the National Academy of Sciences of the United States of America, 104(27), 11150\u201311154.","DOI":"10.1073\/pnas.0701175104"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_007","doi-asserted-by":"crossref","unstructured":"Chen, D.B., L\u00fc, L.Y., Shang, M.S., Zhang, Y.C., & Zhou, T. (2012). Identifying influential nodes in complex networks. Physica A, 391(4), 1777\u20131787.","DOI":"10.1016\/j.physa.2011.09.017"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_008","doi-asserted-by":"crossref","unstructured":"Coscia, M., & Neffke, F. (2017). Network backboning with noisy data. In: 2017 IEEE 33rd International Conference on Data Engineering, 425\u2013436.","DOI":"10.1109\/ICDE.2017.100"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_009","doi-asserted-by":"crossref","unstructured":"Dai, L., Derudder, B., & Liu, X. (2018). Transport network backbone extraction: A comparison of techniques. Journal of Transport Geography, 69, 271\u2013281.","DOI":"10.1016\/j.jtrangeo.2018.05.012"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_010","doi-asserted-by":"crossref","unstructured":"Foti, N.J., Hughes, J.M., & Rockmore, D.N. (2011). Nonparametric sparsification of complex multiscale networks. Plos One, 6(2), e16431.","DOI":"10.1371\/journal.pone.0016431"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_011","unstructured":"Ghalmane, Z., Cherifi, C., Cherifi, H., & Hassouni, M. (2020). A backbone extraction method for complex weighted networks, MARAMI."},{"key":"2026020218172715443_j_jdis-2022-0002_ref_012","doi-asserted-by":"crossref","unstructured":"Grady, D., Thiemann, C., & Brockmann, D. (2011). Robust classification of salient links in complex networks. Nat Commun, 3(1), 199\u2013202.","DOI":"10.1038\/ncomms1847"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_013","doi-asserted-by":"crossref","unstructured":"Granovetter, M. (1973). The Strength of Weak Ties. American Journal of Sociology, 78(6), 1360\u20131380.","DOI":"10.1086\/225469"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_014","doi-asserted-by":"crossref","unstructured":"Guan, J., Ren, J.Q., & Xing, L.Z. (2021). Measuring the nestedness of global production system based on bipartite network. In: The 9th International Conference on Complex Networks and Their Application, 547\u2013558.","DOI":"10.1007\/978-3-030-65351-4_44"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_015","doi-asserted-by":"crossref","unstructured":"Hennemann, S. (2013). Information-rich visualisation of dense geographical networks. Journal of Maps, 9, 68\u201375.","DOI":"10.1080\/17445647.2012.753850"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_016","doi-asserted-by":"crossref","unstructured":"Hirsch, J.E. (2005). An index to quantify an individual's scientific research output. In: Proceedings of the National Academy of Sciences of the United States of America, 102, 16569\u201316572.","DOI":"10.1073\/pnas.0507655102"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_017","doi-asserted-by":"crossref","unstructured":"Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., & Alon, U. (2004). Coarse-graining and self-dissimilarity of complex networks. Physical Review E, 71, 016127.","DOI":"10.1103\/PhysRevE.71.016127"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_018","doi-asserted-by":"crossref","unstructured":"Kim, D.H., Noh, J.D., & Jeong, H. (2004). Scale-free trees: The skeletons of complex networks. Physical Review E, 70(4), 046126.","DOI":"10.1103\/PhysRevE.70.046126"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_019","doi-asserted-by":"crossref","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., & Makse, H.A. (2010). Identification of influential spreaders in complex networks. Nature Phys., 6(11), 888\u2013893.","DOI":"10.1038\/nphys1746"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_020","doi-asserted-by":"crossref","unstructured":"Li, Q., Zhou, T., L\u00fc, L.Y., & Chen, D.B. (2014). Identifying influential spreaders by weighted LeaderRank. Physica A, 404, 47\u201355.","DOI":"10.1016\/j.physa.2014.02.041"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_021","doi-asserted-by":"crossref","unstructured":"Lv, L.Y., Zhang, Y.C., Yeung, C.H., & Zhou, T. (2011). Leaders in social networks, the delicious case. Plos One, 6(6), e21202.","DOI":"10.1371\/journal.pone.0021202"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_022","doi-asserted-by":"crossref","unstructured":"Malang, K., Wang, S.H., Phaphuangwittayakul, A., L\u00fc, Y.Y., Yuan, H.N., & Zhang, X.Z. (2020). Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction. Physica A, 545, 123769.","DOI":"10.1016\/j.physa.2019.123769"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_023","doi-asserted-by":"crossref","unstructured":"Marotta, L., Miccich\u00e8, S., Fujiwara, Y., Lyetomi, H., Aoyama, H., Gallegati, M., & Mantegna, R.N. (2015). Backbone of credit relationships in the Japanese credit market. EPJ Data Sci., 5(1), 1\u201314.","DOI":"10.1140\/epjds\/s13688-016-0071-7"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_024","doi-asserted-by":"crossref","unstructured":"Nick, B., Lee, C., Cunningham, P., & Brandes, U. (2013). Simmelian backbones: Amplifying hidden homophily in facebook networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, 525\u2013532.","DOI":"10.1145\/2492517.2492569"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_025","doi-asserted-by":"crossref","unstructured":"Radicchi, F., Ramasco, J.J., & Fortunato, S. (2011). Information filtering in complex weighted networks. Physical Review E, 83(4), 046101\u2013046101.","DOI":"10.1103\/PhysRevE.83.046101"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_026","doi-asserted-by":"crossref","unstructured":"Serrano, M.A., Boguna, M., & Vespignani, A. (2009). Extracting the multiscale backbone of complex weighted networks. In: Proceedings of the National Academy of Sciences of the United States of America, 106, 6483\u20136488.","DOI":"10.1073\/pnas.0808904106"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_027","doi-asserted-by":"crossref","unstructured":"Siganos, G., Tauro, S.L., & Faloutsos, M. (2006). Jellyfish: A conceptual model for the AS internet topology. Journal of Communications and Networks, 8(3), 339\u2013350.","DOI":"10.1109\/JCN.2006.6182774"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_028","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., & Hinkka, A. (2012). Network compression by node and edge mergers. In: M.R. Berthold (Eds.), Bisociative Knowledge Discovery, Springer, Berlin, Heidelberg, 199\u2013217.","DOI":"10.1007\/978-3-642-31830-6_14"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_029","doi-asserted-by":"crossref","unstructured":"Xing, L.Z., Dong, X.L., Guan, J., & Qiao, X.Y. (2019). Betweenness centrality for similarity-weight network and its application to measuring industrial sectors\u2019 pivotability on the global value chain. Physica A, 516, 19\u201336.","DOI":"10.1016\/j.physa.2018.10.004"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_030","doi-asserted-by":"crossref","unstructured":"Xing, L.Z., & Han, Y. (2021). Extracting the backbone of global value chain from high-dimensional inter-country input-output network. In: The 9th International Conference on Complex Networks and Their Application, 559\u2013570.","DOI":"10.1007\/978-3-030-65351-4_45"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_031","doi-asserted-by":"crossref","unstructured":"Zhang, R.J., Stanley, H.E., & Ye, F.Y. (2018). Extracting h-backbone as a core structure in weighted networks. Sci Rep, 8(1), 1\u20137.","DOI":"10.1038\/s41598-018-32430-1"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_032","doi-asserted-by":"crossref","unstructured":"Zhang, X.H., Zhang, Z.C., Zhang, H., Wang, Q., & Zhu, J. (2014). Extracting the globally and locally adaptive backbone of complex networks. Plos One, 9(6), e100428.","DOI":"10.1371\/journal.pone.0100428"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_033","doi-asserted-by":"crossref","unstructured":"Zhang, X.H., & Zhu, J. (2013). Skeleton of weighted social network. Physica A, 392(6), 1547\u20131556.","DOI":"10.1016\/j.physa.2012.12.001"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_034","doi-asserted-by":"crossref","unstructured":"Zhao, S.X., Zhang, P.L., J, L., Tan, A.M., & Ye, F.Y. (2014). Abstracting the core subnet of weighted networks based on link strengths. Journal of the Association for Information Science and Technology, 65(5), 984\u2013994.","DOI":"10.1002\/asi.23030"},{"key":"2026020218172715443_j_jdis-2022-0002_ref_035","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., & Yu, J.X. (2009). Graph clustering based on structural\/attribute similarities. In: Proceedings of the VLDB Endowment, 718\u2013729.","DOI":"10.14778\/1687627.1687709"}],"container-title":["Journal of Data and Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2022-0002\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2022-0002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T18:17:35Z","timestamp":1770056255000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2022-0002\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,11]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,12,11]]},"published-print":{"date-parts":[[2022,2,1]]}},"alternative-id":["10.2478\/jdis-2022-0002"],"URL":"https:\/\/doi.org\/10.2478\/jdis-2022-0002","relation":{},"ISSN":["2543-683X"],"issn-type":[{"value":"2543-683X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,11]]}}}