Sciweavers

160 search results - page 7 / 32
» Efficient Kernel-based Learning for Trees
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Learning for efficient retrieval of structured data with noisy queries
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
Charles Parker, Alan Fern, Prasad Tadepalli
BMCBI
2010
135views more  BMCBI 2010»
14 years 9 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
ICML
2006
IEEE
15 years 10 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
VLDB
2006
ACM
162views Database» more  VLDB 2006»
15 years 9 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
82
Voted
ICML
2002
IEEE
15 years 10 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi