Sciweavers

988 search results - page 116 / 198
» Learning with Local and Global Consistency
Sort
View
ICML
2004
IEEE
16 years 7 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
ICPR
2008
IEEE
16 years 7 months ago
A new objective function for sequence labeling
We propose a new loss function for discriminative learning of Markov random fields, which is an intermediate loss function between the sequential loss and the pointwise loss. We s...
Hisashi Kashima, Yuta Tsuboi
ICASSP
2011
IEEE
14 years 10 months ago
Cooperative prey herding based on diffusion adaptation
Mobile adaptive networks consist of a collection of nodes with learning and motion abilities that interact with each other locally in order to solve distributed processing and dis...
Sheng-Yuan Tu, Ali H. Sayed
PODS
2006
ACM
88views Database» more  PODS 2006»
16 years 6 months ago
Structural characterizations of the semantics of XPath as navigation tool on a document
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Georg...
BMCBI
2008
98views more  BMCBI 2008»
15 years 6 months ago
Empirical Bayes models for multiple probe type microarrays at the probe level
Background: When analyzing microarray data a primary objective is often to find differentially expressed genes. With empirical Bayes and penalized t-tests the sample variances are...
Magnus Åstrand, Petter Mostad, Mats Rudemo