72 search results - page 10 / 15 » kdd 1998 |
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Huge masses of digital data about products, customers and competitors have become available for companies in the services sector. In order to exploit its inherent (and often hidde...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Database integration of mining is becoming increasingly important with tile installation of larger and larger data warehouses built around relational database technology. Most of ...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
In data mining, similarity or distance between attributes is one of the central notions. Such a notion can be used to build attribute hierarchies etc. Similarity metrics can be us...
KDD
1998
ACM
13 years 11 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...