Sciweavers

8294 search results - page 253 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ITC
2002
IEEE
83views Hardware» more  ITC 2002»
15 years 11 months ago
Packet-Based Input Test Data Compression Techniques
1 This paper presents a test input data compression technique, which can be used to reduce input test data volume, test time, and the number of required tester channels. The techni...
Erik H. Volkerink, Ajay Khoche, Subhasish Mitra
ICMLA
2004
15 years 8 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager
DMIN
2009
136views Data Mining» more  DMIN 2009»
15 years 4 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
15 years 4 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich
CIKM
2010
Springer
15 years 1 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki