Sciweavers

313 search results - page 37 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
MLDM
2009
Springer
14 years 1 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
DAWAK
2008
Springer
13 years 8 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
AAAI
2006
13 years 8 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 8 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
IJCNN
2007
IEEE
14 years 1 months ago
An Associative Memory for Association Rule Mining
— Association Rule Mining is a thoroughly studied problem in Data Mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the...
Vicente O. Baez-Monroy, Simon O'Keefe