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

  •  Chunhua Ju    


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(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

WJCI (2020): 0.439

Impact Factor 2020 (by WJCI): 0.247

Google Scholar Citations (March 2022): 6907

Google-based Impact Factor (2021): 0.68

h-index (December 2021): 37

i10-index (December 2021): 172

(Click Here to Learn More)