| Fast vertical mining using diffsets MJ Zaki, K Gouda Proceedings of the ninth ACM SIGKDD international conference on Knowledge …, 2003 | 937 | 2003 |
| Efficiently mining maximal frequent itemsets K Gouda, MJ Zaki Proceedings 2001 IEEE International Conference on Data Mining, 163-170, 2001 | 678 | 2001 |
| Genmax: An efficient algorithm for mining maximal frequent itemsets K Gouda, MJ Zaki Data Mining and Knowledge Discovery 11, 223-242, 2005 | 318 | 2005 |
| Prism: An effective approach for frequent sequence mining via prime-block encoding K Gouda, M Hassaan, MJ Zaki Journal of Computer and System Sciences 76 (1), 88-102, 2010 | 77 | 2010 |
| CSI_GED: An efficient approach for graph edit similarity computation K Gouda, M Hassaan 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 265-276, 2016 | 61 | 2016 |
| Prism: A primal-encoding approach for frequent sequence mining K Gouda, M Hassaan, MJ Zaki Seventh IEEE International Conference on Data Mining (ICDM 2007), 487-492, 2007 | 38 | 2007 |
| An improved global lower bound for graph edit similarity search K Gouda, M Arafa Pattern Recognition Letters 58, 8-14, 2015 | 21 | 2015 |
| Compressed feature-based filtering and verification approach for subgraph search K Gouda, M Hassaan Proceedings of the 16th International Conference on Extending Database …, 2013 | 11 | 2013 |
| Mining sequential patterns in dense databases K Gouda, M Hassaan International Journal of Database Management Systems (IJDMS) 3 (1), 179-194, 2011 | 11 | 2011 |
| Prejoin: An efficient trie-based string similarity join algorithm K Gouda, M Rashad 2012 8th International Conference on Informatics and Systems (INFOS), DE-37 …, 2012 | 9 | 2012 |
| A fast algorithm for subgraph search problem K Gouda, M Hassaan 2012 8th International Conference on Informatics and Systems (INFOS), DE-53 …, 2012 | 9 | 2012 |
| A novel edge-centric approach for graph edit similarity computation K Gouda, M Hassaan Information systems 80, 91-106, 2019 | 8 | 2019 |
| A novel hierarchical-based framework for upper bound computation of graph edit distance K Gouda, M Arafa, T Calders Pattern recognition 80, 210-224, 2018 | 8 | 2018 |
| Bfst_ed: a novel upper bound computation framework for the graph edit distance K Gouda, M Arafa, T Calders Similarity Search and Applications: 9th International Conference, SISAP 2016 …, 2016 | 5 | 2016 |
| Efficient string edit similarity join algorithm K Gouda, M Rashad Computing and Informatics 36 (3), 683-704, 2017 | 4 | 2017 |
| DASS: a discovery agent supporting system KA Gouda, J Cheng, K Ushijima IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on …, 1999 | 4 | 1999 |
| Using relevant reasoning to solve the relevancy problem in knowledge discovery in databases KA Gouda, J Cheng SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems …, 1998 | 2 | 1998 |
| Scaling Subgraph Matching by Improving Ullmann Algorithm K Gouda, G Bujdosó, M Hassaan Computing and Informatics 41 (4), 1002–1024-1002–1024, 2022 | 1 | 2022 |
| A Fast and Efficient Algorithm for Outlier Detection Over Data Streams M Hassaan, H Maher, K Gouda International Journal of Advanced Computer Science and Applications 12 (11), 2021 | 1 | 2021 |
| Efficiently Using Prime-Encoding for Mining Frequent Itemsets in Sparse Data K Gouda, M Hassaan Computing and Informatics 32 (5), 1079-1099, 2013 | 1 | 2013 |
