Sciweavers

1837 search results - page 300 / 368
» Learning From Ambiguous Examples
Sort
View
SAC
2008
ACM
15 years 2 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng
FOCS
2010
IEEE
15 years 19 days ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
AAAI
2011
14 years 2 months ago
Incorporating Boosted Regression Trees into Ecological Latent Variable Models
Important ecological phenomena are often observed indirectly. Consequently, probabilistic latent variable models provide an important tool, because they can include explicit model...
Rebecca A. Hutchinson, Li-Ping Liu, Thomas G. Diet...
140
Voted
CIKM
2009
Springer
15 years 9 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
123
Voted
ATAL
2006
Springer
15 years 6 months ago
Efficient agents for cliff-edge environments with a large set of decision options
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
Ron Katz, Sarit Kraus