Sciweavers

171 search results - page 7 / 35
» Finger trees: a simple general-purpose data structure
Sort
View
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
13 years 11 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
IS
2010
13 years 6 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
COMPGEOM
2010
ACM
14 years 21 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
IJCAI
2003
13 years 9 months ago
Information Extraction from Tree Documents by Learning Subtree Delimiters
Information extraction from HTML pages has been conventionally treated as plain text documents extended with HTML tags. However, the growing maturity and correct usage of HTML/XHT...
Boris Chidlovskii
PPSN
2010
Springer
13 years 6 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski