922 search results - page 155 / 185 » A data mining approach to database compression |
111
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
152
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
125
click to vote
SADM
2008
15 years 1 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
129
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
ISUVR
2007
15 years 3 months ago
2007
— This paper presents a recommendation module which provides preferable photo contents to the user from among the huge amount of photo contents in UMPC database. To extract the p...