Sciweavers

163 search results - page 5 / 33
» Representing Aggregators in Relational Probabilistic Models
Sort
View
ENTCS
2006
273views more  ENTCS 2006»
13 years 7 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
14 years 2 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
JMLR
2010
95views more  JMLR 2010»
13 years 2 months ago
Feature Extraction for Machine Learning: Logic-Probabilistic Approach
The paper analyzes peculiarities of preprocessing of learning data represented in object data bases constituted by multiple relational tables with ontology on top of it. Exactly s...
Vladimir Gorodetsky, Vladimir Samoilov
KDD
2012
ACM
257views Data Mining» more  KDD 2012»
11 years 10 months ago
Aggregating web offers to determine product prices
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...
Rakesh Agrawal, Samuel Ieong
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 9 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens