Sciweavers

4911 search results - page 242 / 983
» Tree dependence analysis
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
15 years 4 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
TIP
2008
85views more  TIP 2008»
15 years 4 months ago
A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
Jundi Ding, RuNing Ma, Songcan Chen
ICML
1999
IEEE
16 years 5 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 8 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 1 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson