Sciweavers

6715 search results - page 155 / 1343
» Learning from a Test Set
Sort
View
JMLR
2007
58views more  JMLR 2007»
15 years 3 months ago
Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
Nikolaj Tatti
152
Voted
ICCAD
1991
IEEE
135views Hardware» more  ICCAD 1991»
15 years 6 months ago
DIATEST: A Fast Diagnostic Test Pattern Generator for Combinational Circuits
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
Torsten Grüning, Udo Mahlstedt, Hartmut Koopm...
ICMCS
2006
IEEE
141views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Coarse-to-Fine Pedestrian Localization and Silhouette Extraction for the Gait Challenge Data Sets
This paper presents a localized coarse-to-fine algorithm for efficient and accurate pedestrian localization and silhouette extraction for the Gait Challenge data sets. The coars...
Haiping Lu, Konstantinos N. Plataniotis, Anastasio...
ISMIS
2011
Springer
14 years 6 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski
ICPR
2004
IEEE
16 years 4 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu