Sciweavers

3641 search results - page 502 / 729
» On Computability of Pattern Recognition Problems
Sort
View
SAC
2004
ACM
15 years 9 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
125
Voted
CSUR
2004
91views more  CSUR 2004»
15 years 4 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 4 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 4 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 months ago
Feature Weighted SVMs Using Receiver Operating Characteristics.
Support Vector Machines (SVMs) are a leading tool in classification and pattern recognition and the kernel function is one of its most important components. This function is used...
Shaoyi Zhang, M. Maruf Hossain, Md. Rafiul Hassan,...