← Search

Muhammad Farhan

2 accepted papers

2023

$\mathscr{N}$-WL: A New Hierarchy of Expressivity for Graph Neural Networks

ICLR 2023poster

The expressive power of Graph Neural Networks (GNNs) is fundamental for understanding their capabilities and limitations, i.e., what graph properties can or cannot be learnt by a GNN. Since standard GNNs have been characterised to be upper-bounded by the Weisfeiler-Lehman (1-WL) algorithm, recent a…

Cited by 19SourcePDFScholar
2017

Efficient Approximation Algorithms for Strings Kernel Based Sequence Classification

NeurIPS 2017poster

Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between k-mers (k-length subsequences) in the two sequences. Extending this definition, by considering two k-mer…