2020 search results - page 121 / 404 » KDD Process Planning |
132
click to vote
KDD
1999
ACM
15 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...
115
click to vote
KDD
1999
ACM
15 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...
132
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
130
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we discuss a data mining framework for constructing intrusion detection models. The key ideas are to mine system audit data for consistent and useful patterns of pro...
157
click to vote
PKDD
1998
Springer
15 years 8 months ago
1998
Springer
Knowledge Discovery in Databases (KDD) focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns within them. While most work on...