Sciweavers

413 search results - page 45 / 83
» Lattice Boltzmann Method
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 7 days 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
FLAIRS
2007
15 years 2 months ago
An Extended Neural Gas Model for Efficient Data Mining Tasks
This paper presents a numerical association rule extraction method that is based on original quality measures which evaluate to what extent a numerical classification model behave...
Jean-Charles Lamirel, Shadi Al Shehabi
WSC
2004
15 years 1 months ago
Quasi-Monte Carlo Methods in Finance
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
Pierre L'Ecuyer
ICASSP
2008
IEEE
15 years 6 months ago
An unsupervised web-based topic language model adaptation method
This paper focuses on a solution to better adapt ASR systems, whose language models (LM) are usually trained on topic-independent corpora, to new topics, in particular in the case...
Gwénolé Lecorvé, Guillaume Gr...
ICML
2009
IEEE
16 years 19 days ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel