Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/105692
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWei, X-
dc.creatorXu, L-
dc.creatorCao, B-
dc.creatorYu, PS-
dc.date.accessioned2024-04-15T07:35:56Z-
dc.date.available2024-04-15T07:35:56Z-
dc.identifier.isbn978-1-4503-4913-0-
dc.identifier.urihttp://hdl.handle.net/10397/105692-
dc.language.isoenen_US
dc.publisherInternational World Wide Web Conferences Steering Committeeen_US
dc.rights©2017 International World Wide Web Conference Committee (IW3C2), published under Creative Commons CC BY 4.0 License (https://creativecommons.org/licenses/by/4.0/).en_US
dc.rightsThe following publication Xiaokai Wei, Linchuan Xu, Bokai Cao, and Philip S. Yu. 2017. Cross View Link Prediction by Learning Noise-resilient Representation Consensus. In Proceedings of the 26th International Conference on World Wide Web (WWW '17). International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, 1611–1619 is available at https://doi.org/10.1145/3038912.3052575.en_US
dc.titleCross view link prediction by learning noise-resilient representation consensusen_US
dc.typeConference Paperen_US
dc.identifier.spage1611-
dc.identifier.epage1619-
dc.identifier.doi10.1145/3038912.3052575-
dcterms.abstractLink Prediction has been an important task for social and information networks. Existing approaches usually assume the completeness of network structure. However, in many real-world networks, the links and node attributes can usually be partially observable. In this paper, we study the problem of Cross View Link Prediction (CVLP) on partially observable networks, where the focus is to recommend nodes with only links to nodes with only attributes (or vice versa). We aim to bridge the information gap by learning a robust consensus for link-based and attribute-based representations so that nodes become comparable in the latent space. Also, the link-based and attribute-based representations can lend strength to each other via this consensus learning. Moreover, attribute selection is performed jointly with the representation learning to alleviate the effect of noisy high-dimensional attributes. We present two instantiations of this framework with different loss functions and develop an alternating optimization framework to solve the problem. Experimental results on four real-world datasets show the proposed algorithm outperforms the baseline methods significantly for cross-view link prediction.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationWWW '17 : proceedings of the 26th International Conference on World Wide Web : May 3-7, 2017, Perth, Australia, p. 1611-1619-
dcterms.issued2017-
dc.identifier.scopus2-s2.0-85046890890-
dc.relation.conferenceInternational Conference on World Wide Web [WWW]-
dc.description.validate202402 bcch-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberCOMP-1375en_US
dc.description.fundingSourceSelf-fundeden_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS49760241en_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
3038912.3052575.pdf1.33 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

17
Citations as of May 12, 2024

Downloads

8
Citations as of May 12, 2024

SCOPUSTM   
Citations

65
Citations as of May 17, 2024

Google ScholarTM

Check

Altmetric


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