Sciweavers

7225 search results - page 329 / 1445
» Software is data too
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 7 months ago
Identifying non-actionable association rules
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
Bing Liu, Wynne Hsu, Yiming Ma
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
16 years 1 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
16 years 1 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
16 years 25 days ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...