Sciweavers

1998 search results - page 196 / 400
» Basic Association Rules
Sort
View
AI
2005
Springer
15 years 6 months ago
Incorporating Evidence in Bayesian Networks with the Select Operator
Abstract. In this paper, we propose that the select operator in relational databases be adopted for incorporating evidence in Bayesian networks. This approach does not involve the ...
Cory J. Butz, F. Fang
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
15 years 6 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
FIMI
2004
134views Data Mining» more  FIMI 2004»
15 years 5 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt
FLAIRS
2003
15 years 5 months ago
A Possibilistic Logic Encoding of Access Control
This paper proposes a modelling of information security policies in the framework of possibilistic logic. Our modelling is based on the concept of roles associated with users. Acc...
Salem Benferhat, Rania El Baida, Fréd&eacut...
EACL
1989
ACL Anthology
15 years 5 months ago
A Modular Approach To Story Generation
One way of characterising texts is in terms of the discourse structures on which they appear to be built. Each type of text, or genre, e.g. the sports report, the recipe, the serm...
Lyn Pemberton