Sciweavers

876 search results - page 111 / 176
» A theory of learning with similarity functions
Sort
View

Source Code
2231views
16 years 7 months ago
The Berkeley Segmentation Engine (BSE)
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...
Charless Fowlkes
FLAIRS
2006
15 years 3 months ago
Generating Realistic Large Bayesian Networks by Tiling
In this paper we present an algorithm and software for generating arbitrarily large Bayesian Networks by tiling smaller real-world known networks. The algorithm preserves the stru...
Ioannis Tsamardinos, Alexander R. Statnikov, Laura...
AAAI
2012
13 years 4 months ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 1 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
ALT
1995
Springer
15 years 5 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara