![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Cristian Bucila Daniel Kifer , Johannes Gehrke , Cristian Bucila, Walker M. White : How to quickly find a witness. PODS 2003 : 272-283 Cristian Bucila, Johannes Gehrke , Daniel Kifer , Walker M. White : DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints. Data Min. Knowl. Discov. 7 (3): 241-272 (2003) Cristian Bucila, Johannes Gehrke , Daniel Kifer , Walker M. White : DualMiner: a dual-pruning algorithm for itemsets with constraints. KDD 2002 : 42-51 1 [ 1 ] [ 2 ] [ 3 ] 2 [ 1 ] [ 2 ] [ 3 ] 3 [ 1 ] [ 2 ] [ 3 ] ![]() ©2004 Association for Computing Machinery |