{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:36:38Z","timestamp":1768635398152,"version":"3.49.0"},"reference-count":25,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>The objective of an online social network is to amplify the stream of information among the users. This goal can be accomplished by maximizing interconnectivity among users using link prediction techniques. Existing link prediction techniques uses varied heuristics such as similarity score to predict possible connections. Link prediction can be considered a binary classification problem where probable class outcomes are presence and absence of connections. One of the challenges in classification is to decide threshold value. Since the social network is exceptionally dynamic in nature and each user possess different features, it is difficult to choose a static, common threshold which decides whether two non-connected users will form interconnectivity. This article proposes a novel technique, FIXT, that dynamically decides the threshold value for predicting the possibility of new link formation. The article evaluates the performance of FIXT with six baseline techniques. The comparative results depict that FIXT achieves accuracy up to 93% and outperforms baseline techniques.<\/jats:p>","DOI":"10.4018\/ijitwe.2020010102","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T13:29:02Z","timestamp":1572874142000},"page":"17-34","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Method to Dynamically Fix Threshold for Node Neighbourhood Based Link Prediction Techniques"],"prefix":"10.4018","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3932-4267","authenticated-orcid":true,"given":"Anand Kumar","family":"Gupta","sequence":"first","affiliation":[{"name":"Jaypee Institute of Information Technology, India"}]},{"given":"Neetu","family":"Sardana","sequence":"additional","affiliation":[{"name":"Jaypee Institute of Information Technology, India"}]}],"member":"2432","reference":[{"key":"IJITWE.2020010102-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"IJITWE.2020010102-1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_9"},{"key":"IJITWE.2020010102-2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"IJITWE.2020010102-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.06.033"},{"key":"IJITWE.2020010102-4","doi-asserted-by":"publisher","DOI":"10.1109\/IC3.2014.6897172"},{"key":"IJITWE.2020010102-5","doi-asserted-by":"publisher","DOI":"10.1109\/IC3.2015.7346726"},{"key":"IJITWE.2020010102-6","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura.","volume":"37","author":"P.Jaccard","year":"1901","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"IJITWE.2020010102-7","unstructured":"Lee, D. D., & Seung, H. S. (2001). Algorithms for non-negative matrix factorization. In Advances in neural information processing systems (pp. 556-562). Academic Press."},{"key":"IJITWE.2020010102-8","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"IJITWE.2020010102-9","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267833"},{"key":"IJITWE.2020010102-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2015.12.003"},{"issue":"4","key":"IJITWE.2020010102-11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/3012704","article-title":"A survey of link prediction in complex networks.","volume":"49","author":"V.Mart\u00ednez","year":"2017","journal-title":"ACM Computing Surveys"},{"key":"IJITWE.2020010102-12","doi-asserted-by":"publisher","DOI":"10.1145\/2556612"},{"key":"IJITWE.2020010102-13","unstructured":"Molnar, F. (2011) Link Prediction Analysis in the Wikipedia Collaboration Graph. Retrieved from http:\/\/assassin.cs.rpi.edu\/~magdon\/courses\/casp\/projects\/Molnar.pdf"},{"key":"IJITWE.2020010102-14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"IJITWE.2020010102-15","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2012.166"},{"key":"IJITWE.2020010102-16","author":"G.Salton","year":"1989","journal-title":"Automatic text processing: The transformation, analysis, and retrieval of"},{"key":"IJITWE.2020010102-17","unstructured":"Salton, G., & McGill, M. J. (1986). Introduction to modern information retrieval. McGraw-Hill."},{"key":"IJITWE.2020010102-18","volume":"Vol. 39","author":"H.Sch\u00fctze","year":"2008","journal-title":"Introduction to information retrieval"},{"key":"IJITWE.2020010102-19","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":"T.S\u00f8rensen","year":"1948","journal-title":"Biology Skrifter"},{"issue":"1","key":"IJITWE.2020010102-20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-014-5237-y","article-title":"Link prediction in social networks: The state-of-the-art.","volume":"58","author":"P.Wang","year":"2015","journal-title":"Science China. Information Sciences"},{"key":"IJITWE.2020010102-21","unstructured":"Zhang, M., & Chen, Y. (2018). Link Prediction Based on Graph Neural Networks."},{"key":"IJITWE.2020010102-22","unstructured":"Zhou, K., Michalak, T. P., Rahwan, T., Waniek, M., & Vorobeychik, Y. (2018). Adversarial Link Prediction in Social Networks."},{"key":"IJITWE.2020010102-23","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"IJITWE.2020010102-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"}],"container-title":["International Journal of Information Technology and Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=241774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T19:56:26Z","timestamp":1651780586000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJITWE.2020010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":25,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.4018\/ijitwe.2020010102","relation":{},"ISSN":["1554-1045","1554-1053"],"issn-type":[{"value":"1554-1045","type":"print"},{"value":"1554-1053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}