Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Mohammad El-Hajj

Papers on DiSC'04


COFI Approach for Mining Frequent Itemsets Revisited

Publications


Note: Links lead to the DBLP on the Web.

Mohammad El-Hajj

Osmar R. Zaïane , Mohammad El-Hajj, Yi Li , Stella Luk : Scrutinizing Frequent Pattern Discovery Performance. ICDE 2005 : 1109-1110

Mohammad El-Hajj, Osmar R. Zaïane : COFI approach for mining frequent itemsets revisited. DMKD 2004 : 70-75

Mohammad El-Hajj, Osmar R. Zaïane : Parallel Association Rule Mining with Minimum Inter-Processor Communication. DEXA Workshops 2003 : 519-523

Mohammad El-Hajj, Osmar R. Zaïane : Non-recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations. DaWaK 2003 : 371-380

Osmar R. Zaïane , Mohammad El-Hajj: COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation. FIMI 2003

Mohammad El-Hajj, Osmar R. Zaïane : Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining. KDD 2003 : 109-118

Osmar R. Zaïane , Mohammad El-Hajj, Paul Lu : Fast Parallel Association Rule Mining without Candidacy Generation. ICDM 2001 : 665-668

1 [ 7 ]

2 [ 1 ]

3 [ 7 ]

4 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ]




©2005 Association for Computing Machinery