{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:26:52Z","timestamp":1773250012057,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Key Research and Development Projects of Shaanxi Province","award":["2023-YBGY-270"],"award-info":[{"award-number":["2023-YBGY-270"]}]},{"name":"the Key Research and Development Projects of Shaanxi Province","award":["2023-YBGY-270"],"award-info":[{"award-number":["2023-YBGY-270"]}]},{"name":"National Key Research and Development Program of China","award":["2022YFB2701800"],"award-info":[{"award-number":["2022YFB2701800"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076191 and 61502375"],"award-info":[{"award-number":["62076191 and 61502375"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s13042-024-02198-0","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T16:06:58Z","timestamp":1717517218000},"page":"4959-4971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Target link protection against link-prediction-based attacks via artificial bee colony algorithm based on random walk"],"prefix":"10.1007","volume":"15","author":[{"given":"Zhongyuan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinghua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,4]]},"reference":[{"issue":"3","key":"2198_CR1","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCSS.2021.3054115","volume":"8","author":"X Chen","year":"2021","unstructured":"Chen X, Jiang Z, Li X, Ma J, Philip SY (2021) Community hiding by link perturbation in social networks. IEEE Trans Comput Soc Syst 8(3):704\u2013715","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2198_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13042-023-01822-9","volume":"14","author":"H Shao","year":"2023","unstructured":"Shao H, Wang L, Zhu R (2023) Link prediction for heterogeneous information networks based on enhanced meta-path aggregation and attention mechanism. Int J Mach Learn Cybern 14:1\u201317","journal-title":"Int J Mach Learn Cybern"},{"key":"2198_CR3","doi-asserted-by":"crossref","unstructured":"Mislove A, Viswanath B, Gummadi KP, Druschel P (2010) You are who you know: inferring user profiles in online social networks. In: Proceedings of the 3rd ACM international conference on web search and data mining, pp 251\u2013260","DOI":"10.1145\/1718487.1718519"},{"issue":"3","key":"2198_CR4","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1109\/TBDATA.2018.2867583","volume":"8","author":"M Li","year":"2018","unstructured":"Li M, Wang Y, Zhang D, Jia Y, Cheng X (2018) Link prediction in knowledge graphs: a hierarchy-constrained approach. IEEE Trans Big Data 8(3):630\u2013643","journal-title":"IEEE Trans Big Data"},{"key":"2198_CR5","doi-asserted-by":"crossref","unstructured":"Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: International workshop on privacy, security, and trust in KDD. Springer, London, pp 153\u2013171","DOI":"10.1007\/978-3-540-78478-4_9"},{"key":"2198_CR6","doi-asserted-by":"crossref","unstructured":"Ying X, Wu X (2009) On link privacy in randomizing social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, London, pp 28\u201339","DOI":"10.1007\/978-3-642-01307-2_6"},{"key":"2198_CR7","doi-asserted-by":"crossref","unstructured":"Jiang Z, Ma J, Yu PS (2019) Walk2privacy: limiting target link privacy disclosure against the adversarial link prediction. In: 2019 IEEE international conference on big data (big data). IEEE, pp 1381\u20131388","DOI":"10.1109\/BigData47090.2019.9005684"},{"key":"2198_CR8","doi-asserted-by":"crossref","unstructured":"Jiang Z, Sun L, Yu PS, Li H, Ma J, Shen Y (2020) Target privacy preserving for social networks. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 1862\u20131865","DOI":"10.1109\/ICDE48307.2020.00189"},{"key":"2198_CR9","doi-asserted-by":"crossref","unstructured":"Fard AM, Wang K, Yu PS (2012) Limiting link disclosure in social network analysis through subgraph-wise perturbation. In: Proceedings of the 15th international conference on extending database technology, pp 109\u2013119","DOI":"10.1145\/2247596.2247610"},{"issue":"1","key":"2198_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s11280-013-0240-6","volume":"18","author":"AM Fard","year":"2015","unstructured":"Fard AM, Wang K (2015) Neighborhood randomization for link privacy in social network analysis. World Wide Web 18(1):9\u201332","journal-title":"World Wide Web"},{"issue":"2","key":"2198_CR11","first-page":"754","volume":"33","author":"S Yu","year":"2021","unstructured":"Yu S, Zhao M, Fu C, Zheng J, Huang H, Shu X, Xuan Q, Chen G (2021) Target defense against link-prediction-based attacks via evolutionary perturbations. IEEE Trans Knowl Data Eng 33(2):754\u2013767","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2198_CR12","doi-asserted-by":"crossref","unstructured":"Gen M, Lin L (2023). In: Pham H (ed) Genetic algorithms and their applications, pp 635\u2013674","DOI":"10.1007\/978-1-4471-7503-2_33"},{"key":"2198_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ins.2022.11.029","volume":"619","author":"Y Li","year":"2023","unstructured":"Li Y, Han T, Tang S, Huang C, Zhou H, Wang Y (2023) An improved differential evolution by hybridizing with estimation-of-distribution algorithm. Inf Sci 619:439\u2013456","journal-title":"Inf Sci"},{"key":"2198_CR14","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71:623\u2013630","journal-title":"Eur Phys J B"},{"key":"2198_CR15","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"2198_CR16","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"4","key":"2198_CR17","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TCSS.2020.3004059","volume":"7","author":"J Chen","year":"2020","unstructured":"Chen J, Lin X, Shi Z, Liu Y (2020) Link prediction adversarial attack via iterative gradient attack. IEEE Trans Comput Soc Syst 7(4):1081\u20131094","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"2","key":"2198_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3447556.3447566","volume":"22","author":"W Jin","year":"2021","unstructured":"Jin W, Li Y, Xu H, Wang Y, Ji S, Aggarwal C, Tang J (2021) Adversarial attacks and defenses on graphs. ACM SIGKDD Explor Newsl 22(2):19\u201334","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"8","key":"2198_CR19","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1109\/TKDE.2018.2801854","volume":"30","author":"C Fu","year":"2018","unstructured":"Fu C, Zhao M, Fan L, Chen X, Chen J, Wu Z, Xia Y, Xuan Q (2018) Link weight prediction using supervised learning methods and its application to yelp layered network. IEEE Trans Knowl Data Eng 30(8):1507\u20131518","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2198_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105311","volume":"115","author":"E Kaya","year":"2022","unstructured":"Kaya E, Gorkemli B, Akay B, Karaboga D (2022) A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems. Eng Appl Artif Intell 115:105311","journal-title":"Eng Appl Artif Intell"},{"key":"2198_CR21","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboa","year":"2008","unstructured":"Karaboa D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687\u2013697","journal-title":"Appl Soft Comput"},{"issue":"Suppl-6","key":"2198_CR22","first-page":"477","volume":"271","author":"D Lusseau","year":"2004","unstructured":"Lusseau D, Newman ME (2004) Identifying the role that animals play in their social networks. Proc R Soc Lond 271(Suppl-6):477\u2013481","journal-title":"Proc R Soc Lond"},{"key":"2198_CR23","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence, vol 29","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"2198_CR24","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"issue":"12","key":"2198_CR25","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"04","key":"2198_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6(04):565\u2013573","journal-title":"Adv Complex Syst"},{"issue":"6","key":"2198_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"key":"2198_CR28","unstructured":"Ackland R (2005) Mapping the US political blogosphere: are conservative bloggers more prominent"},{"issue":"1","key":"2198_CR29","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Disc Data (TKDD) 1(1):2\u201343","journal-title":"ACM Trans Knowl Disc Data (TKDD)"},{"key":"2198_CR30","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.procs.2016.04.102","volume":"83","author":"L Yao","year":"2016","unstructured":"Yao L, Wang L, Pan L, Yao K (2016) Link prediction based on common-neighbors for dynamic social network. Proc Comput Sci 83:82\u201389","journal-title":"Proc Comput Sci"},{"key":"2198_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.127456","volume":"599","author":"LdF Costa","year":"2022","unstructured":"Costa LdF (2022) On similarity. Physica A 599:127456","journal-title":"Physica A"},{"issue":"5439","key":"2198_CR32","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"3","key":"2198_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02198-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02198-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02198-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T05:21:10Z","timestamp":1728451270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02198-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,4]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2198"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02198-0","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,4]]},"assertion":[{"value":"23 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}