Sciweavers

146 search results - page 4 / 30
» Mining complex models from arbitrarily large databases in co...
Sort
View
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
14 years 6 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 5 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
DIS
2009
Springer
13 years 12 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...
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
13 years 8 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 5 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin