Sciweavers

3395 search results - page 89 / 679
» Learning to efficiently rank
Sort
View
NAACL
2010
13 years 7 months ago
Hitting the Right Paraphrases in Good Time
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
Stanley Kok, Chris Brockett
WWW
2004
ACM
14 years 9 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
ECAI
2006
Springer
14 years 22 days ago
Efficient Knowledge Acquisition for Extracting Temporal Relations
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
Son Bao Pham, Achim G. Hoffmann
ICML
2006
IEEE
14 years 10 months ago
Learning user preferences for sets of objects
Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of it...
Marie desJardins, Eric Eaton, Kiri Wagstaff
IJCAI
2003
13 years 10 months ago
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Information extraction (IE) aims at extracting specific information from a collection of documents. A lot of previous work on 10 from semi-structured documents (in XML or HTML) us...
Raymond Kosala, Maurice Bruynooghe, Jan Van den Bu...