Sciweavers

1709 search results - page 49 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
15 years 8 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
128
Voted
FUIN
2010
268views more  FUIN 2010»
14 years 9 months ago
Boruta - A System for Feature Selection
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...
103
Voted
ICPR
2008
IEEE
15 years 9 months ago
Score based biometric template selection
A biometric identification procedure usually contains two stages: registration and authentication. Most biometric systems capture multiple samples of the same biometric trait (e.g...
Yong Li, Jianping Yin, En Zhu, Chunfeng Hu, Hui Ch...
EDBT
2006
ACM
112views Database» more  EDBT 2006»
16 years 2 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...
119
Voted
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
15 years 8 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...