loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03)
Mining Association Rules with Linguistic Terms
Sacramento, California, USA
November 03-November 05
ISBN: 0-7695-2038-3
Jianjiang Lu, Southeast University, PLA University of Science and Technology and Jiangsu Institute of Software Quality
Baowen Xu, Southeast University and Jiangsu Institute of Software Quality
Dazhou Kang, Southeast University and Jiangsu Institute of Software Quality
Huowang Chen, National University of Defense Technology
Hongji Yang, De Montfort University
Some problems of mining association rules with linguistic terms are discussed. First, an incremental updating algorithm of association rules with linguistic terms is presented. The collection of frequent linguistic attribute sets and its negative border along with their support count are maintained, which makes scan the entire database once at most in the process of updating association rules. The experiment shows that the updating algorithm can not only update association rules effectively but also avoid the repeated cost. Secondly, the parallel algorithm for mining association rules with linguistic terms is presented. The Boolean parallel mining algorithm is improved to discover frequent linguistic attribute sets, and the association rules with at least confidence are generated on all processors. This parallel mining algorithm has fine scaleup, sizeup and speedup.
Index Terms:
data mining; association rules; linguistic terms; parallel; incremental updating algorithm
Citation:
Jianjiang Lu, Baowen Xu, Dazhou Kang, Huowang Chen, Hongji Yang, "Mining Association Rules with Linguistic Terms," ictai, pp.129, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.