• DocumentCode
    2357723
  • Title

    Mining association rules with linguistic terms

  • Author

    Lu, Jianjiang ; Xu, Baowen ; Xu, Lei ; Kang, Dazhou ; Chen, Huowang ; Yang, Hongji

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2003
  • fDate
    3-5 Nov. 2003
  • Firstpage
    129
  • Lastpage
    133
  • Abstract
    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 scale-up, size-up and speed-up.
  • Keywords
    Boolean functions; data mining; database management systems; learning (artificial intelligence); parallel algorithms; Boolean mining algorithm; Boolean parallel mining; association rule mining; data mining; frequent linguistic attribute sets; incremental updating algorithm; linguistic attribute set; linguistic term; parallel algorithm; parallel database; parallel mining algorithm; Association rules; Clustering algorithms; Computer science; Costs; Data mining; Educational technology; Fuzzy sets; Laboratories; Parallel algorithms; Partitioning algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on
  • ISSN
    1082-3409
  • Print_ISBN
    0-7695-2038-3
  • Type

    conf

  • DOI
    10.1109/TAI.2003.1250180
  • Filename
    1250180