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.
- Full Text: PDF
- DOI:10.5539/cis.v2n2p131
Journal Metrics
WJCI (2022): 0.636
Impact Factor 2022 (by WJCI): 0.419
h-index (January 2024): 43
i10-index (January 2024): 193
h5-index (January 2024): N/A
h5-median(January 2024): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- CiteFactor
- CNKI Scholar
- COPAC
- CrossRef
- DBLP (2008-2019)
- EBSCOhost
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- Google Scholar
- Harvard Library
- Infotrieve
- LOCKSS
- Mendeley
- PKP Open Archives Harvester
- Publons
- ResearchGate
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- The Index of Information Systems Journals
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WJCI Report
- WorldCat
Contact
- Chris LeeEditorial Assistant
- cis@ccsenet.org