Sciweavers

3318 search results - page 371 / 664
» The Weak Instance Model
Sort
View
135
Voted
EMNLP
2006
15 years 6 months ago
Boosting Unsupervised Relation Extraction by Using NER
Web extraction systems attempt to use the immense amount of unlabeled text in the Web in order to create large lists of entities and relations. Unlike traditional IE methods, the ...
Ronen Feldman, Benjamin Rosenfeld
IJCAI
2001
15 years 6 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
RECSYS
2010
ACM
15 years 4 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
SIGMOD
2010
ACM
151views Database» more  SIGMOD 2010»
15 years 4 months ago
Exploring schema similarity at multiple resolutions
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
Ken Smith, Craig Bonaceto, Chris Wolf, Beth Yost, ...
COGSCI
2008
74views more  COGSCI 2008»
15 years 4 months ago
Optimal Predictions in Everyday Cognition: The Wisdom of Individuals or Crowds?
Griffiths and Tenenbaum (2006) asked individuals to make predictions about the duration or extent of everyday events (e.g., cake baking times), and reported that predictions were ...
Michael C. Mozer, Harold Pashler, Hadjar Homaei