Sciweavers

1059 search results - page 153 / 212
» Discovering Sequence Similarity by the Algorithmic Significa...
Sort
View
DAGSTUHL
2004
13 years 10 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ICMLA
2008
13 years 10 months ago
Mapping Uncharted Waters: Exploratory Analysis, Visualization, and Clustering of Oceanographic Data
In this paper we describe an interdisciplinary collaboration between researchers in machine learning and oceanography. The collaboration was formed to study the problem of open oc...
Joshua M. Lewis, Pincelli M. Hull, Kilian Q. Weinb...
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
14 years 9 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
14 years 3 months ago
Evaluation Measures for Multi-class Subgroup Discovery
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been...
Tarek Abudawood, Peter Flach
QOSA
2010
Springer
13 years 6 months ago
Using QoS-Contracts to Drive Architecture-Centric Self-adaptation
Self-adaptation is now a promising approach to maximize the satisfaction of requirements under changing environmental conditions. One of the key challenges for such self-adaptive s...
Franck Chauvel, Hui Song, Xiangping Chen, Gang Hua...