karam gouda|Publications

Benha University

Staff Search: Go

You are in:Home/Publications
Prof. karam gouda :: Publications:

Research Fields

(maximal) frequent itemsets mining

Algorithms: Prism, Genmax, CSI_GED, Pathindex, PEclat, BFST_ED

diffsets data structure

Graph Edit Similarity Search

efficient algorithms

frequent sequence mining

Graph edit distance, Upper bound, Lower Bound

Number of publications is 21

Title

1-A Fast and Efficient Algorithm for Outlier Detection Over Data Streams

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

Abstract' | Full paper

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

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

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

Abstract' | Full paper

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

Abstract' | Full paper

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

Abstract' | Full paper

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

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

Abstract' | Full paper

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

Abstract' | Full paper

11-A fast algorithm for subgraph search problem

Abstract' | Full paper

12-FAST-ON*: AN EXTENDED ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM AND GRAPH QUERY PROCESSING

Abstract' | Full paper

13-PreJoin: An Efficient Trie-based String Similarity Join Algorithm

Abstract' | Full paper

14-Mining sequential patterns in dense databases

Abstract' | Full paper

15-Prism: An effective approach for frequent sequence mining via prime-block encoding. Journal of Computer and System Sciences 76 (2010) 88–102

Abstract' | Full paper

16-Prism: A primal-encoding approach for frequent sequence mining. ICDM07

Abstract' | Full paper

17-GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery, 11, 1–20, 2005

Abstract' | Full paper

18-Fast Vertical Mining Using Diffsets. KDD 2003

Abstract' | Full paper

19-Efficiently Mining Maximal Frequent Itemsets. ICDM 2001

Abstract' | Full paper

20-DASS: a discovery agent supporting system. IEEE SMC'99.

21-Using relevant reasoning to solve the relevancy problem in knowledge discovery in databases. IEEE SMC'98

Google Scholar

Acdemia.edu

Research Gate

Google Plus

Youtube

Wordpress

Instagram

Mendeley

Zotero

Evernote

ORCID

Scopus