Sciweavers

447 search results - page 6 / 90
» Decision trees with minimal costs
Sort
View
JSAC
2007
116views more  JSAC 2007»
13 years 8 months ago
Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
Abstract— On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, es...
Tara Small, Baochun Li, Ben Liang
COMAD
2009
13 years 10 months ago
A Feasibility Study on Automating the Automotive Insurance Claims Processing
In this paper, we present a feasibility study in automating the insurance claims processing system related to automotive sector. In automobile insurance claims processing, usually...
Jayanta Basak, Desmond Lim
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
14 years 1 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
ICML
2004
IEEE
14 years 9 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AAAI
2006
13 years 10 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch