{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:08:40Z","timestamp":1743113320347,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398209"},{"type":"electronic","value":"9783031398216"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39821-6_18","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"219-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Embedding Framework for\u00a0Uncertain Attribute Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4925-2033","authenticated-orcid":false,"given":"Ting","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6386-1906","authenticated-orcid":false,"given":"Ting","family":"Yu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8781-967X","authenticated-orcid":false,"given":"Xueting","family":"Qiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7167-6970","authenticated-orcid":false,"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-022-01681-w","volume":"64","author":"S Banerjee","year":"2022","unstructured":"Banerjee, S.: A survey on mining and analysis of uncertain graphs. Knowl. Inf. Syst. 64, 1\u201337 (2022)","journal-title":"Knowl. Inf. Syst."},{"key":"18_CR2","unstructured":"Bojchevski, A., G\u00fcnnemann, S.: Deep gaussian embedding of graphs: unsupervised inductive learning via ranking. In: ICLR (2018)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Bonchi, F., Gionis, A., Tassa, T.: Injecting uncertainty in graphs for identity obfuscation. arXiv preprint arXiv:1208.4145 (2012)","DOI":"10.14778\/2350229.2350254"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Dallachiesa, M., Aggarwal, C., Palpanas, T.: Node classification in uncertain graphs. In: SSDBM (2014)","DOI":"10.1145\/2618243.2618277"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.108066","volume":"101","author":"M Danesh","year":"2022","unstructured":"Danesh, M., Dorrigiv, M., Yaghmaee, F.: DGCU: a new deep directed method based on gaussian embedding for clustering uncertain graphs. Comput. Electr. Eng. 101, 108066 (2022)","journal-title":"Comput. Electr. Eng."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: SIGKDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2015.04.043","volume":"317","author":"Z Halim","year":"2015","unstructured":"Halim, Z., Waqas, M., Hussain, S.F.: Clustering large probabilistic graphs using multi-population evolutionary algorithm. Inf. Sci. 317, 78\u201395 (2015)","journal-title":"Inf. Sci."},{"key":"18_CR8","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-030-39469-1_11","volume-title":"Databases Theory and Applications","author":"B Hettige","year":"2020","unstructured":"Hettige, B., Li, Y.-F., Wang, W., Buntine, W.: Gaussian embedding of large-scale attributed graphs. In: Borovica-Gajic, R., Qi, J., Wang, W. (eds.) ADC 2020. LNCS, vol. 12008, pp. 134\u2013146. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39469-1_11"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hong, E.L., et al.: Gene ontology annotations at SGD: new data sources and annotation methods. Nucleic Acids Res. 36(suppl_1), D577\u2013D581 (2007)","DOI":"10.1093\/nar\/gkm909"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hu, J., Cheng, R., Huang, Z., Fang, Y., Luo, S.: On embedding uncertain graphs. In: CIKM, pp. 157\u2013166 (2017)","DOI":"10.1145\/3132847.3132885"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ins.2021.03.057","volume":"568","author":"SF Hussain","year":"2021","unstructured":"Hussain, S.F., Maab, I.: Clustering probabilistic graphs using neighbourhood paths. Inf. Sci. 568, 216\u2013238 (2021)","journal-title":"Inf. Sci."},{"key":"18_CR13","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)"},{"issue":"2","key":"18_CR14","first-page":"325","volume":"25","author":"G Kollios","year":"2011","unstructured":"Kollios, G., Potamias, M., Terzi, E.: Clustering large probabilistic graphs. TKDE 25(2), 325\u2013336 (2011)","journal-title":"TKDE"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","volume":"607","author":"S Kumar","year":"2022","unstructured":"Kumar, S., Mallik, A., Khetarpal, A., Panda, B.: Influence maximization in social networks using graph embedding and graph neural network. Inf. Sci. 607, 1617\u20131636 (2022)","journal-title":"Inf. Sci."},{"issue":"2605","key":"18_CR16","first-page":"2579","volume":"9","author":"VDM Laurens","year":"2008","unstructured":"Laurens, V.D.M., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(2605), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Liang, Y., Hu, T., Zhao, P.: Efficient structural clustering in large uncertain graphs. In: ICDE, pp. 1966\u20131969 (2020)","DOI":"10.1109\/ICDE48307.2020.00215"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.comcom.2021.06.002","volume":"176","author":"H Liu","year":"2021","unstructured":"Liu, H., Zhang, X., Zhang, X., Li, Q., Wu, X.M.: RPC: representative possible world based consistent clustering algorithm for uncertain data. Comput. Commun. 176, 128\u2013137 (2021)","journal-title":"Comput. Commun."},{"key":"18_CR19","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS, pp. 3111\u20133119 (2013)"},{"issue":"5","key":"18_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1038\/nmeth.1938","volume":"9","author":"T Nepusz","year":"2012","unstructured":"Nepusz, T., Yu, H., Paccanaro, A.: Detecting overlapping protein complexes in protein-protein interaction networks. Nat. Methods 9(5), 471\u2013472 (2012)","journal-title":"Nat. Methods"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ins.2021.07.007","volume":"578","author":"H Peng","year":"2021","unstructured":"Peng, H., et al.: Dynamic graph convolutional network for long-term traffic flow prediction with reinforcement learning. Inf. Sci. 578, 401\u2013416 (2021)","journal-title":"Inf. Sci."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: SIGKDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"issue":"1\u20132","key":"18_CR23","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. Proc. VLDB Endowment 3(1\u20132), 997\u20131008 (2010)","journal-title":"Proc. VLDB Endowment"},{"issue":"10","key":"18_CR24","first-page":"1954","volume":"31","author":"YX Qiu","year":"2019","unstructured":"Qiu, Y.X., et al.: Efficient structural clustering on probabilistic graphs. TKDE 31(10), 1954\u20131968 (2019)","journal-title":"TKDE"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Sun, G., Zhang, X.: A novel framework for node\/edge attributed graph embedding. In: Advances in Knowledge Discovery and Data Mining, pp. 169\u2013182 (2019)","DOI":"10.1007\/978-3-030-16142-2_14"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: WWW (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"18_CR27","unstructured":"Vilnis, L., McCallum, A.: Word representations via gaussian embedding. arXiv preprint arXiv:1412.6623 (2014)"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: SIGKDD, pp. 1225\u20131234 (2016)","DOI":"10.1145\/2939672.2939753"},{"key":"18_CR29","unstructured":"Wang, X., Bo, D., Shi, C., Fan, S., Ye, Y., Yu, P.S.: A survey on heterogeneous graph embedding: methods, techniques, applications and sources. IEEE Trans. Big Data 1\u20131 (2022)"},{"issue":"4","key":"18_CR30","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/20M1386062","volume":"63","author":"M Xu","year":"2021","unstructured":"Xu, M.: Understanding graph embedding methods and their applications. SIAM Rev. 63(4), 825\u2013853 (2021)","journal-title":"SIAM Rev."},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00778-018-0536-3","volume":"28","author":"W Yu","year":"2019","unstructured":"Yu, W., Lin, X., Zhang, W., Pei, J., McCann, J.: Simrank*: effective and scalable pairwise similarity search based on graph topology. VLDB J. 28, 401\u2013426 (2019)","journal-title":"VLDB J."},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Zhu, D., Cui, P., Wang, D., Zhu, W.: Deep variational network embedding in Wasserstein space. In: SIGKDD, pp. 2827\u20132836 (2018)","DOI":"10.1145\/3219819.3220052"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39821-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:47:13Z","timestamp":1710269233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39821-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398209","9783031398216"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39821-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}