Abstract

AbstractIn this paper, an alternative approach for maximal association rules mining from a transactional database using soft set theory is proposed. The first step of the proposed approach is based on representing a transactional database as a soft set. Based on the soft set, the notion of items co-occurrence in a transaction can be defined. The definitions of soft maximal association rules, maximal support and maximal confidence are presented using the concept of items co-occurrence. It is shown that by using soft set theory, maximal rules discovered are identical and faster as compared to traditional maximal and rough maximal association rules approaches.KeywordsData miningMaximal association rulesSoft set theory

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 call

Disclaimer: 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.