Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/80762
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorXu, LC-
dc.creatorWei, XK-
dc.creatorCao, JN-
dc.creatorYu, PS-
dc.date.accessioned2019-05-28T01:09:11Z-
dc.date.available2019-05-28T01:09:11Z-
dc.identifier.isbn978-1-4503-5639-8-
dc.identifier.urihttp://hdl.handle.net/10397/80762-
dc.language.isoenen_US
dc.publisherInternational World Wide Web Conferences Steering Committee Republic and Canton of Geneva, Switzerland �2018en_US
dc.rightsThis paper is published under the Creative Commons Attribution 4.0 International(CC BY 4.0) license. Authors reserve their rights to disseminate the work on theirpersonal and corporate Web sites with the appropriate attribution.en_US
dc.rightsWWW 2018, April 23–27, 2018, Lyon, Franceen_US
dc.rights©2018 IW3C2 (International World Wide Web Conference Committee), publishedunder Creative Commons CC BY 4.0 License.en_US
dc.rightsThe following publication Xu, L. C., Wei, X. K., Cao, J. N., & Yu, P. S. (2018, April). On exploring semantic meanings of links for embedding social networks. In Proceedings of the 2018 World Wide Web Conference on World Wide Web (pp. 479-488). International World Wide Web Conferences Steering Committee is available at https://dx.doi.org/10.1145/3178876.3186114en_US
dc.subjectNetwork embeddingen_US
dc.subjectSocial networksen_US
dc.subjectData miningen_US
dc.titleOn exploring semantic meanings of links for embedding social networksen_US
dc.typeConference Paperen_US
dc.identifier.spage479-
dc.identifier.epage488-
dc.identifier.doi10.1145/3178876.3186114-
dcterms.abstractThere are increasing interests in learning low-dimensional and dense node representations from the network structure which is usually high-dimensional and sparse. However, most existing methods fail to consider semantic meanings of links. Different links may have different semantic meanings because the similarities between two nodes can be different, e.g., two nodes share common neighbors and two nodes share similar interests which are demonstrated in node-generated content. In this paper, the former type of links are referred to as structure-close links while the latter type are referred to as content-close links. These two types of links naturally indicate there are two types of characteristics that nodes expose in a social network. Hence, we propose to learn two representations for each node, and render each representation responsible for encoding the corresponding type of node characteristics, which is achieved by jointly embedding the network structure and inferring the type of each link. In the experiments, the proposed method is demonstrated to be more effective than five recent methods on four social networks through applications including visualization, link prediction and multi-label classification.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationProceedings of the 2018 World Wide Web Conference on World Wide Web, 2018, Lyon, France, , Apr 23-27, 2018, p. 479-488-
dcterms.issued2018-
dc.identifier.isiWOS:000460379000047-
dc.relation.conferenceInternational Conference on World Wide Web Companion [WWW]-
dc.description.validate201905 bcrc-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Xu_Semantic_Exploring_Meanings.pdf1.86 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

133
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

127
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

25
Citations as of Apr 26, 2024

WEB OF SCIENCETM
Citations

22
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.