32 search results - page 5 / 7 » On data mining, compression, and Kolmogorov complexity |
KDD
1995
ACM
15 years 1 months ago
1995
ACM
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
72
Voted
EUROSSC
2007
Springer
15 years 3 months ago
2007
Springer
We present a new approach for the detection of complex events in Wireless Sensor Networks. Complex events are sets of data points that correspond to interesting or unusual patterns...
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...