Sciweavers

3499 search results - page 98 / 700
» On the local optimality of LambdaRank
Sort
View
ISCI
2008
102views more  ISCI 2008»
14 years 10 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
AMC
2004
115views more  AMC 2004»
14 years 10 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
CEC
2009
IEEE
15 years 4 months ago
An adaptive learning particle swarm optimizer for function optimization
— Traditional particle swarm optimization (PSO) suffers from the premature convergence problem, which usually results in PSO being trapped in local optima. This paper presents an...
Changhe Li, Shengxiang Yang
DAGM
2011
Springer
13 years 9 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...