Generating non-redundant association rules
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new framework for associations based on the concept of closed frequent itemsets is presented, with the number of non-redundant rules produced by the new approach is exponentially smaller than the rule set from the traditional approach.
Abstract
Article Free Access Share on Generating non-redundant association rules Author: Mohammed J. Zaki Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY Computer Science Department, Rensselaer Polytechnic Institute, Troy, NYView Profile Authors Info & Claims KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data miningAugust 2000 Pages 34–43https://doi.org/10.1145/347090.347101Published:01 August 2000Publication History 318citation1,591DownloadsMetricsTotal Citations318Total Downloads1,591Last 12 Months59Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF