CRMS: An Algorithm of Classification Rule Mining Based on Multiple Supports


  •  Chunhua Ju    

Abstract

The paper presents an algorithm CRMS of classification rule mining based on multi-support, in which the frequent classification item-set tree is adopted to organize the frequent pattern sets, and array to figure the classification projected transaction subsets. The multi-support method is applied in CRMS due to the unevenly distributed classification patterns. The CRMS uses the breath first strategy assisted by the depth first strategy, and adopts pseudo projection, which makes it unnecessary to scan the database and construct the projected transaction subsets repeatedly, therefore the memory and time cost is very low, and the projecting-efficiency and scalability are higher. The CRMS algorithm can be used in the basket analysis, association rule mining for consumption behavior in the retailing industry, which supports the product layout, buying recommendation and the sale promotion.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1913-8989
  • Issn(Onlne): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

(The data was calculated based on Google Scholar Citations)

Google-based Impact Factor (2018): 18.20

h-index (January 2018): 23

i10-index (January 2018): 90

h5-index (January 2018): 11

h5-median(January 2018):17

Contact