Sciweavers

4560 search results - page 223 / 912
» Finding Data in the Neighborhood
Sort
View
ICECCS
2002
IEEE
85views Hardware» more  ICECCS 2002»
14 years 1 months ago
Fault Detection Effectiveness of Spathic Test Data
This paper presents an approach for generating test data for unit-level, and possibly integration-level, testing based on sampling over intervals of the input probability distribu...
Jane Huffman Hayes, Pifu Zhang
GECCO
2006
Springer
214views Optimization» more  GECCO 2006»
13 years 12 months ago
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
Elon S. Correa, Alex Alves Freitas, Colin G. Johns...
HIS
2004
13 years 9 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
JMLR
2008
159views more  JMLR 2008»
13 years 8 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 7 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre