![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Vikram Pudi 4 Vikram Pudi, Jayant R. Haritsa : Reducing Rule Covers with Deterministic Error Bounds. PAKDD 2003 : 313-324 3 Vikram Pudi, Jayant R. Haritsa : How Good Are Association-Rule Mining Algorithms? ICDE 2002 : 276 2 Vikram Pudi, Jayant R. Haritsa : On the Efficiency of Association-Rule Mining Algorithms. PAKDD 2002 : 80-91 1 Vikram Pudi, Jayant R. Haritsa : Quantifying the Utility of the Past in Mining Large Databases. Information Systems 25 (5): 323-343 (2000) ![]() DiSC'03 © 2003 Association for Computing Machinery |