Sciweavers

243 search results - page 33 / 49
» Error Mining in Parsing Results
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
15 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Temporal Pattern Matching for the Prediction of Stock Prices
Time series data poses a significant variation to the traditional segmentation techniques of data mining because the observation is derived from multiple instances of the same und...
Richi Nayak, Paul te Braak
KDD
2012
ACM
257views Data Mining» more  KDD 2012»
13 years 5 days ago
Aggregating web offers to determine product prices
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...
Rakesh Agrawal, Samuel Ieong
ICSE
2009
IEEE-ACM
15 years 10 months ago
Taint-based directed whitebox fuzzing
We present a new automated white box fuzzing technique and a tool, BuzzFuzz, that implements this technique. Unlike standard fuzzing techniques, which randomly change parts of the...
Vijay Ganesh, Tim Leek, Martin C. Rinard
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 1 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen