779 search results - page 41 / 156 » Ranking distributed probabilistic data |
193
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
190
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
194
click to vote
ILP
1999
Springer
15 years 10 months ago
1999
Springer
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
160
click to vote
NIPS
2008
15 years 7 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
147
click to vote
ESANN
2007
15 years 7 months ago
2007
Mixtures of probabilistic principal component analyzers model high-dimensional nonlinear data by combining local linear models. Each mixture component is specifically designed to...