Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

127

Voted

PAKDD
2004
ACM

119views Data Mining» more PAKDD 2004»

Mining Negative Rules Using GRD

15 years 8 months ago

Mining Negative Rules Using GRD

Download www.csse.monash.edu.au

GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user must specify a measure of interestingness and the number of rules sought (k). This paper reports eﬃcient techniques to extend GRD to support mining of negative rules.

Dhananjay R. Thiruvady, Geoffrey I. Webb

Real-time Traffic

Association Rule Discovery | Data Mining | Interesting Rule Discovery | PAKDD 2004 | Rule Discovery |

claim paper

Related Content

» Hyperlink Recommendation Based on Positive and Negative Association Rules

» Using multiple and negative target rules to make classifiers more understandable

» Hyperlink assessment based on web usage mining

» Optimization of association rule mining queries

» Mining Default Rules from Statistical Data

» Efficient AdaptiveSupport Association Rule Mining for Recommender Systems

» Incremental Mining for Temporal Association Rules for Crime Pattern Discoveries

» Alattin mining alternative patterns for defect detection

» Mining conjunctive sequential patterns

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	PAKDD
Authors	Dhananjay R. Thiruvady, Geoffrey I. Webb

Comments (0)