Sciweavers

216 search results - page 42 / 44
» Compression-based data mining of sequential data
Sort
View
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
13 years 9 months ago
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
DAWAK
2001
Springer
13 years 12 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
JIIS
2002
141views more  JIIS 2002»
13 years 7 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
KDD
2009
ACM
224views Data Mining» more  KDD 2009»
14 years 1 days ago
Issues in evaluation of stream learning algorithms
Learning from data streams is a research area of increasing importance. Nowadays, several stream learning algorithms have been developed. Most of them learn decision models that c...
João Gama, Raquel Sebastião, Pedro P...
FLAIRS
2010
13 years 9 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...