{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:47:43Z","timestamp":1754156863031,"version":"3.41.2"},"reference-count":57,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2023,3,17]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Social networking platforms are increasingly using the Follower Link Prediction tool in an effort to expand the number of their users. It facilitates the discovery of previously unidentified individuals and can be employed to determine the relationships among the nodes in a social network. On the other hand, social site firms use follower\u2013followee link prediction (FFLP) to increase their user base. FFLP can help identify unfamiliar people and determine node-to-node links in a social network. Choosing the appropriate person to follow becomes crucial as the number of users increases. A hybrid model employing the Ensemble Learning algorithm for FFLP (HMELA) is proposed to advise the formation of new follower links in large networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>HMELA includes fundamental classification techniques for treating link prediction as a binary classification problem. The data sets are represented using a variety of machine-learning-friendly hybrid graph features. The HMELA is evaluated using six real-world social network data sets.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The first set of experiments used exploratory data analysis on a di-graph to produce a balanced matrix. The second set of experiments compared the benchmark and hybrid features on data sets. This was followed by using benchmark classifiers and ensemble learning methods. The experiments show that the proposed (HMELA) method predicts missing links better than other methods.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title><jats:p>A hybrid suggested model for link prediction is proposed in this paper. The suggested HMELA model makes use of AUC scores to predict new future links. The proposed approach facilitates comprehension and insight into the domain of link prediction. This work is almost entirely aimed at academics, practitioners, and those involved in the field of social networks, etc. Also, the model is quite effective in the field of product recommendation and in recommending a new friend and user on social networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The outcome on six benchmark data sets revealed that when the HMELA strategy had been applied to all of the selected data sets, the area under the curve (AUC) scores were greater than when individual techniques were applied to the same data sets. Using the HMELA technique, the maximum AUC score in the Facebook data set has been increased by 10.3 per cent from 0.8449 to 0.9479. There has also been an 8.53 per cent increase in the accuracy of the Net Science, Karate Club and USAir databases. As a result, the HMELA strategy outperforms every other strategy tested in the study.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-02-2022-0072","type":"journal-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T14:35:40Z","timestamp":1657895740000},"page":"131-153","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid approach for predicting missing follower\u2013followee links in social networks using topological features with ensemble learning"],"prefix":"10.1108","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9265-5746","authenticated-orcid":false,"given":"Riju","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5306-5818","authenticated-orcid":false,"given":"Naresh Kumar","family":"Nagwani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0873-2102","authenticated-orcid":false,"given":"Sarsij","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2022,7,9]]},"reference":[{"issue":"1","key":"key2023031608343308600_ref001","first-page":"1","article-title":"Application of network link prediction in drug discovery","volume":"22","year":"2021","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"key2023031608343308600_ref002","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","year":"2003","journal-title":"Social Networks"},{"issue":"1","key":"key2023031608343308600_ref003","first-page":"1","article-title":"Missing link prediction using common neighbor and centrality based parameterized algorithm","volume":"10","year":"2020","journal-title":"Scientific Reports"},{"key":"key2023031608343308600_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-3393-4_8","article-title":"Using hierarchies in online social networks to determine link prediction","volume":"898","year":"2019","journal-title":"Advances in Intelligent Systems and Computing"},{"issue":"1","key":"key2023031608343308600_ref005","first-page":"6","article-title":"Applying an influence measurement framework to large social network","volume":"7","year":"2016","journal-title":"Networking Technology"},{"issue":"3","key":"key2023031608343308600_ref006","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","article-title":"An introduction to kernel and nearest-neighbor nonparametric regression","volume":"46","year":"1992","journal-title":"American Statistician"},{"issue":"1","key":"key2023031608343308600_ref007","doi-asserted-by":"crossref","first-page":"408","DOI":"10.14778\/1453856.1453903","article-title":"Simrank++","volume":"1","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"key2023031608343308600_ref008","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s13278-019-0618-2","article-title":"Accurate link prediction method based on path length between a pair of unlinked nodes and their degree","volume":"10","year":"2020","journal-title":"Social Network Analysis and Mining"},{"issue":"5","key":"key2023031608343308600_ref009","doi-asserted-by":"crossref","first-page":"230","DOI":"10.6025\/jdim\/2018\/16\/5\/223-229","article-title":"A log based update of replicated profiles in decentralized social networks","volume":"16","year":"2018","journal-title":"Journal of Digital Information Management"},{"issue":"October","key":"key2023031608343308600_ref010","first-page":"677","article-title":"Emergence of scaling in random networks","volume":"74","year":"1995","journal-title":"Materials Research Society Symposium Proceedings"},{"key":"key2023031608343308600_ref011","unstructured":"Batagelj, V. and Mrvar, A. (2006), \u201cPajek datasets\u201d, USAir97. Net http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/mix."},{"key":"key2023031608343308600_ref012","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-08399-y","article-title":"Follower link prediction using the XGBoost classification model with multiple graph features","year":"2021","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"key2023031608343308600_ref013","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","year":"2001","journal-title":"Machine Learning"},{"first-page":"1237","article-title":"Graph-based features for supervised link prediction","year":"2011","key":"key2023031608343308600_ref014"},{"key":"key2023031608343308600_ref015","doi-asserted-by":"crossref","first-page":"102716","DOI":"10.1016\/j.jnca.2020.102716","article-title":"Applications of link prediction in social networks: a review","volume":"166","year":"2020","journal-title":"Journal of Network and Computer Applications"},{"first-page":"142","article-title":"Can a user guess what her followers want?","year":"2020","key":"key2023031608343308600_ref016"},{"issue":"12","key":"key2023031608343308600_ref017","doi-asserted-by":"crossref","first-page":"10051","DOI":"10.1007\/s13369-020-04612-5","article-title":"Link prediction model based on the topological feature learning for complex networks","volume":"45","year":"2020","journal-title":"Arabian Journal for Science and Engineering"},{"year":"2016","key":"key2023031608343308600_ref018","article-title":"Personalized recommender system based on social relations"},{"issue":"June 2020","key":"key2023031608343308600_ref019","first-page":"113896","article-title":"A hybrid method of link prediction in directed graphs","volume":"165","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"key2023031608343308600_ref020","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","article-title":"The meaning and use of the area under a receiver operating characteristic (ROC) curve","volume":"143","year":"1982","journal-title":"Radiology"},{"issue":"1","key":"key2023031608343308600_ref021","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","article-title":"Evaluating collaborative filtering recommender systems","volume":"22","year":"2004","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"volume-title":"Evaluating Learning Algorithms: A Classification Perspective","year":"2011","key":"key2023031608343308600_ref022"},{"volume-title":"100 Statistical Tests","year":"2006","key":"key2023031608343308600_ref023"},{"issue":"1","key":"key2023031608343308600_ref024","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric","volume":"18","year":"1953","journal-title":"Psychmetrika"},{"key":"key2023031608343308600_ref025","doi-asserted-by":"crossref","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","article-title":"Link prediction techniques, applications, and performance: a survey","volume":"553","year":"2020","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"key2023031608343308600_ref026","first-page":"1","article-title":"Supervised link prediction using structured-based feature extraction in social network","volume":"34","year":"2020","journal-title":"Concurrency Computation"},{"issue":"7","key":"key2023031608343308600_ref027","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","year":"2007","journal-title":"Journal of the American Society for Information Science and Technology"},{"issue":"1","key":"key2023031608343308600_ref028","first-page":"1","article-title":"Mining of social networks from classic books and visualization","volume":"16","year":"2018","journal-title":"Journal of Digital Information Management"},{"issue":"6","key":"key2023031608343308600_ref029","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: a survey","volume":"390","year":"2011","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"key2023031608343308600_ref030","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liu, Z., Xie, S. and Li, X. (2019), \u201cTime Optimal Profit Maximization in a Social Network\u201d, in Shao, J., Yiu, M., Toyoda, M., Zhang, D., Wang, W., Cui, B. (Eds.) Web and Big Data. APWeb-WAIM 2019. Lecture Notes in Computer Science, Vol. 11641. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-26072-9_19","DOI":"10.1007\/978-3-030-26072-9_19"},{"issue":"4","key":"key2023031608343308600_ref031","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait?","volume":"54","year":"2003","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"key2023031608343308600_ref032","first-page":"1","article-title":"Playing the role of weak clique property in link prediction: a friend recommendation model","volume":"6","year":"2016","journal-title":"Scientific Reports"},{"key":"key2023031608343308600_ref033","first-page":"1","article-title":"Learning to discover social circles in ego networks","year":"2012","journal-title":"Neural Information Processing Systems"},{"issue":"4","key":"key2023031608343308600_ref034","doi-asserted-by":"crossref","first-page":"672","DOI":"10.3390\/make2040036","article-title":"Review on learning and extracting graph features for link prediction","volume":"2","year":"2020","journal-title":"Machine Learning and Knowledge Extraction"},{"key":"key2023031608343308600_ref035","doi-asserted-by":"crossref","first-page":"120978","DOI":"10.1016\/j.physa.2019.04.214","article-title":"Link prediction in multiplex networks based on interlayer similarity","volume":"536","year":"2019","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"key2023031608343308600_ref036","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s13278-020-00671-6","article-title":"Neighborhood and PageRank methods for pairwise link prediction","volume":"10","year":"2020","journal-title":"Social Network Analysis and Mining"},{"issue":"3","key":"key2023031608343308600_ref037","first-page":"1","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","year":"2006","journal-title":"Physical Review E \u2013 Statistical, Nonlinear, and Soft Matter Physics"},{"issue":"5","key":"key2023031608343308600_ref038","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1109\/TCSS.2021.3076469","article-title":"On followers search","volume":"8","year":"2021","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"key2023031608343308600_ref039","first-page":"1","article-title":"Graph kernels: a survey","volume":"72","year":"2021","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"9","key":"key2023031608343308600_ref040","doi-asserted-by":"crossref","first-page":"2119","DOI":"10.1016\/j.jss.2012.04.019","article-title":"Fast and accurate link prediction in social networking systems","volume":"85","year":"2012","journal-title":"Journal of Systems and Software"},{"first-page":"1","article-title":"Link prediction by correlation on social network","year":"2018","key":"key2023031608343308600_ref041"},{"issue":"5586","key":"key2023031608343308600_ref042","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","article-title":"Hierarchical organization of modularity in metabolic networks","volume":"297","year":"2002","journal-title":"Science"},{"issue":"3","key":"key2023031608343308600_ref043","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","year":"1995","journal-title":"Machine Learning"},{"issue":"3","key":"key2023031608343308600_ref044","first-page":"1","article-title":"Evolution of protein\u2013protein interaction networks in yeast","volume":"12","year":"2017","journal-title":"PLoS One"},{"issue":"1","key":"key2023031608343308600_ref045","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1177\/0973258620974186","article-title":"Shabaz\u2013Urvashi Link Prediction (SULP): a novel approach to predict future friends in a social network","volume":"16","year":"2021","journal-title":"Journal of Creative Communications"},{"journal-title":"Journal of Machine Learning Research","article-title":"Efficient graphlet kernels for large graph comparison","year":"2009","key":"key2023031608343308600_ref046"},{"first-page":"322","article-title":"Scalable proximity estimation and link prediction in online social networks","year":"2009","key":"key2023031608343308600_ref047"},{"issue":"4","key":"key2023031608343308600_ref048","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s11280-013-0228-2","article-title":"Transitive node similarity: predicting and recommending links in signed social networks","volume":"17","year":"2014","journal-title":"World Wide Web"},{"volume-title":"Hybrid Approach for Predicting and Recommending Links in Social Networks, Advances in Intelligent Systems and Computing","year":"2019","key":"key2023031608343308600_ref049","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-1135-2_9"},{"key":"key2023031608343308600_ref050","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1186\/s40537-021-00422-0","article-title":"A hybrid recommender system based-on link prediction for movie baskets analysis","volume":"8","year":"2021","journal-title":"Journal of Big Data"},{"issue":"2","key":"key2023031608343308600_ref051","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1504\/IJTG.2005.007050","article-title":"Mapping the network of global science: comparing international co-authorships from 1990 to 2000","volume":"1","year":"2005","journal-title":"International Journal of Technology and Globalisation"},{"issue":"1","key":"key2023031608343308600_ref052","doi-asserted-by":"crossref","first-page":"7147","DOI":"10.1038\/s41598-017-07315-4","article-title":"Link prediction in evolving networks based on popularity of nodes","volume":"7","year":"2017","journal-title":"Scientific Reports"},{"issue":"1","key":"key2023031608343308600_ref053","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1504\/IJWBC.2020.105119","article-title":"Hybrid feature-based approach for recommending friends in social networking systems","volume":"16","year":"2020","journal-title":"International Journal of Web Based Communities"},{"key":"key2023031608343308600_ref054","doi-asserted-by":"crossref","first-page":"38208","DOI":"10.1038\/srep38208","article-title":"Predicting missing links in complex networks based on common neighbors and distance","volume":"6","year":"2016","journal-title":"Scientific Reports"},{"issue":"4","key":"key2023031608343308600_ref055","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","year":"1977","journal-title":"Journal of Anthropological Research"},{"key":"key2023031608343308600_ref056","doi-asserted-by":"publisher","first-page":"20137","DOI":"10.1038\/s41598-020-76799-4","article-title":"Similarity-based link prediction in social networks using latent relationships between the users","volume":"10","year":"2020","journal-title":"Scientific Reports"},{"issue":"1","key":"key2023031608343308600_ref057","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s11192-018-2867-7","article-title":"h-Index-based link prediction methods in citation network","volume":"117","year":"2018","journal-title":"Scientometrics"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-02-2022-0072\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-02-2022-0072\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:14:58Z","timestamp":1753398898000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/57\/1\/131-153\/26208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":57,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,7,9]]},"published-print":{"date-parts":[[2023,3,17]]}},"alternative-id":["10.1108\/DTA-02-2022-0072"],"URL":"https:\/\/doi.org\/10.1108\/dta-02-2022-0072","relation":{},"ISSN":["2514-9288","2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"},{"type":"electronic","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2022,7,9]]}}}