Sciweavers

411 search results - page 31 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
IJAR
2010
152views more  IJAR 2010»
13 years 7 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
IJCV
2000
133views more  IJCV 2000»
13 years 8 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
JMLR
2008
104views more  JMLR 2008»
13 years 9 months ago
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new cl...
Giorgio Corani, Marco Zaffalon
AIRWEB
2005
Springer
14 years 2 months ago
An Analysis of Factors Used in Search Engine Ranking
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
Albert Bifet, Carlos Castillo, Paul-Alexandru Chir...