default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammed J. Zaki
- > Home > Persons > Mohammed J. Zaki
Publications
- 2013
[p5]Chandan K. Reddy, Mohammad Al Hasan, Mohammed J. Zaki:
Clustering Biological Data. Data Clustering: Algorithms and Applications 2013: 381-414- 2012
- [j63]Mohammad Al Hasan, Jun Huan, Jake Yue Chen
, Mohammed J. Zaki:
Biological knowledge discovery and data mining. Sci. Program. 20(1): 1-2 (2012) - 2011
- [j60]Mohammad Al Hasan, Saeed Salem, Mohammed J. Zaki:
SimClus: an effective algorithm for clustering with a lower bound on similarity. Knowl. Inf. Syst. 28(3): 665-685 (2011) - [p3]Mohammad Al Hasan, Mohammed J. Zaki:
A Survey of Link Prediction in Social Networks. Social Network Data Analytics 2011: 243-275 - [e15]Mohammed J. Zaki, Jake Yue Chen, Mohammad Al Hasan, Jun Huan:
Proceedings of the Tenth International Workshop on Data Mining in Bioinformatics, BIOKDD '11, San Diego, California, USA, August 21, 2011. ACM 2011, ISBN 978-1-4503-0839-7 [contents] - 2009
- [j53]Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Mohammed J. Zaki:
SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters. Knowl. Inf. Syst. 21(2): 201-229 (2009) - [j52]Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Mohammed J. Zaki:
Robust partitional clustering by outlier and density insensitive seeding. Pattern Recognit. Lett. 30(11): 994-1002 (2009) - [j51]Mohammad Al Hasan, Mohammed J. Zaki:
Output Space Sampling for Graph Patterns. Proc. VLDB Endow. 2(1): 730-741 (2009) - [c74]Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi, Mohammed J. Zaki:
Clustering with Lower Bound on Similarity. PAKDD 2009: 122-133 - [c73]Mohammad Al Hasan, Mohammed Javeed Zaki:
MUSK: Uniform Sampling of k Maximal Patterns. SDM 2009: 650-661 - 2008
- [j48]Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Mohammed Javeed Zaki:
An integrated, generic approach to pattern mining: data mining template library. Data Min. Knowl. Discov. 17(3): 457-495 (2008) - [j45]Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Jérémy Besson, Mohammed J. Zaki:
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns. Stat. Anal. Data Min. 1(2): 67-84 (2008) - [c70]Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Mohammed J. Zaki:
SPARCL: Efficient and Effective Shape-Based Clustering. ICDM 2008: 93-102 - 2007
- [c67]Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Jérémy Besson, Mohammed Javeed Zaki:
ORIGAMI: Mining Representative Orthogonal Graph Patterns. ICDM 2007: 153-162 - 2005
- [c53]Mohammed Javeed Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban, Vineet Chaoji, Mohammad Al Hasan, Saeed Salem:
Towards Generic Pattern Mining. ICFCA 2005: 1-20 - [c49]Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Nagender Parimi, Benjarath Phoophakdee, Joe Urban, Vineet Chaoji, Mohammad Al Hasan, Saeed Salem:
Towards Generic Pattern Mining. PReMI 2005: 91-97
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
