Sciweavers

701 search results - page 116 / 141
» Design patterns for lazy evaluation
Sort
View
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 8 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 2 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
14 years 1 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
ECAI
2008
Springer
13 years 10 months ago
Task Driven Coreference Resolution for Relation Extraction
Abstract. This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel...
Feiyu Xu, Hans Uszkoreit, Hong Li
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 9 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood