Sciweavers

1126 search results - page 21 / 226
» Strong Feature Sets from Small Samples
Sort
View
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 4 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
DAS
2006
Springer
13 years 9 months ago
Extraction and Analysis of Document Examiner Features from Vector Skeletons of Grapheme 'th'
Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Vladimir Pervouchine, Graham Leedham
ICMCS
2006
IEEE
160views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Selecting Kernel Eigenfaces for Face Recognition with One Training Sample Per Subject
It is well-known that supervised learning techniques such as linear discriminant analysis (LDA) often suffer from the so called small sample size problem when apply to solve face ...
Jie Wang, Konstantinos N. Plataniotis, Anastasios ...
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 7 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
CVPR
2007
IEEE
14 years 9 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára