Sciweavers

13 search results - page 1 / 3
» LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
Sort
View
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 7 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 4 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
ICML
2006
IEEE
14 years 5 months ago
Efficient lazy elimination for averaged one-dependence estimators
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
Fei Zheng, Geoffrey I. Webb
JMLR
2010
107views more  JMLR 2010»
12 years 11 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 5 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici