KDD
1999
ACM
13 years 8 months ago
1999
ACM
This paper investigates the use of supervised clustering in order to create sets of categories for classi cation of documents. We use information from a pre-existing taxonomy in o...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
Managers of electronic commerce sites need to learn as much as possible about their customers and those browsing their virtual premises, in order to maximise the return on marketin...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...