Sciweavers

1839 search results - page 328 / 368
» Feature Selection in Clustering Problems
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
CVPR
2006
IEEE
14 years 11 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie
ICML
2003
IEEE
14 years 9 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
KDD
2007
ACM
139views Data Mining» more  KDD 2007»
14 years 9 months ago
Raising the baseline for high-precision text classifiers
Many important application areas of text classifiers demand high precision and it is common to compare prospective solutions to the performance of Naive Bayes. This baseline is us...
Aleksander Kolcz, Wen-tau Yih
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 9 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman