Welcome to DiSC 2003
SIGMOD 2002
PODS 2002
 SIGMOD RECORD 2002
 ADBIS 2002
CIKM 2002
CoopIS 2002
 EDBT 2002
 ER 2002
Data Engineering Bul
DEXA_EC-WEB 2002
DMKD 2002
 DPDJ 2002
HYPERTEXT 2002
ICDE 2002
ICDM 2002
JCDL 2002
KDD 2002
 KDD_EXPLORATIONS 20
KRDB 2002
MDM 2002
MIS 2002
RIDE 2002
SBBD 2002
 SIGIR 2002
 SIGIR FORUM 2002
SSDBM 2002
TODS 2002
TIME 2002
VLDB 2002
VLDBJ 2002
About DiSC 2003
Editorial Board
Acknowledgements
DiSC 2003 Production
ADVIS
DiSC'03 Feedback
DiSC'03 Sitemap
Search DiSC'03
<<<Author Index>>>
Copyright Notice

Vikram Pudi

Papers on DiSC'03


How Good are Association-rule Mining Algorithms ?

Publications


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