1 code implementation • 1 Nov 2022 • Haris Mansoor, Sarwan Ali, Shafiq Alam, Muhammad Asad Khan, Umair ul Hassan, Imdadullah Khan
In this paper, we analyze the effect on fairness in the context of graph data (node attributes) imputation using different embedding and neural network methods.
no code implementations • 2 Sep 2021 • Zohair Raza Hassan, Sarwan Ali, Imdadullah Khan, Mudassir Shabbir, Waseem Abbas
Operating on edge streams allows us to avoid storing the entire graph in memory, and controlling the sample size enables us to keep the runtime of our algorithms within desired bounds.
no code implementations • 18 Aug 2021 • Sarwan Ali, Tamkanat-E-Ali, Muhammad Asad Khan, Imdadullah Khan, Murray Patterson
Using a $k$-mer based feature vector generation and efficient feature selection methods, our approach is effective in identifying variants, as well as being efficient and scalable to millions of sequences.
no code implementations • 7 Aug 2021 • Sarwan Ali, Bikram Sahoo, Naimat Ullah, Alexander Zelikovskiy, Murray Patterson, Imdadullah Khan
With the rapid spread of the novel coronavirus (COVID-19) across the globe and its continuous mutation, it is of pivotal importance to design a system to identify different known (and unknown) variants of SARS-CoV-2.
no code implementations • 2 Feb 2020 • Asad Ullah, Sarwan Ali, Imdadullah Khan, Muhammad Asad Khan, Safiullah Faizullah
In this paper, we investigate the effect of the analysis window and feature selection on classification accuracy of different hand and wrist movements using time-domain features.
no code implementations • 2 Feb 2020 • Sarwan Ali, Haris Mansoor, Imdadullah Khan, Naveed Arshad, Safiullah Faizullah, Muhammad Asad Khan
However, these solutions are not fair in terms of electricity distribution.
1 code implementation • 28 Jan 2020 • Zohair Raza Hassan, Mudassir Shabbir, Imdadullah Khan, Waseem Abbas
State-of-the-art algorithms for computing descriptors require the entire graph to be in memory, entailing a huge memory footprint, and thus do not scale well to increasing sizes of real-world networks.
Databases
no code implementations • 28 Dec 2019 • Haris Mansoor, Sarwan Ali, Imdadullah Khan, Naveed Arshad, Muhammad Asad Khan, Safiullah Faizullah
A prominent feature of \textsc{fmf} is that it works at any level of user-specified granularity, both in the temporal (from a single hour to days) and spatial dimensions (a single household to groups of consumers).
no code implementations • 27 Dec 2019 • Sarwan Ali, Muhammad Haroon Shakeel, Imdadullah Khan, Safiullah Faizullah, Muhammad Asad Khan
Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement.
no code implementations • 27 Dec 2019 • Muhammad Haroon Shakeel, Asim Karim, Imdadullah Khan
In this work, we present a data augmentation strategy and a multi-cascaded model for improved paraphrase detection in short texts.
no code implementations • 27 Dec 2019 • Sarwan Ali, Muhammad Ahmad, Umair ul Hassan, Muhammad Asad Khan, Shafiq Alam, Imdadullah Khan
Data analysis require a pairwise proximity measure over objects.
no code implementations • 27 Dec 2019 • Muhammad Haroon Shakeel, Turki Alghamidi, Safi Faizullah, Imdadullah Khan
These methods, however apply to texts written in a specific language.
1 code implementation • 29 Nov 2019 • Muhammad Haroon Shakeel, Asim Karim, Imdadullah Khan
Our model achieves high accuracy for classification on this dataset and outperforms the previous model for multilingual text classification, highlighting language independence of McM.