Sciweavers

103 search results - page 8 / 21
» Online Maintenance of Very Large Random Samples
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
ACL
2010
13 years 5 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
PVLDB
2008
138views more  PVLDB 2008»
13 years 7 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
ICCV
2003
IEEE
14 years 9 months ago
Automatically Labeling Video Data Using Multi-class Active Learning
Labeling video data is an essential prerequisite for many vision applications that depend on training data, such as visual information retrieval, object recognition, and human act...
Rong Yan, Jie Yang, Alexander G. Hauptmann
JMLR
2008
230views more  JMLR 2008»
13 years 7 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...