Mohammad El-Hajj Papers on DiSC'04 Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining Publications Note: Links lead to the DBLP on the Web. Mohammad El-Hajj 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 [ 1 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] ©2004 Association for Computing Machinery