Travelled to:
2 × China
3 × USA
Collaborated with:
G.Li M.A.Hasan B.Phoophakdee A.Silva W.M.Jr. L.Zhao N.Ramakrishnan P.Anchuri O.Barkol S.Golan M.Shamy C.H.C.Teixeira A.J.Fonseca M.Serafini G.Siganos A.Aboulnaga
Talks about:
graph (4) mine (4) pattern (3) attribut (2) boolean (2) sampl (2) framework (1) distribut (1) arbitrari (1) structur (1)
Person: Mohammed J. Zaki
DBLP: Zaki:Mohammed_J=
Facilitated 1 volumes:
Contributed to:
Wrote 7 papers:
- SOSP-2015-TeixeiraFSSZA #distributed #graph #mining #named
- Arabesque: a system for distributed graph mining (CHCT, AJF, MS, GS, MJZ, AA), pp. 425–440.
- KDD-2013-AnchuriZBGS #approximate #graph #mining
- Approximate graph mining with label costs (PA, MJZ, OB, SG, MS), pp. 518–526.
- KDD-2012-LiZ
- Sampling minimal frequent boolean (DNF) patterns (GL, MJZ), pp. 87–95.
- VLDB-2012-SilvaMZ #correlation #graph #mining #scalability
- Mining Attribute-structure Correlated Patterns in Large Attributed Graphs (AS, WMJ, MJZ), pp. 466–477.
- VLDB-2009-HasanZ #graph
- Output Space Sampling for Graph Patterns (MAH, MJZ), pp. 730–741.
- SIGMOD-2007-PhoophakdeeZ
- Genome-scale disk-based suffix tree indexing (BP, MJZ), pp. 833–844.
- KDD-2006-ZhaoZR #framework #mining #named
- BLOSOM: a framework for mining arbitrary boolean expressions (LZ, MJZ, NR), pp. 827–832.