Sciweavers

47 search results - page 8 / 10
» Online mining of frequent query trees over XML data streams
Sort
View
ICTAI
2007
IEEE
15 years 4 months ago
An Adaptive Distributed Ensemble Approach to Mine Concept-Drifting Data Streams
An adaptive boosting ensemble algorithm for classifying homogeneous distributed data streams is presented. The method builds an ensemble of classifiers by using Genetic Programmi...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
VLDB
2007
ACM
161views Database» more  VLDB 2007»
15 years 10 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
15 years 10 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
15 years 4 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
WEBDB
2009
Springer
185views Database» more  WEBDB 2009»
15 years 4 months ago
Efficient and Scalable Sequence-Based XML Filtering
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
Mariam Salloum, Vassilis J. Tsotras