Sciweavers

1225 search results - page 7 / 245
» Maximal Consistent Subsets
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 2 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
PKDD
2007
Springer
91views Data Mining» more  PKDD 2007»
14 years 1 months ago
Domain Adaptation of Conditional Probability Models Via Feature Subsetting
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
Sandeepkumar Satpal, Sunita Sarawagi
24
Voted
SYNTHESE
2010
98views more  SYNTHESE 2010»
13 years 2 months ago
Equilibria in social belief removal
In studies of multi-agent interaction, especially in game theory, the notion of equilibrium often plays a prominent role. A typical scenario for the belief merging problem is one ...
Richard Booth, Thomas Meyer
TSMC
2008
99views more  TSMC 2008»
13 years 7 months ago
A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. ...
Anthony Hunter, Weiru Liu
CEAS
2006
Springer
13 years 11 months ago
Annotating Subsets of the Enron Email Corpus
We present an annotation project for two subsets of the Enron email corpus. The first is a subset of the UC Berkeley Enron Email Analysis Project and the second consists of a port...
Jade Goldstein, Andres Kwasinksi, Paul Kingsbury, ...