#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2007

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Karam Gouda, Mosab Hassaan, Mohammed J. Zaki
- Seventh IEEE International Conference on Data…
- 2007

Sequence mining is one of the fundamental data mining tasks. In this paper we present a novel approach called Prism, for mining frequent sequences. Prism utilizes a vertical approach for enumeration and support counting, based on the novel notion o/prime block encoding, which in turn is based on prime factorization theory. Via an extensive evaluation on… (More)

- Karam Gouda, Mosab Hassaan
- 2016 IEEE 32nd International Conference on Data…
- 2016

Graph similarity is a basic and essential operation in many applications. In this paper, we are interested in computing graph similarity based on edit distance. Existing graph edit distance computation methods adopt the best first search paradigm A*. These methods are time and space bound. In practice, they can compute the edit distance of graphs containing… (More)

- Karam Gouda, Mosab Hassaan, Mohammed J. Zaki
- J. Comput. Syst. Sci.
- 2010

Article history: Received 30 September 2007 Received in revised form 4 June 2008 Available online 23 May 2009

- Karam Gouda, Mosab Hassaan
- 2011

Sequential pattern mining is an important data mining problem with broad applications, including the analysis of customer purchase patterns, Web access patterns, DNA analysis, and so on. We show on dense databases, a typical algorithm like Spade algorithm tends to lose its efficiency. Spade is based on the used of lists containing the localization of the… (More)

- Karam Gouda, Mosab Hassaan
- EDBT
- 2013

Subgraph search in graph datasets is an important problem with numerous applications. Many feature-based indexing methods have been proposed for solving this problem. These methods have to index too many features or select some of them in order to get an index with good pruning capabilities. None of these directions can give an effective solution to all… (More)

- K. Gouda, M. Hassaan
- 2012 8th International Conference on Informatics…
- 2012

Graphs are widely used to model complicated data semantics in many applications. In this paper we propose Fast-ON, an efficient algorithm for subgraph isomorphism problem which has proven to be NP-complete. Fast-ON is based on Ullman algorithm [1]. It improves the search space of Ullman algorithm by considering two effective optimizations. Comparing to the… (More)

- Mosab Hassaan, Karam Gouda
- 2012

Graphs are widely used to model complicated data semantics in many applications. In our paper [8], we proposed Fast-ON, an efficient algorithm for subgraph isomorphism problem. In this paper, we develop an efficient algorithm called Fast-ON* that extends Fast-ON to handle two other problems, namely, graph isomorphism problem and graph query processing. Our… (More)

- Karam Gouda, Mosab Hassaan
- Computing and Informatics
- 2013

- ‹
- 1
- ›