Sciweavers

138 search results - page 1 / 28
» Relational Frequent Patterns Mining for Novelty Detection fr...
Sort
View
MLDM
2009
Springer
13 years 11 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...
ISMIS
2009
Springer
13 years 11 months ago
Novelty Detection from Evolving Complex Data Streams with Time Windows
Abstract. Novelty detection in data stream mining denotes the identification of new or unknown situations in a stream of data elements flowing continuously in at rapid rate. This...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
DIS
2009
Springer
13 years 11 months ago
A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
Fabio Fumarola, Anna Ciampi, Annalisa Appice, Dona...
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 6 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
13 years 10 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...