{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:31:14Z","timestamp":1743136274068,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":43,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722525"},{"type":"electronic","value":"9789819722532"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-97-2253-2_31","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T10:02:11Z","timestamp":1713952931000},"page":"390-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Alleviating Over-Smoothing via\u00a0Aggregation over\u00a0Compact Manifolds"],"prefix":"10.1007","author":[{"given":"Dongzhuoran","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgeny","family":"Kharlamov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"31_CR1","unstructured":"Bachmann, G., B\u00e9cigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: ICML, pp. 486\u2013496. PMLR (2020)"},{"key":"31_CR2","unstructured":"Balazevic, I., Allen, C., Hospedales, T.M.: Multi-relational poincar\u00e9 graph embeddings. In: NeurIPS, pp. 4465\u20134475 (2019)"},{"key":"31_CR3","unstructured":"Cai, C., Wang, Y.: A note on over-smoothing for graph neural networks. CoRR abs\/ arXiv: 2006.13318 (2020)"},{"key":"31_CR4","unstructured":"Chami, I., et al: Hyperbolic graph convolutional neural networks. In: NeurIPS, pp. 4869\u20134880 (2019)"},{"key":"31_CR5","unstructured":"Chen, D., Lin, Y., et al.: Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. CoRR abs\/ arXiv: 1909.03211 (2019)"},{"key":"31_CR6","unstructured":"Chen, M., Wei, Z., Huang, Z., Ding, B., Li, Y.: Simple and deep graph convolutional networks. In: ICML, pp. 1725\u20131735. PMLR (2020)"},{"key":"31_CR7","unstructured":"Chien, E., Peng, J., Li, P., Milenkovic, O.: Adaptive universal generalized pagerank graph neural network. In: ICLR (2021)"},{"key":"31_CR8","unstructured":"Ganea, O., B\u00e9cigneul, G., Hofmann, T.: Hyperbolic neural networks. In: NeurIPS, pp. 5350\u20135360 (2018)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Gao, H., Wang, Z., Ji, S.: Large-scale learnable graph convolutional networks. In: KDD, pp. 1416\u20131424. ACM (2018)","DOI":"10.1145\/3219819.3219947"},{"key":"31_CR10","unstructured":"Glorot, X., Bengio, Y.: Understanding the difficulty of training deep feedforward neural networks. In: AISTATS, pp. 249\u2013256 (2010)"},{"key":"31_CR11","unstructured":"G\u00fcl\u00e7ehre, \u00c7., et al.: Hyperbolic attention networks. In: ICLR (2019)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Hamilton, W.L.: Graph Representation Learning. Synthesis Lect. Artifi. Intell. Mach. Learn. (2020)","DOI":"10.1007\/978-3-031-01588-5"},{"key":"31_CR13","unstructured":"Hamilton, W.L., et al.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034 (2017)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"He, K., et al.: Deep residual learning for image recognition. In: CVPR, pp. 770\u2013778. IEEE Computer Society (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"31_CR15","unstructured":"Hou, Y., Zhang, J., et al.: Measuring and improving the use of graph information in graph neural networks. In: ICLR (2020)"},{"key":"31_CR16","unstructured":"Huang, W., et al.: Tackling over-smoothing for general graph convolutional networks. CoRR (2020)"},{"key":"31_CR17","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: ICML, pp. 448\u2013456 (2015)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Jin, W., Et al.: Feature overcorrelation in deep graph neural networks: a new perspective. In: KDD, pp. 709\u2013719. ACM (2022)","DOI":"10.1145\/3534678.3539445"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Khrulkov, V., Et al.: Hyperbolic image embeddings. In: CVPR, pp. 6417\u20136427. Computer Vision Foundation\/IEEE (2020)","DOI":"10.1109\/CVPR42600.2020.00645"},{"key":"31_CR20","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: ICLR (2015)"},{"key":"31_CR21","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. CoRR abs\/ arxiv: 1609.02907 (2016)"},{"key":"31_CR22","unstructured":"Klicpera, J., Et al.: Predict then propagate: graph neural networks meet personalized pagerank. In: ICLR (2019)"},{"key":"31_CR23","unstructured":". Klicpera, J., et al.: Predict then propagate: graph neural networks meet personalized pagerank. In: ICLR (2019)"},{"key":"31_CR24","unstructured":"Lee, J.: Introduction to Smooth Manifolds. Graduate Texts in Mathematics"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Li, G., M\u00fcller, M., et al.: Deepgcns: can gcns go as deep as cnns? In: ICCV, pp. 9266\u20139275. IEEE (2019)","DOI":"10.1109\/ICCV.2019.00936"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Li, Q., Han, Z., Wu, X.M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: AAAI, pp. 3538\u20133545 (2018)","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Liu, M., Gao, H., Ji, S.: Towards deeper graph neural networks. In: KDD, pp. 338\u2013348. ACM (2020)","DOI":"10.1145\/3394486.3403076"},{"key":"31_CR28","unstructured":"Mendelson, B.: Introduction to topology (1990)"},{"key":"31_CR29","unstructured":"Oono, K., Suzuki, T.: Graph neural networks exponentially lose expressive power for node classification. In: ICLR (2020)"},{"key":"31_CR30","unstructured":"Pei, H., et al.: Geom-gcn: Geometric graph convolutional networks. In: ICLR (2020)"},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Rashid, A.M., Karypis, G., et al.: Learning preferences of new users in recommender systems: an information theoretic approach. SIGKDD Explor., 90\u2013100 (2008)","DOI":"10.1145\/1540276.1540302"},{"key":"31_CR32","unstructured":"Rong, Y., Huang, W., Xu, T., Huang, J.: Dropedge: towards deep graph convolutional networks on node classification. In: ICLR (2020)"},{"key":"31_CR33","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. CoRR abs\/ arXiv: 1811.05868 (2018)"},{"issue":"1","key":"31_CR34","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., et al.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR35","doi-asserted-by":"crossref","unstructured":"Ungar, A.A.: Barycentric calculus in Euclidean and hyperbolic geometry: a comparative introduction (2010)","DOI":"10.1142\/9789814304948"},{"key":"31_CR36","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. CoRR abs\/ arXiv: 1710.10903 (2017)"},{"key":"31_CR37","unstructured":"Wu, F., et al.: Simplifying graph convolutional networks. In: ICML, vol.\u00a097, pp. 6861\u20136871. PMLR (2019)"},{"key":"31_CR38","unstructured":"Xu, K., Hu, W., et al.: How powerful are graph neural networks? In: ICLR (2019)"},{"key":"31_CR39","unstructured":"Xu, K., Li, C., Tian, Y., et al.: Representation learning on graphs with jumping knowledge networks. In: ICML, pp. 5449\u20135458. PMLR (2018)"},{"key":"31_CR40","unstructured":"Yang, Z., et al.: Revisiting semi-supervised learning with graph embeddings. In: ICML. JMLR Workshop and Conference Proceedings, vol.\u00a048, pp. 40\u201348 (2016)"},{"key":"31_CR41","unstructured":"Zhao, L., Akoglu, L.: Pairnorm: tackling oversmoothing in gnns. In: ICLR (2020)"},{"key":"31_CR42","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou, J., Cui, G., et al.: Graph neural networks: a review of methods and applications. AI Open 1, 57\u201381 (2020)","journal-title":"AI Open"},{"key":"31_CR43","unstructured":"Zhou, K., et al.: Towards deeper graph neural networks with differentiable group normalization. In: NeurIPS (2020)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2253-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T23:14:52Z","timestamp":1714000492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2253-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722525","9789819722532"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2253-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}