Sciweavers

779 search results - page 9 / 156
» Ranking distributed probabilistic data
Sort
View
ISBI
2004
IEEE
14 years 10 months ago
Pareto Depth Sampling Distributions for Gene Ranking
In this paper we propose a method for gene ranking from microarray experiments using multiple discriminants. The novelty of our approach is that a gene's relative rank is det...
Alfred O. Hero, Sepidarseh Zareparsi, Anand Swaroo...
IDA
2009
Springer
14 years 4 months ago
Probabilistic Factorization of Non-negative Data with Entropic Co-occurrence Constraints
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
Paris Smaragdis, Madhusudana V. S. Shashanka, Bhik...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 9 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
PVLDB
2010
158views more  PVLDB 2010»
13 years 8 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
ICML
2009
IEEE
14 years 10 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel