Sciweavers

405 search results - page 37 / 81
» Efficient decision tree construction on streaming data
Sort
View
PRIS
2004
13 years 9 months ago
Similarity Range Queries in Streaming Time Series
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 9 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
ICML
2000
IEEE
14 years 8 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
DAWAK
1999
Springer
13 years 12 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 7 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan