العربية
Banner

Number of Publications

10 Number of Publications

A Fast and Efficient Algorithm for Outlier Detection Over Data Streams

2021
Abstract

New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching. arXiv preprint arXiv:1904.08819

2019
Full Paper Abstract

A novel hierarchical-based framework for upper bound computation of graph edit distance, Pattern Recognition 80 (2018) 210–224

ELSEVIER 2018
Abstract

A Novel Edge-centric Approach for Graph Edit Similarity Computation. Information Systems 80 (2019) 91–106.

Elsevier 2018
Abstract

An efficient string edit similarity join algorithm. Computing and Informatics 36,(3):683–704 · June 2017

2017
Full Paper Abstract

CSI_GED: An Efficient Approach for Graph Edit Similarity Computation. ICDE 2016. pp. 265--276.

IEEE 2016
Full Paper Abstract

BFST_ED: A novel upper bound computation framework for the graph edit distance. SISAP 2016, pp. 3-19.

Springer 2016
Full Paper Abstract

An Improved Global Lower Bound For Graph Edit Similarity Search. Pattern Recognition Letters 58 (2015) 8-14.

2015
Abstract

Compressed Feature-based Filtering and Verification Approach for Subgraph Search. EDBT (2013) 287-298.

2013
Full Paper Abstract

Efficiently using Prime-Encoding for Frequent Itemsets Mining in Sparse Data. Computing and Informatics, 32(5)(2013), 1079--1099.

2013
Full Paper Abstract