Sciweavers

526 search results - page 54 / 106
» Increments of Random Partitions
Sort
View
GBRPR
2007
Springer
14 years 1 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
COLT
2004
Springer
14 years 1 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
DAGM
2006
Springer
14 years 1 months ago
Near Real-Time Motion Segmentation Using Graph Cuts
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
Thomas Schoenemann, Daniel Cremers
COLING
2008
13 years 11 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport
EMNLP
2008
13 years 11 months ago
Arabic Named Entity Recognition using Optimized Feature Sets
The Named Entity Recognition (NER) task has been garnering significant attention in NLP as it helps improve the performance of many natural language processing applications. In th...
Yassine Benajiba, Mona T. Diab, Paolo Rosso