Zobrazeno 1 - 10 of 18 pro vyhledávání: '"Karam Gouda"'
1
Scaling Subgraph Matching by Improving Ullmann Algorithm
Autor: Karam Gouda, Gyöngyi Bujdosó, Mosab Hassaan
Publikováno v: COMPUTING AND INFORMATICS; Vol. 41 No. 4 (2022): Computing and Informatics; 1002–1024
Graphs are widely used to model complicated data semantics in many application domains. Subgraph isomorphism checking (an NP-complete problem) is a regular operation with this kind of data. In this paper, we propose an improvement of Ullmann algorith
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0412e1f549b14af45b968f979a5821c
https://www.cai.sk/ojs/index.php/cai/article/view/2022_4_1002
Zobrazit plný text záznamu
2
A novel edge-centric approach for graph edit similarity computation
Autor: Mosab Hassaan, Karam Gouda
Publikováno v: Information Systems. 80:91-106
Graph similarity is an important notion with many applications. Graph edit distance is one of the most flexible graph similarity measures available. The main problem with this measure is that in practice it can only be computed for small graphs due t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0170a132154a6310ab3e249691e1e211
https://doi.org/10.1016/j.is.2018.10.003
Zobrazit plný text záznamu
4
A novel hierarchical-based framework for upper bound computation of graph edit distance
Autor: Mona M. Arafa, Toon Calders, Karam Gouda
Publikováno v: Pattern recognition
Graph similarity is an important notion with many applications. Graph edit distance is one of the most flexible graph similarity measure available. The main problem with this measure is that in practice it can only be computed for small graphs due to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f050955c6a4ff2d6895579598c43829
https://doi.org/10.1016/j.patcog.2018.03.019
Zobrazit plný text záznamu
5
An improved global lower bound for graph edit similarity search
Autor: Karam Gouda, Mona M. Arafa
Publikováno v: Pattern Recognition Letters. 58:8-14
New global lower bound on the edit distance between graphs.An efficient preliminary filter for similarity search in graph databases.Almost-for-free improvement on the previous global lower bounds.The new bound is at least as tight as the previous glo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d2e0c9a258924276874c52a6f301afd5
https://doi.org/10.1016/j.patrec.2015.02.004
Zobrazit plný text záznamu
6
Efficient String Edit Similarity Join Algorithm
Autor: Karam Gouda, Metwally Rashad
Publikováno v: COMPUTING AND INFORMATICS; Vol 36, No 3 (2017): Computing and Informatics; 683-704
String similarity join is a basic and essential operation in many applications. In this paper, we investigate the problem of string similarity join with edit distance constraints. A trie-based edit similarity join framework has been proposed recently
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f99203667e37108080f1fe9bc10741a6
http://www.cai.sk/ojs/index.php/cai/article/view/2017_3_683
Zobrazit plný text záznamu
7
CSI_GED: An efficient approach for graph edit similarity computation
Autor: Mosab Hassaan, Karam Gouda
Publikováno v: ICDE
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*.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e47da6ed5da06234533b71065162010e
https://doi.org/10.1109/icde.2016.7498246
Zobrazit plný text záznamu
8
BFST_ED: A Novel Upper Bound Computation Framework for the Graph Edit Distance
Autor: Toon Calders, Mona M. Arafa, Karam Gouda
Publikováno v: Similarity Search and Applications ISBN: 9783319467580
SISAP
Graph similarity is an important operation with many applications. In this paper we are interested in graph edit similarity computation. Due to the hardness of the problem, it is too hard to exactly compare large graphs, and fast approximation approa
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::01fdbb3d78699ec69258b469a5f1a8e4
https://doi.org/10.1007/978-3-319-46759-7_1
Zobrazit plný text záznamu
9
Mining Sequential Patterns in Dense Databases
Autor: Mosab Hassaan, Karam Gouda
Publikováno v: International Journal of Database Management Systems. 3:179-194
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 algo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a3ca2f7a235f7405d98e1577034acea3
https://doi.org/10.5121/ijdms.2011.3112
Zobrazit plný text záznamu
10
Prism: An effective approach for frequent sequence mining via prime-block encoding
Autor: Karam Gouda, Mohammed J. Zaki, Mosab Hassaan
Publikováno v: Journal of Computer and System Sciences. 76(1):88-102
Sequence mining is one of the fundamental data mining tasks. In this paper we present a novel approach for mining frequent sequences, called Prism. It utilizes a vertical approach for enumeration and support counting, based on the novel notion of pri
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2990f970d049f83ff117691e20b1ca4
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje