1083 search results - page 6 / 217 » Efficient Discovery of Confounders in Large Data Sets |
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
ACSC
2003
IEEE
13 years 11 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
ICMLA
2008
13 years 9 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
DMKD
1997
ACM
13 years 11 months 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...