Sciweavers

12194 search results - page 17 / 2439
» Numberings Optimal for Learning
Sort
View
CIMCA
2005
IEEE
15 years 11 months ago
A New Evolutionary Algorithm for Determining the Optimal Number of Clusters
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
COLT
2003
Springer
15 years 11 months ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
COLT
1998
Springer
15 years 10 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
DM
2000
81views more  DM 2000»
15 years 5 months ago
The optimal pebbling number of the complete m-ary tree
In this paper, we
Hung-Lin Fu, Chin-Lin Shiue
ICTAI
2005
IEEE
15 years 11 months ago
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré