Sciweavers

171 search results - page 32 / 35
» A Boosting Approach to Multiple Instance Learning
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
ESANN
2006
13 years 9 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
ACL
2011
12 years 11 months ago
In-domain Relation Discovery with Meta-constraints via Posterior Regularization
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
Harr Chen, Edward Benson, Tahira Naseem, Regina Ba...
ICRA
2006
IEEE
132views Robotics» more  ICRA 2006»
14 years 1 months ago
Speeding-up Multi-robot Exploration by Considering Semantic Place Information
— In this paper, we consider the problem of exploring an unknown environment with a team of mobile robots. One of the key issues in multi-robot exploration is how to assign targe...
Cyrill Stachniss, Óscar Martínez Moz...
PAKDD
2001
ACM
157views Data Mining» more  PAKDD 2001»
14 years 3 days ago
Applying Pattern Mining to Web Information Extraction
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...
Chia-Hui Chang, Shao-Chen Lui, Yen-Chin Wu