Mohammed Javeed Zaki

Mohammed Javeed Zaki

Auto-generated profile, based on publicly available information

Mohammed Javeed Zaki

Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, USA

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in Machine Learning
Verified
Journal Article
Open access
PDF file
MZMohammed J. Zaki
Mohammed J. Zaki
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which...

1 January 2000 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MZM.J. Zaki
M.J. Zaki

7 March 2005 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MZM.J. Zaki
M.J. Zaki
CHC.-J. Hsiao
C.-J. Hsiao
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper, we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels. It also uses a technique called diffsets to reduce the memory footprint of intermediate computations. Finally, it uses a fast hash-based approach to remove any "nonclosed" sets found during computation. We also present CHARM-L, an algorithm that outputs the closed itemset lattice, which is very useful for rule generation and visualization. An extensive experimental evaluation on a number of real and synthetic databases shows that CHARM is a state-of-the-art algorithm that outperforms previous methods. Further, CHARM-L explicitly generates the frequent closed itemset lattice.

17 March 2011
Verified
Book Chapter
Closed access
PDF file
MHMohammad Al Hasan
Mohammad Al Hasan
MZMohammed J. Zaki
Mohammed J. Zaki

1 October 1999 in IEEE Concurrency
Verified
Journal Article
Closed access
MZM.J. Zaki
M.J. Zaki
The author surveys the state of the art in parallel and distributed association-rule-mining algorithms and uncovers the field's challenges and open research problems. This survey can serve as a reference for both researchers and practitioners.

1 August 2000
Verified
Conference Paper
Open access
PDF file
MZMohammed J. Zaki
Mohammed J. Zaki