Sciweavers

968 search results - page 5 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
ICCV
2009
IEEE
15 years 17 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICDAR
2003
IEEE
14 years 27 days ago
Evaluating SEE - A Benchmarking System for Document Page Segmentation
The decomposition of a document into segments such as text regions and graphics is a significant part of the document analysis process. The basic requirement for rating and impro...
Stefan Agne, Andreas Dengel, Bertin Klein
ICDM
2007
IEEE
161views Data Mining» more  ICDM 2007»
14 years 1 months ago
Experimental Comparison of Feature Subset Selection Methods
In the field of machine learning and pattern recognition, feature subset selection is an important area, where many approaches have been proposed. In this paper, we choose some fe...
Chulmin Yun, Jihoon Yang
IEEECIT
2007
IEEE
14 years 1 months ago
An Experimental Study on Feature Subset Selection Methods
In the field of machine learning and pattern recognition, feature subset selection is an important area, where many approaches have been proposed. In this paper, we choose some fe...
Chulmin Yun, Donghyuk Shin, Hyunsung Jo, Jihoon Ya...
COMPSAC
2007
IEEE
13 years 11 months ago
AOP-based automated unit test classification of large benchmarks
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
Cyrille Artho, Zhongwei Chen, Shinichi Honiden