Sciweavers

351 search results - page 24 / 71
» The Aggregation of Imprecise Probabilities
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 9 days 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
ICDM
2006
IEEE
226views Data Mining» more  ICDM 2006»
14 years 4 months ago
Converting Output Scores from Outlier Detection Algorithms into Probability Estimates
Current outlier detection schemes typically output a numeric score representing the degree to which a given observation is an outlier. We argue that converting the scores into wel...
Jing Gao, Pang-Ning Tan
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 11 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 6 days ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
KES
2007
Springer
14 years 5 months ago
Credal Networks for Operational Risk Measurement and Management
According to widely accepted guidelines for self-regulation, the capital requirements of a bank should relate to the level of risk with respect to three different categories. Amon...
Alessandro Antonucci, Alberto Piatti, Marco Zaffal...