Sciweavers

421 search results - page 10 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
ICPR
2010
IEEE
15 years 1 months ago
Inverse Multiple Instance Learning for Classifier Grids
Abstract--Recently, classifier grids have shown to be a considerable alternative for object detection from static cameras. However, one drawback of such approaches is drifting if a...
Sabine Sternig, Peter M. Roth, Horst Bischof
ECML
2003
Springer
15 years 2 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
CVPR
2005
IEEE
15 years 11 months ago
A Sparse Support Vector Machine Approach to Region-Based Image Categorization
Automatic image categorization using low-level features is a challenging research topic in computer vision. In this paper, we formulate the image categorization problem as a multi...
Jinbo Bi, Yixin Chen, James Ze Wang
ICML
2010
IEEE
14 years 10 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre