Sciweavers

159 search results - page 5 / 32
» Boosting margin based distance functions for clustering
Sort
View
FLAIRS
2001
13 years 10 months ago
A Lattice-Based Approach to Hierarchical Clustering
The paper presents an approach to hierarchical clustering based on the use of a least general generalization (lgg) operator to induce a lattice structure of clusters and a categor...
Zdravko Markov
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 2 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
ICML
2008
IEEE
14 years 9 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
CVPR
2009
IEEE
15 years 3 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
ECCV
2008
Springer
14 years 10 months ago
SERBoost: Semi-supervised Boosting with Expectation Regularization
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
Amir Saffari, Helmut Grabner, Horst Bischof