Sciweavers

704 search results - page 137 / 141
» Learning the Ideal Evaluation Function
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 9 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
ECIR
2009
Springer
14 years 5 months ago
Joint Ranking for Multilingual Web Search
Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s langu...
Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong
UM
2009
Springer
14 years 3 months ago
Narcissus: Group and Individual Models to Support Small Group Work
Long term group work by small teams is a central part of many learning and workplace activities. Widespread group support tools such as wikis, version control systems and issue tra...
Kimberley Upton, Judy Kay
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 3 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...