Sciweavers

2962 search results - page 288 / 593
» Reasoning on Association Rules
Sort
View
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
15 years 10 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
VLDB
1991
ACM
108views Database» more  VLDB 1991»
15 years 10 months ago
Management Of Schema Evolution In Databases
This paper presentsa version model which handlesdatabaseschemachangesandwhich takesevolution into account. Its originality is in allowing the development of partial schema version...
José Andany, Michel Léonard, Carole ...
AI
2005
Springer
15 years 8 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 8 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 8 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