Sciweavers

1914 search results - page 71 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
FIMI
2004
161views Data Mining» more  FIMI 2004»
14 years 11 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
ECCV
2008
Springer
15 years 11 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
CEC
2010
IEEE
14 years 10 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
AI
2003
Springer
15 years 3 months ago
Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms
We propose a new framework of explanation-oriented data mining by adding an explanation construction and evaluation phase to the data mining process. While traditional approaches c...
Yiyu Yao, Yan Zhao, R. Brien Maguire