Sciweavers

3136 search results - page 128 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
HIS
2004
15 years 7 months ago
An Empirical Performance Comparison of Machine Learning Methods for Spam E-Mail Categorization
The increasing volume of unsolicited bulk e-mail (also known as spam) has generated a need for reliable anti-spam filters. Using a classifier based on machine learning techniques ...
Chih-Chin Lai, Ming-Chi Tsai
GECCO
2010
Springer
225views Optimization» more  GECCO 2010»
15 years 6 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noiseless testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros
COMSIS
2006
156views more  COMSIS 2006»
15 years 6 months ago
A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Kristína Machova, Miroslav Puszta, Frantise...
BMCBI
2008
71views more  BMCBI 2008»
15 years 6 months ago
An improved string composition method for sequence comparison
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
Guoqing Lu, Shunpu Zhang, Xiang Fang
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 6 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama