62 search results - page 9 / 13 » kdd 1997 |
KDD
1997
ACM
13 years 11 months ago
1997
ACM
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
We present a novel data mining approach based on decomposition. In order to analyze a given dataset, the method decomposes it to a hierarchy of smaller and less complex datasets t...
KDD
1997
ACM
13 years 11 months 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...