796 search results - page 12 / 160 » Effective Use of the KDD Process and Data Mining for Compute... |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
KDD
2009
ACM
14 years 3 months ago
2009
ACM
The paradigm of “human computation” seeks to harness human abilities to solve computational problems or otherwise perform distributed work that is beyond the scope of current ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
KDD
1998
ACM
14 years 1 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...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the e...