Sciweavers

1315 search results - page 80 / 263
» Discovering significant rules
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 1 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
ICONIP
2009
14 years 9 months ago
Fuzzy Decision Tree Induction Approach for Mining Fuzzy Association Rules
Decision Tree Induction (DTI), one of the Data Mining classification methods, is used in this research for predictive problem solving in analyzing patient medical track records. In...
Rolly Intan, Oviliani Yenty Yuliana
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
16 years 1 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
PAKDD
2001
ACM
121views Data Mining» more  PAKDD 2001»
15 years 4 months ago
Direct Domain Knowledge Inclusion in the PA3 Rule Induction Algorithm
Inclusion of domain knowledge in a process of knowledge discovery in databases is a complex but very important part of successful knowledge discovery solutions. In real-life data m...
Pedro de Almeida
FPL
2008
Springer
122views Hardware» more  FPL 2008»
15 years 1 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno