Sciweavers

1651 search results - page 157 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
13 years 6 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
ICPR
2008
IEEE
14 years 9 months ago
A probabilistic Self-Organizing Map for facial recognition
This article presents a method aiming at quantifying the visual similarity between an image and a class model. This kind of problem is recurrent in many applications such as objec...
Christophe Garcia, Grégoire Lefebvre
ICML
2003
IEEE
14 years 8 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
ECML
2007
Springer
14 years 2 months ago
Discovering Word Meanings Based on Frequent Termsets
Word meaning ambiguity has always been an important problem in information retrieval and extraction, as well as, text mining (documents clustering and classification). Knowledge di...
Henryk Rybinski, Marzena Kryszkiewicz, Grzegorz Pr...