Sciweavers

1923 search results - page 96 / 385
» Weighted Decision Trees
Sort
View
SIGKDD
2000
231views more  SIGKDD 2000»
15 years 6 months ago
KDD-99 Classifier Learning Contest: LLSoft's Results Overview
Kernel Miner is a new data-mining tool based on building the optimal decision forest. The tool won second place in the KDD'99 Classifier Learning Contest, August 1999. We des...
Itzhak Levin
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 10 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
UAI
2001
15 years 7 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 10 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...