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
<<< = KDD_EXPLORATIONS'02 >>>
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

KDD_EXPLOR - June 2002 - Volume 4, Issue 1


Classification trees for problems with monotonicity constraints SPARTAN: using constrained models for guaranteed-error semantic compression Learning missing values from summary constraints Constrained frequent pattern mining: a pattern-growth view Exploiting succinct constraints using FP-trees Is pushing constraints deeply into the mining algorithms really what we want?: an alternative approach for association rule mining Discovery in multi-attribute data with user-defined constraints Why so many clustering algorithms: a position paper
Return to KDD_EXPLOR session listing



DiSC'03 © 2003 Association for Computing Machinery