Sciweavers

1689 search results - page 274 / 338
» On Natural Non-dcpo Domains
Sort
View
JMLR
2012
13 years 2 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
WWW
2008
ACM
16 years 16 days ago
Learning to classify short and sparse text & web with hidden topics from large-scale data collections
This paper presents a general framework for building classifiers that deal with short and sparse text & Web segments by making the most of hidden topics discovered from larges...
Xuan Hieu Phan, Minh Le Nguyen, Susumu Horiguchi
WWW
2002
ACM
16 years 16 days ago
Learning to map between ontologies on the semantic web
Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated info...
AnHai Doan, Jayant Madhavan, Pedro Domingos, Alon ...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 14 days ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
103
Voted
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
16 years 8 days ago
Automatic identification of quasi-experimental designs for discovering causal knowledge
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
David D. Jensen, Andrew S. Fast, Brian J. Taylor, ...