{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:36:39Z","timestamp":1743132999271,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981250"},{"type":"electronic","value":"9789819981267"}],"license":[{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8126-7_12","type":"book-chapter","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T08:05:19Z","timestamp":1700813119000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Multi-dimensional Feature Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8406-6246","authenticated-orcid":false,"given":"Minghong","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5529-7698","authenticated-orcid":false,"given":"Haizheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2824-2338","authenticated-orcid":false,"given":"Hong","family":"Bian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bai, L., Yao, L., Kanhere, S.S., Wang, X., Liu, W., Yang, Z.: Spatio-temporal graph convolutional and recurrent networks for citywide passenger demand prediction. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 2293\u20132296 (2019)","DOI":"10.1145\/3357384.3358097"},{"key":"12_CR2","unstructured":"Bruna, J., Zaremba, W., Szlam, A., LeCun, Y.: Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 (2013)"},{"key":"12_CR3","unstructured":"Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems 29 (2016)"},{"key":"12_CR4","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: International Conference on Machine Learning, pp. 1263\u20131272. PMLR (2017)"},{"key":"12_CR5","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017)"},{"key":"12_CR6","unstructured":"Jin, W., Derr, T., Liu, H., Wang, Y., Wang, S., Liu, Z., Tang, J.: Self-supervised learning on graphs: Deep insights and new direction. arXiv preprint arXiv:2006.10141 (2020)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Jin, W., Derr, T., Wang, Y., Ma, Y., Liu, Z., Tang, J.: Node similarity preserving graph convolutional networks. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pp. 148\u2013156 (2021)","DOI":"10.1145\/3437963.3441735"},{"key":"12_CR8","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Li, Q., Han, Z., Wu, X.M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Li, Y., Jin, W., Xu, H., Tang, J.: Deeprobust: a platform for adversarial attacks and defenses. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 16078\u201316080 (2021)","DOI":"10.1609\/aaai.v35i18.18017"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Liu, M., Gao, H., Ji, S.: Towards deeper graph neural networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 338\u2013348 (2020)","DOI":"10.1145\/3394486.3403076"},{"issue":"6","key":"12_CR12","first-page":"5879","volume":"35","author":"Y Liu","year":"2022","unstructured":"Liu, Y., et al.: Graph self-supervised learning: a survey. IEEE Trans. Knowl. Data Eng. 35(6), 5879\u20135900 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Ma, Y., Liu, X., Zhao, T., Liu, Y., Tang, J., Shah, N.: A unified view on graph neural networks as graph signal denoising. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 1202\u20131211 (2021)","DOI":"10.1145\/3459637.3482225"},{"key":"12_CR14","unstructured":"Oono, K., Suzuki, T.: Graph neural networks exponentially lose expressive power for node classification. arXiv preprint arXiv:1905.10947 (2019)"},{"key":"12_CR15","unstructured":"Rong, Y., Huang, W., Xu, T., Huang, J.: Dropedge: towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903 (2019)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Networks 20(1), 61\u201380 (2008)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"DI Shuman","year":"2013","unstructured":"Shuman, D.I., Narang, S.K., Frossard, P., Ortega, A., Vandergheynst, P.: The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83\u201398 (2013)","journal-title":"IEEE Signal Process. Mag."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Tang, L., Liu, H.: Scalable learning of collective behavior based on sparse social dimensions. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 1107\u20131116 (2009)","DOI":"10.1145\/1645953.1646094"},{"key":"12_CR19","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"12_CR20","doi-asserted-by":"publisher","DOI":"10.3389\/fmolb.2021.647915","volume":"8","author":"X Wang","year":"2021","unstructured":"Wang, X., Flannery, S.T., Kihara, D.: Protein docking model evaluation by graph neural networks. Front. Mol. Biosci. 8, 647915 (2021)","journal-title":"Front. Mol. Biosci."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., Liu, Z., Fan, Z., Sun, L., Yu, P.S.: Dskreg: differentiable sampling on knowledge graph for recommendation with relational gnn. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 3513\u20133517 (2021)","DOI":"10.1145\/3459637.3482092"},{"key":"12_CR22","unstructured":"Wu, F., Souza, A., Zhang, T., Fifty, C., Yu, T., Weinberger, K.: Simplifying graph convolutional networks. In: International Conference on Machine Learning, pp. 6861\u20136871. PMLR (2019)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Wu, H., Wang, C., Tyshetskiy, Y., Docherty, A., Lu, K., Zhu, L.: Adversarial examples on graph data: Deep insights into attack and defense. arXiv preprint arXiv:1903.01610 (2019)","DOI":"10.24963\/ijcai.2019\/669"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Philip, S.Y.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Networks Learn. Syst. 32(1), 4\u201324 (2020)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"12_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102954","volume":"177","author":"Y Xiao","year":"2021","unstructured":"Xiao, Y., Pei, Q., Xiao, T., Yao, L., Liu, H.: Mutualrec: joint friend and item recommendations with mutualistic attentional graph neural networks. J. Netw. Comput. Appl. 177, 102954 (2021)","journal-title":"J. Netw. Comput. Appl."},{"key":"12_CR26","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)"},{"issue":"1","key":"12_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3233\/AIC-220120","volume":"36","author":"M Yao","year":"2023","unstructured":"Yao, M., Yu, H., Bian, H.: Defending against adversarial attacks on graph neural networks via similarity property. AI Commun. 36(1), 27\u201339 (2023)","journal-title":"AI Commun."},{"key":"12_CR28","unstructured":"You, Y., Chen, T., Wang, Z., Shen, Y.: When does self-supervision help graph convolutional networks? In: International Conference on Machine Learning, pp. 10871\u201310880. PMLR (2020)"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TKDE.2020.2981333","volume":"34","author":"Z Zhang","year":"2020","unstructured":"Zhang, Z., Cui, P., Zhu, W.: Deep learning on graphs: a survey. IEEE Trans. Knowl. Data Eng. 34(1), 249\u2013270 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, D., Zhang, Z., Cui, P., Zhu, W.: Robust graph convolutional networks against adversarial attacks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1399\u20131407 (2019)","DOI":"10.1145\/3292500.3330851"}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8126-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:33:05Z","timestamp":1709811185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8126-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,13]]},"ISBN":["9789819981250","9789819981267"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8126-7_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,13]]},"assertion":[{"value":"13 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1274","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":"650","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":"0","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":"51% - 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":"4.14","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":"2.46","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)"}}]}}