Mohammed Elseidy
Information Systems · 2014
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Information Systems — 6 citations into it
- Signal Processing — 6 citations into it
- Artificial Intelligence — 5 citations into it
- Computer Networks and Communications — 5 citations into it
- Computer Vision and Pattern Recognition — 5 citations into it
Whom Mohammed Elseidy trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Xifeng Yan
- Michihiro Kuramochi
- Huahai He
- Jiawei Han
- George Karypis
- Jinsoo Lee
- Ambuj K. Singh
- David S. Johnson
- Wook-Shin Han
Who trusts Mohammed Elseidy overall
Papers from Mohammed Elseidy's perspective
Ordered by how strongly the researchers Mohammed Elseidy trusts endorse each paper. Same corpus, a different order for every researcher.
- gSpan: graph-based substructure pattern mining
- Frequent subgraph discovery (Proceedings 2001 IEEE International Conference on Data Mining)
- CloseGraph: mining closed frequent graph patterns (Knowledge Discovery and Data Mining)
- Graph indexing: a frequent structure-based approach (ACM SIGMOD Conference)
- Frequent sub-structure-based approaches for classifying chemical compounds
- The NP-Completeness Column: An Ongoing Guide
- Mining significant graph patterns by leap search (SIGMOD Conference)
- Graphs-at-a-time: query language and access methods for graph databases (SIGMOD Conference)
- Finding Frequent Patterns in a Large Sparse Graph* (Data mining and knowledge discovery)
- An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (Proceedings of the VLDB Endowment)
Their papers
- GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph (2014) — 335 citations