As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Node classification in graphs, particularly those exhibiting heterophily, poses significant challenges for traditional methodologies. These include various graph neural network variants and approaches that simplify graph convolutions. This paper proposes a novel approach called nCASH, which combines an innovative label propagation method that utilizes features to compute soft labels and node homophily scores. It also incorporates multi-filter spectral convolutions and a redefined Laplacian matrix tailored for heterophilic graphs. nCASH allows for different types of feature transformations; each region of the graph is characterized by its homophily scores, which dictate the type of filter applied. Low-pass filters are used in homophilous regions, and high-pass filters in heterophilous regions to accentuate differences. nCASH, free from extensive training requirements, relies on sparse matrix multiplications. This enhances scalability and efficiency. Empirical results demonstrate the effectiveness of this approach, showing improvements in classification accuracy on several state-of-the-art heterophilic datasets.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.