Sciweavers

3643 search results - page 481 / 729
» Learning Submodular Functions
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Optimal assignment kernels for attributed molecular graphs
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
Andreas Zell, Florian Sieker, Holger Fröhlich...
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
16 years 7 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 7 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
LATA
2010
Springer
16 years 1 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
ISBI
2009
IEEE
16 years 1 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin