Web: http://arxiv.org/abs/2205.01358

May 4, 2022, 1:11 a.m. | Amitoz Azad

cs.LG updates on arXiv.org arxiv.org

Node classification on graphs can be formulated as the Dirichlet problem on
graphs where the signal is given at the labeled nodes, and the harmonic
extension is done on the unlabeled nodes. This paper considers a time-dependent
version of the Dirichlet problem on graphs and shows how to improve its
solution by learning the proper initialization vector on the unlabeled nodes.
Further, we show that the improved solution is at par with state-of-the-art
methods used for node classification. Finally, we …

arxiv extension learning time

More from arxiv.org / cs.LG updates on arXiv.org

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC

Senior Data Science Writer

@ NannyML | Remote

Director of AI/ML Engineering

@ Armis Industries | Remote (US only), St. Louis, California

Digital Analytics Manager

@ Patagonia | Ventura, California