66 search results - page 5 / 14 » Database Transposition for Constrained (Closed) Pattern Mini... |
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
ESANN
2004
13 years 9 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...