Sciweavers

2638 search results - page 451 / 528
» Extracting Approximate Patterns
Sort
View
CCCG
2008
15 years 5 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
15 years 5 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
AAAI
2004
15 years 5 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek
122
Voted
BIOCOMP
2006
15 years 5 months ago
Filtering Tandem Repeats in DNA Sequences
A tandem repeat is a sequence of two or more contiguous, approximate copies of a pattern. Tandem repeats occur in the genomes of both eukaryotic and prokaryotic organisms. They ar...
Dina Sokol, Justin Tojeira
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
15 years 5 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...