Abstract
Abstract The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
