Sciweavers

874 search results - page 174 / 175
» Dynamic visual category learning
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 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
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 7 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
ICFP
2008
ACM
14 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
IPSN
2010
Springer
14 years 2 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
ICMI
2007
Springer
112views Biometrics» more  ICMI 2007»
14 years 1 months ago
How to distinguish posed from spontaneous smiles using geometric features
Automatic distinction between posed and spontaneous expressions is an unsolved problem. Previously cognitive sciences’ studies indicated that the automatic separation of posed f...
Michel François Valstar, Hatice Gunes, Maja...