Sciweavers

1451 search results - page 238 / 291
» A Clustering Based Niching Method for Evolutionary Algorithm...
Sort
View
ML
2000
ACM
150views Machine Learning» more  ML 2000»
14 years 10 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
BMCBI
2007
115views more  BMCBI 2007»
14 years 10 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...
MICAI
2005
Springer
15 years 3 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
CVPR
2010
IEEE
15 years 5 months ago
Automatic Image Annotation Using Group Sparsity
Automatically assigning relevant text keywords to images is an important problem. Many algorithms have been proposed in the past decade and achieved good performance. Efforts have...
Shaoting Zhang, Junzhou Huang, Yuchi Huang, Yang Y...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 4 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...