Abstract:
Given a relational database and a set of fuzzy terms defined for some attributes we consider the problem of mining fuzzy quantitative association rules that may contain c...Show MoreMetadata
Abstract:
Given a relational database and a set of fuzzy terms defined for some attributes we consider the problem of mining fuzzy quantitative association rules that may contain crisp values, intervals, and fuzzy terms in both antecedent and consequent. We present an algorithm extended from the equi-depth partition (EDP) algorithm for solving this problem. Our approach combines interval partition with pre-defined fuzzy terms and is more general.
Date of Conference: 09-11 November 1999
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7695-0456-6
Print ISSN: 1082-3409