Loading…

A modified DeepWalk method for link prediction in attributed social network

The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the in...

Full description

Saved in:
Bibliographic Details
Published in:Computing 2021-10, Vol.103 (10), p.2227-2249
Main Authors: Berahmand, Kamal, Nasiri, Elahe, Rostami, Mehrdad, Forouzandeh, Saman
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23
cites cdi_FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23
container_end_page 2249
container_issue 10
container_start_page 2227
container_title Computing
container_volume 103
creator Berahmand, Kamal
Nasiri, Elahe
Rostami, Mehrdad
Forouzandeh, Saman
description The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the interesting topics in recent years. Nodes are also accompanied in many real-world systems by various attributes or features, known as attributed networks. One of the newest methods of link prediction is embedding methods to generate the feature vector of each node of the graph and find unknown connections. The DeepWalk algorithm is one of the most popular graph embedding methods that capture the network structure using pure random walking. The present paper seeks to present a modified version of deep walk based on pure random walking for solving link prediction in the attributed network, which will be used for both network structure and node attributes, and the new random walk model for link prediction will be introduced by integrating network structure and node attributes, based on the assumption that two nodes on the network will be linked since they are nearby in the network, or connected for the reason of similar attributes. The results indicate that two nodes are more probable to establish a link in the case of possessing more structure and attribute similarity. In order to justify the proposal, the authors carry out many experiments on six real-world attributed networks for comparison with the state-of-the-art network embedding methods. The experimental results from the graphs indicate that our proposed approach is more capable compared to other link prediction approaches and increases the accuracy of prediction.
doi_str_mv 10.1007/s00607-021-00982-2
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2574929499</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2574929499</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23</originalsourceid><addsrcrecordid>eNp9kEtLxDAURoMoOI7-AVcB19GbR9NmOYxPHHCj6C6kbaKZ6TQ1ySD-e6sV3Lm6m--cCwehUwrnFKC8SAASSgKMEgBVMcL20IwKLkkBRbmPZgAUiKiKl0N0lNIaABiv1AzdL_A2tN552-JLa4dn023w1ua30GIXIu58v8FDtK1vsg899j02OUdf7_JIpNB40-He5o8QN8fowJku2ZPfO0dP11ePy1uyeri5Wy5WpOFUZdI6WzVFUwjBjGBcGgXWCUFbzmvFqHSq5MZKKWs7Apy2SlYg6rIysqlNzfgcnU3eIYb3nU1Zr8Mu9uNLzYpSKKaEUuOKTasmhpSidXqIfmvip6agv6PpKZoeo-mfaPpbzScojeP-1cY_9T_UF1VTbwc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2574929499</pqid></control><display><type>article</type><title>A modified DeepWalk method for link prediction in attributed social network</title><source>Business Source Ultimate【Trial: -2024/12/31】【Remote access available】</source><source>ABI/INFORM global</source><source>Springer Nature</source><creator>Berahmand, Kamal ; Nasiri, Elahe ; Rostami, Mehrdad ; Forouzandeh, Saman</creator><creatorcontrib>Berahmand, Kamal ; Nasiri, Elahe ; Rostami, Mehrdad ; Forouzandeh, Saman</creatorcontrib><description>The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the interesting topics in recent years. Nodes are also accompanied in many real-world systems by various attributes or features, known as attributed networks. One of the newest methods of link prediction is embedding methods to generate the feature vector of each node of the graph and find unknown connections. The DeepWalk algorithm is one of the most popular graph embedding methods that capture the network structure using pure random walking. The present paper seeks to present a modified version of deep walk based on pure random walking for solving link prediction in the attributed network, which will be used for both network structure and node attributes, and the new random walk model for link prediction will be introduced by integrating network structure and node attributes, based on the assumption that two nodes on the network will be linked since they are nearby in the network, or connected for the reason of similar attributes. The results indicate that two nodes are more probable to establish a link in the case of possessing more structure and attribute similarity. In order to justify the proposal, the authors carry out many experiments on six real-world attributed networks for comparison with the state-of-the-art network embedding methods. The experimental results from the graphs indicate that our proposed approach is more capable compared to other link prediction approaches and increases the accuracy of prediction.</description><identifier>ISSN: 0010-485X</identifier><identifier>EISSN: 1436-5057</identifier><identifier>DOI: 10.1007/s00607-021-00982-2</identifier><language>eng</language><publisher>Vienna: Springer Vienna</publisher><subject>Algorithms ; Anthropology ; Artificial Intelligence ; Computer Appl. in Administrative Data Processing ; Computer Communication Networks ; Computer Science ; Embedding ; Information Systems Applications (incl.Internet) ; Network analysis ; Nodes ; Random walk ; Regular Paper ; Social networks ; Software Engineering ; Walking</subject><ispartof>Computing, 2021-10, Vol.103 (10), p.2227-2249</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23</citedby><cites>FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23</cites><orcidid>0000-0003-4459-0703</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2574929499/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2574929499?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363,74895</link.rule.ids></links><search><creatorcontrib>Berahmand, Kamal</creatorcontrib><creatorcontrib>Nasiri, Elahe</creatorcontrib><creatorcontrib>Rostami, Mehrdad</creatorcontrib><creatorcontrib>Forouzandeh, Saman</creatorcontrib><title>A modified DeepWalk method for link prediction in attributed social network</title><title>Computing</title><addtitle>Computing</addtitle><description>The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the interesting topics in recent years. Nodes are also accompanied in many real-world systems by various attributes or features, known as attributed networks. One of the newest methods of link prediction is embedding methods to generate the feature vector of each node of the graph and find unknown connections. The DeepWalk algorithm is one of the most popular graph embedding methods that capture the network structure using pure random walking. The present paper seeks to present a modified version of deep walk based on pure random walking for solving link prediction in the attributed network, which will be used for both network structure and node attributes, and the new random walk model for link prediction will be introduced by integrating network structure and node attributes, based on the assumption that two nodes on the network will be linked since they are nearby in the network, or connected for the reason of similar attributes. The results indicate that two nodes are more probable to establish a link in the case of possessing more structure and attribute similarity. In order to justify the proposal, the authors carry out many experiments on six real-world attributed networks for comparison with the state-of-the-art network embedding methods. The experimental results from the graphs indicate that our proposed approach is more capable compared to other link prediction approaches and increases the accuracy of prediction.</description><subject>Algorithms</subject><subject>Anthropology</subject><subject>Artificial Intelligence</subject><subject>Computer Appl. in Administrative Data Processing</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Embedding</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Network analysis</subject><subject>Nodes</subject><subject>Random walk</subject><subject>Regular Paper</subject><subject>Social networks</subject><subject>Software Engineering</subject><subject>Walking</subject><issn>0010-485X</issn><issn>1436-5057</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp9kEtLxDAURoMoOI7-AVcB19GbR9NmOYxPHHCj6C6kbaKZ6TQ1ySD-e6sV3Lm6m--cCwehUwrnFKC8SAASSgKMEgBVMcL20IwKLkkBRbmPZgAUiKiKl0N0lNIaABiv1AzdL_A2tN552-JLa4dn023w1ua30GIXIu58v8FDtK1vsg899j02OUdf7_JIpNB40-He5o8QN8fowJku2ZPfO0dP11ePy1uyeri5Wy5WpOFUZdI6WzVFUwjBjGBcGgXWCUFbzmvFqHSq5MZKKWs7Apy2SlYg6rIysqlNzfgcnU3eIYb3nU1Zr8Mu9uNLzYpSKKaEUuOKTasmhpSidXqIfmvip6agv6PpKZoeo-mfaPpbzScojeP-1cY_9T_UF1VTbwc</recordid><startdate>20211001</startdate><enddate>20211001</enddate><creator>Berahmand, Kamal</creator><creator>Nasiri, Elahe</creator><creator>Rostami, Mehrdad</creator><creator>Forouzandeh, Saman</creator><general>Springer Vienna</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-4459-0703</orcidid></search><sort><creationdate>20211001</creationdate><title>A modified DeepWalk method for link prediction in attributed social network</title><author>Berahmand, Kamal ; Nasiri, Elahe ; Rostami, Mehrdad ; Forouzandeh, Saman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Anthropology</topic><topic>Artificial Intelligence</topic><topic>Computer Appl. in Administrative Data Processing</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Embedding</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Network analysis</topic><topic>Nodes</topic><topic>Random walk</topic><topic>Regular Paper</topic><topic>Social networks</topic><topic>Software Engineering</topic><topic>Walking</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Berahmand, Kamal</creatorcontrib><creatorcontrib>Nasiri, Elahe</creatorcontrib><creatorcontrib>Rostami, Mehrdad</creatorcontrib><creatorcontrib>Forouzandeh, Saman</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest_ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM global</collection><collection>Computing Database</collection><collection>ProQuest research library</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Berahmand, Kamal</au><au>Nasiri, Elahe</au><au>Rostami, Mehrdad</au><au>Forouzandeh, Saman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A modified DeepWalk method for link prediction in attributed social network</atitle><jtitle>Computing</jtitle><stitle>Computing</stitle><date>2021-10-01</date><risdate>2021</risdate><volume>103</volume><issue>10</issue><spage>2227</spage><epage>2249</epage><pages>2227-2249</pages><issn>0010-485X</issn><eissn>1436-5057</eissn><abstract>The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the interesting topics in recent years. Nodes are also accompanied in many real-world systems by various attributes or features, known as attributed networks. One of the newest methods of link prediction is embedding methods to generate the feature vector of each node of the graph and find unknown connections. The DeepWalk algorithm is one of the most popular graph embedding methods that capture the network structure using pure random walking. The present paper seeks to present a modified version of deep walk based on pure random walking for solving link prediction in the attributed network, which will be used for both network structure and node attributes, and the new random walk model for link prediction will be introduced by integrating network structure and node attributes, based on the assumption that two nodes on the network will be linked since they are nearby in the network, or connected for the reason of similar attributes. The results indicate that two nodes are more probable to establish a link in the case of possessing more structure and attribute similarity. In order to justify the proposal, the authors carry out many experiments on six real-world attributed networks for comparison with the state-of-the-art network embedding methods. The experimental results from the graphs indicate that our proposed approach is more capable compared to other link prediction approaches and increases the accuracy of prediction.</abstract><cop>Vienna</cop><pub>Springer Vienna</pub><doi>10.1007/s00607-021-00982-2</doi><tpages>23</tpages><orcidid>https://orcid.org/0000-0003-4459-0703</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0010-485X
ispartof Computing, 2021-10, Vol.103 (10), p.2227-2249
issn 0010-485X
1436-5057
language eng
recordid cdi_proquest_journals_2574929499
source Business Source Ultimate【Trial: -2024/12/31】【Remote access available】; ABI/INFORM global; Springer Nature
subjects Algorithms
Anthropology
Artificial Intelligence
Computer Appl. in Administrative Data Processing
Computer Communication Networks
Computer Science
Embedding
Information Systems Applications (incl.Internet)
Network analysis
Nodes
Random walk
Regular Paper
Social networks
Software Engineering
Walking
title A modified DeepWalk method for link prediction in attributed social network
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T15%3A36%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20modified%20DeepWalk%20method%20for%20link%20prediction%20in%20attributed%20social%20network&rft.jtitle=Computing&rft.au=Berahmand,%20Kamal&rft.date=2021-10-01&rft.volume=103&rft.issue=10&rft.spage=2227&rft.epage=2249&rft.pages=2227-2249&rft.issn=0010-485X&rft.eissn=1436-5057&rft_id=info:doi/10.1007/s00607-021-00982-2&rft_dat=%3Cproquest_cross%3E2574929499%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c319t-dfe8c5c5442a4236a90ef441d33b9216f973ae666bec3131d96804b78a6cbab23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2574929499&rft_id=info:pmid/&rfr_iscdi=true