791 search results - page 28 / 159 » Learning Probabilistic Ontologies with Distributed Parameter... |
TIT
2008
13 years 8 months ago
2008
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
JMLR
2002
13 years 8 months ago
2002
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when ch...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...