KDD
1997
ACM
14 years 23 days ago
1997
ACM
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
KDD
1997
ACM
14 years 23 days ago
1997
ACM
Wedescribehow specializeddatabasetechnology and data analysis methods were applied by the Swedish defense to help deal with the violation of Swedish marine territory by foreign su...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
DMKD
1997
ACM
14 years 25 days ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
DMKD
1997
ACM
14 years 25 days ago
1997
ACM
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
DMKD
1997
ACM
14 years 25 days ago
1997
ACM
RIDE
1997
IEEE
14 years 25 days ago
1997
IEEE
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
VLDB
1998
ACM
14 years 25 days ago
1998
ACM
Data Mining places specific requirements on DBMS query performance that cannot be evaluated satisfactorily using existing OLAP benchmarks. The DD Benchmark - defined here - provid...