| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Mohammad El-Hajj Mohammad El-Hajj, Osmar R. Zaïane : Finding All Frequent Patterns Starting from the Closure. ADMA 2005 : 67-74 Mohammad El-Hajj, Osmar R. Zaïane : Mining with Constraints by Pruning and Avoiding Ineffectual Processing. Australian Conference on Artificial Intelligence 2005 : 1001-1004 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 , Paul Nalos : Bifold Constraint-Based Mining by Simultaneous Monotone and Anti-Monotone Checking. ICDM 2005 : 146-153 Osmar R. Zaïane , Mohammad El-Hajj: Pattern lattice traversal by selective jumps. KDD 2005 : 729-735 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 [ 9 ] 2 [ 1 ] 3 [ 9 ] 4 [ 8 ] 5 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ]  ©2006 Association for Computing Machinery |
