<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="4.4.2" xmlns="http://www.crossref.org/schema/4.4.2" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xsi:schemaLocation="http://www.crossref.org/schema/4.4.2 http://www.crossref.org/schema/deposit/crossref4.4.2.xsd">
<head>
<doi_batch_id>1e416013186c20a17cb4d7f</doi_batch_id>
<timestamp>20230720025344031</timestamp>
<depositor>
  <depositor_name>beie:beie</depositor_name> 
  <email_address>director@blueeyesintelligence.org</email_address>
</depositor>
<registrant>WEB-FORM</registrant> 
</head>
<body>
<journal>
<journal_metadata>   <full_title>International Journal of Recent Technology and Engineering (IJRTE)</full_title>   <abbrev_title>IJRTE</abbrev_title>   <issn media_type='electronic'>22773878</issn>   <doi_data>     <doi>10.35940/ijrte.2277-3878</doi>     <resource>https://www.ijrte.org/</resource>   </doi_data> </journal_metadata> <journal_issue>  <publication_date media_type='online'>     <month>07</month>     <day>30</day>     <year>2023</year>   </publication_date>   <journal_volume>     <volume>12</volume>   </journal_volume>   <issue>2</issue> </journal_issue><!-- ============== --> <journal_article publication_type='full_text'>   <titles>     <title>Link Prediction in Social Networks using Vertex Entropy</title>   </titles>   <contributors>      <organization sequence='first' contributor_role='author'>Department of Computer Science and Engineering, NIT Hamirpur, Hamirpur, (Himachal Pradesh), India.</organization>    <person_name sequence='first' contributor_role='author'>      <surname>Shubham</surname>      <ORCID>https://orcid.org/0009-0009-0021-3579</ORCID>    </person_name>    <person_name sequence='additional' contributor_role='author'>       <given_name>Dr. Rajeev</given_name>       <surname>Kumar</surname>       <ORCID>https://orcid.org/0000-0001-6134-5369</ORCID>     </person_name>     <organization sequence='additional' contributor_role='author'>Department of Computer Science and Engineering, NIT Hamirpur, Hamirpur, (Himachal Pradesh), India.</organization>     <person_name sequence='additional' contributor_role='author'>       <given_name>Dr. Naveen</given_name>       <surname>Chauhan</surname>       <ORCID>https://orcid.org/0000-0001-9347-9345</ORCID>     </person_name>     <organization sequence='additional' contributor_role='author'>Department of Computer Science and Engineering, NIT Hamirpur, Hamirpur, (Himachal Pradesh), India.</organization>   </contributors>    <jats:abstract xml:lang='en'>         <jats:p>Many link prediction methods have been put out and tested on several actual networks. The weights of linkages are rarely considered in these studies. Taking both the network's structure and link weight into account is required for link prediction. Previous researchers mostly overlooked the topological structure data in favour of the naturally occurring link weight. With the use of the concept of entropy, a new link prediction algorithm has been put forth in this paper.When used in real-time social networks, this algorithm outperforms the industry standard techniques. This paper concentrated on both topological structural information which focuses on calculating the vertex entropy of each very vertex and link weight in the proposed method. Both weighted and unweighted networks can benefit from the proposed method. Unipartite and bipartite networks can also use the suggested methods. Further, results demonstrate that the proposed method performs better than competing or traditional strategies, particularly when targeted social networks are sufficiently dense.</jats:p>     </jats:abstract>  <publication_date media_type='online'>     <month>07</month>     <day>30</day>     <year>2023</year>   </publication_date>   <pages>     <first_page>102</first_page>     <last_page>108</last_page>   </pages>   <crossmark>     <crossmark_version>CC BY-NC-ND 4.0</crossmark_version>     <crossmark_policy>10.35940/BEIESP.CrossMarkPolicy</crossmark_policy>     <crossmark_domains>       <crossmark_domain>          <domain>www.ijrte.org</domain>       </crossmark_domain>     </crossmark_domains>     <crossmark_domain_exclusive>true</crossmark_domain_exclusive>     <custom_metadata>       <assertion explanation='Journal Name' group_label='Journal Name' group_name='Journal' name='Declaration' order='0'>International Journal of Recent Technology and Engineering (IJRTE)</assertion>       <assertion explanation='Funding' group_label='Funding' group_name='Funding' name='Declaration' order='1'>No, I did not receive.</assertion>       <assertion explanation='Conflicts of Interest' group_label='Conflicts of Interest' group_name='Conflicts-of-Interest' name='Declaration' order='2'>No conflicts of interest to the best of our knowledge.</assertion>       <assertion explanation='Ethical Approval and Consent to Participate' group_label='Ethical Approval and Consent to Participate' group_name='Ethical-Approval-and-Consent-to-Participate' name='Declaration' order='3'>No, the article does not require ethical approval and consent to participate with evidence.</assertion>       <assertion explanation='Availability of Data and Material' group_label='Availability of Data and Material' group_name='Availability-of-Data-and-Material' name='Declaration' order='4'>No, it does not relevant to Availability of Data and Material.</assertion>       <assertion explanation='Authors Contributions' group_label='Authors Contributions' group_name='Authors-Contributions' name='Declaration' order='5'>All authors have equal participation in this article.</assertion>     </custom_metadata>   </crossmark>   <doi_data>     <doi>10.35940/ijrte.A7593.0712223</doi>     <resource>https://www.ijrte.org/portfolio-item/A75930512123/</resource>   </doi_data> </journal_article>
</journal>
</body>
</doi_batch>
