Sciweavers

530 search results - page 20 / 106
» Learning Bounds for Domain Adaptation
Sort
View
SIGIR
2010
ACM
14 years 26 days ago
Adaptive near-duplicate detection via similarity learning
In this paper, we present a novel near-duplicate document detection method that can easily be tuned for a particular domain. Our method represents each document as a real-valued s...
Hannaneh Hajishirzi, Wen-tau Yih, Aleksander Kolcz
CAEPIA
2007
Springer
14 years 3 months ago
Knowledge Engineering and Planning for the Automated Synthesis of Customized Learning Designs
This paper describes an approach to automatically obtain an HTN planning domain from a well structured learning objects repository and also to apply an HTN planner to obtain IMS Le...
Luis A. Castillo, Lluvia Morales, Arturo Gonz&aacu...
ACL
2012
11 years 11 months ago
Cross-Domain Co-Extraction of Sentiment and Topic Lexicons
Extracting sentiment and topic lexicons is important for opinion mining. Previous works have showed that supervised learning methods are superior for this task. However, the perfo...
Fangtao Li, Sinno Jialin Pan, Ou Jin, Qiang Yang, ...
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
14 years 11 days ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu
IPPS
2007
IEEE
14 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...