Sciweavers

1199 search results - page 98 / 240
» Robust inference of trees
Sort
View
ECML
1997
Springer
15 years 8 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
168
Voted
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 3 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 10 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
INFOCOM
2002
IEEE
15 years 9 months ago
Host Multicast: A Framework for Delivering Multicast To End Users
Abstract—While the advantages of multicast delivery over multiple unicast deliveries is undeniable, the deployment of the IP multicast protocol has been limited to “islands” ...
Beichuan Zhang, Sugih Jamin, Lixia Zhang
147
Voted
CAD
2008
Springer
15 years 4 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene