{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:15:51Z","timestamp":1777706151471,"version":"3.51.4"},"reference-count":59,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2022,6,9]]},"abstract":"<jats:p>Estimating similarity using multiple similarity measures or machine learning prediction models is a popular solution to the link prediction problem. The Relation Pattern Deep Learning Classification (RPDLC) technique is proposed in this study, and it is based on multiple neighbor-based similarity metrics and convolution neural networks. The RPDLC first calculates the characteristics for a pair of nodes using neighbor-based metrics and impact nodes. Second, the RPDLC creates a heat map using node characteristics to assess the similarity of the nodes\u2019 connection patterns. Third, the RPDLC uses convolution neural network architecture to build a prediction model for missing relationship prediction. On three separate social network datasets, this method is compared to other state-of-the-art algorithms. On all three datasets, the suggested method achieves the greatest AUC, hovering around 99 percent. The use of convolution neural networks and features via relational patterns to create a prediction model are the paper\u2019s primary contributions.<\/jats:p>","DOI":"10.3233\/jifs-219316","type":"journal-article","created":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T11:55:37Z","timestamp":1646999737000},"page":"2167-2178","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis and construction by convolution neural network of link prediction model on social network"],"prefix":"10.1177","volume":"43","author":[{"given":"Jimmy Ming-Tai","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Hsiun","family":"Tsai","sequence":"additional","affiliation":[{"name":"Department of Management Information Systems, National Chung Hsing University, Taichung City, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu-Wei","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Management Information Systems, National Chung Hsing University, Taichung City, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matin","family":"Pirouz","sequence":"additional","affiliation":[{"name":"Department of Computer Science, California State University, Fresno, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2022,3,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)00736-7"},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"BarbieriN. BonchiF. and MancoG. Who to follow and why: link prediction with explanations In The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 1266\u20131275 ACM 2014.","DOI":"10.1145\/2623330.2623733"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1037\/h0046049"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.001"},{"key":"e_1_3_1_8_2","doi-asserted-by":"crossref","unstructured":"ChenH.-H. GouL. ZhangX.L.L. and GilesC.L. Discovering missing links in networks using vertex similarity measures In The 27th Annual ACM Symposium on Applied Computing 138\u2013143 ACM 2012.","DOI":"10.1145\/2245276.2245305"},{"key":"e_1_3_1_9_2","doi-asserted-by":"crossref","unstructured":"ChenJ.-L. GeyerW. DuganC. MullerM. and GuyI. Make new friends but keep the old: recommending people on social networking sites In The SIGCHI Conference on Human Factors in Computing Systems 201\u2013210 ACM 2009.","DOI":"10.1145\/1518701.1518735"},{"key":"e_1_3_1_10_2","unstructured":"ClevertD.A. UnterthinerT. and HochreiterS. Fast and accurate deep network learning by exponential linear units (elus) ArXiv Preprint ArXiv:1511.07289 2015."},{"key":"e_1_3_1_11_2","unstructured":"Dillon and Martin Introduction to modern information retrieval: G. salton and m. mcgill. mcgraw-hill new york (1983) xv+ 448 pp. 32.95 isbn 0-07-054484-0 1983."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2730207"},{"key":"e_1_3_1_13_2","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi J.","year":"2011","unstructured":"DuchiJ., HazanE. and SingerY., Adaptive subgradient methods for online learning and stochastic optimization, Journal of Machine Learning Research 12 (2011), 2121\u20132159.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903001067"},{"key":"e_1_3_1_16_2","unstructured":"GoodfellowI. BengioY. and CourvilleA. Deep Learning MIT Press 2016."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"HeK.-M. ZhangX.-Y. RenS.-Q. and SunJ. Deep residual learning for image recognition In The IEEE Conference on Computer Vision and Pattern Recognition 770\u2013778 2016.","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_1_19_2","unstructured":"HintonG. SrivastavaN. and SwerskyK. Neural networks for machine learning lecture 6a overview of mini-batch gradient descent 14(8) (2012) 2."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-016-0087-z"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"HuangG. LiuZ. and WeinbergerK.Q. Densely connected convolutional networks Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 4700\u20134708 IEEE 2016.","DOI":"10.1109\/CVPR.2017.243"},{"key":"e_1_3_1_22_2","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des alpes et des jura","volume":"37","author":"Jaccard P.","year":"1901","unstructured":"JaccardP., \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura, Bull Soc Vaudoise Sci Nat 37 (1901), 547\u2013579.","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"e_1_3_1_23_2","doi-asserted-by":"crossref","unstructured":"JehG. and WidomJ. Simrank: a measure of structural-context similarity In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 538\u2013543 ACM 2002.","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_1_25_2","unstructured":"KingmaD.P. and BaJ. Adam:Amethod for stochastic optimization The 3rd International Conference for Learning Representations 2014."},{"key":"e_1_3_1_26_2","unstructured":"KlambauerG. UnterthinerT. MayrA. and HochreiterS. Self-normalizing neural networks Proceedings of the 31st international conference on neural information processing systems 972\u2013981 2017."},{"key":"e_1_3_1_27_2","unstructured":"KrizhevskyA. SutskeverI. and HintonG.E. Imagenet classification with deep convolutional neural networks In Advances in Neural Information Processing Systems 1097\u20131105 2012."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","unstructured":"LeskovecJ. HuttenlocherD. and KleinbergJ. Predicting positive and negative links in online social networks In The 19th International Conference on World Wide Web 641\u2013650 ACM 2010.","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.09.019"},{"issue":"7","key":"e_1_3_1_32_2","first-page":"1019","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell D.","year":"2007","unstructured":"Liben-NowellD. and KleinbergJ., The link-prediction problem for social networks, Journal of The Association for Information Science and Technology 58(7) (2007), 1019\u20131031.","journal-title":"Journal of The Association for Information Science and Technology"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/101\/18004"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/58007"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.046122"},{"key":"e_1_3_1_36_2","first-page":"3","article-title":"Rectifier nonlinearities improve neural network acoustic models","volume":"30","author":"Maas A.L.","year":"2013","unstructured":"MaasA.L., HannunA.Y. and NgA.Y., Rectifier nonlinearities improve neural network acoustic models, In Proc. Icml 30 (2013), 3.","journal-title":"In Proc. Icml"},{"key":"e_1_3_1_37_2","first-page":"548","article-title":"Learning to Discover Social Circles in Ego Networks","volume":"2012","author":"McAuley J.","year":"2012","unstructured":"McAuleyJ. and LeskovecJ., Learning to Discover Social Circles in Ego Networks, NIPS 2012 (2012), 548\u2013556.","journal-title":"NIPS"},{"key":"e_1_3_1_38_2","unstructured":"NairV. and HintonG.E. Rectified linear units improve restricted boltzmann machines In The 27th International Conference on Machine Learning (ICML-10) 807\u2013814 2010."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_1_40_2","doi-asserted-by":"crossref","unstructured":"PanJ.-Y. YangH.-J. FaloutsosC. and DuyguluP. Automatic multimedia cross-modal correlation discovery In The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 653\u2013658 ACM 2004.","DOI":"10.1145\/1014052.1014135"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.04.019"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-016-0058-z"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"},{"key":"e_1_3_1_44_2","doi-asserted-by":"crossref","unstructured":"ScellatoS. NoulasA. and MascoloC. Exploiting place features in link prediction on location-based social networks In The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 1046\u20131054 ACM 2011.","DOI":"10.1145\/2020408.2020575"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.10.011"},{"key":"e_1_3_1_46_2","unstructured":"SimonyanK. and ZissermanA. Very deep convolutional networks for large-scale image recognition arXiv preprint arXiv:1409.1556 2014."},{"key":"e_1_3_1_47_2","first-page":"1","article-title":"A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons","volume":"5","author":"S\u00f8rensen T.","year":"1948","unstructured":"S\u00f8rensenT., A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons, Biol Skr 5 (1948), 1\u201334.","journal-title":"Biol Skr"},{"issue":"1","key":"e_1_3_1_48_2","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava N.","year":"2014","unstructured":"SrivastavaN., HintonG., KrizhevskyA., SutskeverI. and SalakhutdinovR., Dropout: A simple way to prevent neural networks from overfitting, The Journal of Machine Learning Research 15(1) (2014), 1929\u20131958.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_1_49_2","doi-asserted-by":"crossref","unstructured":"SzegedyC. LiuW. JiaY.-Q. SermanetP. ReedS. AnguelovD. ErhanD. VanhouckeV. and RabinovichA. Going deeper with convolutions Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition 1\u20139 IEEE 2015.","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"e_1_3_1_50_2","doi-asserted-by":"crossref","unstructured":"SzegedyC. VanhouckeV. IoffeS. ShlensJ. and WojnaZ. Rethinking the inception architecture for computer vision In The IEEE Conference on Computer Vision and Pattern Recognition 2818\u20132826 2016.","DOI":"10.1109\/CVPR.2016.308"},{"key":"e_1_3_1_51_2","doi-asserted-by":"crossref","unstructured":"SzegedyC. VanhouckeV. IoffeS. ShlensJ. and WojnaZ. Rethinking the inception architecture for computer vision In The IEEE Conference on Computer Vision and Pattern Recognition 2818\u20132826 2016.","DOI":"10.1109\/CVPR.2016.308"},{"key":"e_1_3_1_52_2","doi-asserted-by":"crossref","unstructured":"TangJ.L. ChangS.-Y. AggarwalC. and LiuH. Negative link prediction in social media In The Eighth ACM International Conference on Web Search and Data Mining 87\u201396 ACM 2015.","DOI":"10.1145\/2684822.2685295"},{"issue":"6","key":"e_1_3_1_53_2","doi-asserted-by":"crossref","first-page":"e0129530","DOI":"10.1371\/journal.pone.0129530","article-title":"Predicting positive and negative relationships in large social networks","volume":"10","author":"Wang G.N.","year":"2015","unstructured":"WangG.N., GaoH., ChenL., MensahD.N. and FuY., Predicting positive and negative relationships in large social networks, PloS One 10(6):(2015), e0129530.","journal-title":"PloS One"},{"key":"e_1_3_1_54_2","doi-asserted-by":"crossref","unstructured":"WuT.Y. ChenY.Q. and ChenC.M. An enhanced pairing-based authentication scheme for smart grid communications Journal of Ambient Intelligence and Humanized Computing 2021","DOI":"10.1007\/s12652-020-02740-2"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6627956"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969986"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1177\/0165551516664039"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106218"},{"key":"e_1_3_1_59_2","doi-asserted-by":"crossref","unstructured":"ZhouJ. and KwanC. Missing link prediction in social networks In International Symposium on Neural Networks 346\u2013354. Springer 2018.","DOI":"10.1007\/978-3-319-92537-0_40"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-219316","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-219316","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-219316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:46:08Z","timestamp":1777455968000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-219316"}},"subtitle":[],"editor":[{"given":"Valentina Emilia","family":"Balas","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,3,10]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,9]]}},"alternative-id":["10.3233\/JIFS-219316"],"URL":"https:\/\/doi.org\/10.3233\/jifs-219316","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,10]]}}}