The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
MCAR: multi-class classification based on association rule
Abstract
Summary form only given. Constructing fast, accurate classifiers for large data sets is an important task in data mining and knowledge discovery. In this research paper, a new classification method called multi-class classification based on association rules (MCAR) is presented. MCAR uses an efficient technique for discovering frequent items and employs a rule ranking method which ensures detailed rules with high confidence are part of the classifier. After experimentation with fifteen different data sets, the results indicated that the proposed method is an accurate and efficient classification technique. Furthermore, the classifiers produced are highly competitive with regards to error rate and efficiency, if compared with those generated by popular methods like decision trees, RIPPER and CBA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
CPAR: Classification based on Predictive Association Rules
Yin, X., & Han, J. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.40 · Cited by 833
Cited by
Phishing detection based Associative Classification data mining
Abdelhamid, N., Ayesh, A., & Thabtah, F. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.03.019 · Cited by 357
Self-citationPredicting phishing websites based on self-structuring neural network
Mohammad, R. M., Thabtah, F., & McCluskey, L. (2014) · Neural Computing and Applications · doi:10.1007/s00521-013-1490-z · Cited by 350
Self-citationA review of associative classification mining
THABTAH, F. (2007) · The Knowledge Engineering Review · doi:10.1017/s0269888907001026 · Cited by 282
Self-citationPredicting Phishing Websites Using Classification Mining Techniques with Experimental Case Studies
Aburrous, M., Hossain, M. A., Dahal, K., & Thabtah, F. (2010) · 2010 Seventh International Conference on Information Technology: New Generations · doi:10.1109/itng.2010.117 · Cited by 86
“As for future work, we want to use different pruning methods like lazy pruning [ 26 ] which discards rules that incorrectly classify training instances and keeps all other rules to be used by MCAR associative classification technique in order to minimize the size of the resulting classifiers and to experimentally meas…”
MethodInfluentialSelf-citation
Metadata
- Authors
- Thabtah, F., Cowling, P., & Peng, Y.
- Venue
- The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.
- Publisher
- IEEE
- Published
- 2005-04-01
- Pages
- 130-136
- OpenAlex
- W1907020532
- Cited by
- 170
- References
- 2
- FWCI
- 4.80
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.