The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
A review of associative classification mining
Open accessAbstract
Associative classification mining is a promising approach in data mining that utilizes the association rule discovery techniques to construct classification systems, also known as associative classifiers. In the last few years, a number of associative classification algorithms have been proposed, i.e. CPAR, CMAR, MCAR, MMAC and others. These algorithms employ several different rule discovery, rule ranking, rule pruning, rule prediction and rule evaluation methods. This paper focuses on surveying and comparing the state-of-the-art associative classification techniques with regards to the above criteria. Finally, future directions in associative classification, such as incremental learning and mining low-quality data sets, are also highlighted in this paper.
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
(1992) · Cited by 23,431
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 · cited 1×
“Without the support threshold, the candidate generation step is no longer applicable and the ‘downward-closure’ property (Agrawal et al ., 1993) that has been heavily employed by support-based techniques is also invalid.”
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
BoosTexter: A Boosting-based System for Text Categorization
Schapire, R. E., & Singer, Y. (2000) · Machine Learning · doi:10.1023/a:1007649029923 · Cited by 2,188
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
CMAR: accurate and efficient classification based on multiple class-association rules
Li, W., Han, J., & Pei, J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989541 · Cited by 1,204
Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000) · Machine Learning · doi:10.1023/a:1007608224229 · Cited by 1,133
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
The Case against Accuracy Estimation for Comparing Induction Algorithms
Provost, F. J., Fawcett, T. E., & Kohavi, R. (1998) · Cited by 1,031
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
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
Mining association rules with multiple minimum supports
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312274 · Cited by 738
Knowledge Discovery in Multi-label Phenotype Data
Clare, A., & King, R. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44794-6_4 · Cited by 726
Fast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
Proceedings of the European Conference on Machine Learning
Brazdil, P. (1993) · Cited by 549
Quinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528 · cited 17×
“For example, the IREP rule induction algorithm constructs the rules based on first-order inductive learner (FOIL)-gain measure (Quinlan & Cameron-Jones, 1993).”
InfluentialIncremental Reduced Error Pruning
Fürnkranz, J., & Widmer, G. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50017-9 · Cited by 439
CAEP: Classification by Aggregating Emerging Patterns
Dong, G., Zhang, X., Wong, L., & Li, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46846-3_4 · Cited by 379
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
A Study of Approaches to Hypertext Categorization
Yang, Y., Slattery, S., & Ghani, R. (2002) · Journal of Intelligent Information Systems · doi:10.1023/a:1013685612819 · Cited by 309
Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining
Heckerman, D. E., Uthurusamy, R., Mannila, H., & Pregibon, D. (1997) · AAAI Press eBooks · Cited by 271
MMAC: A New Multi-Class, Multi-Label Associative Classification Approach
Thabtah, F. A., Cowling, P., & Peng, Y. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10117 · Cited by 224
Self-citationPartial classification using association rules
Ali, K., Manganaris, S., & Srikant, R. (1997) · Cited by 221
Journal of Digital Information Management
(2022) · Journal of Digital Information Management · doi:10.6025/jdim · Cited by 207
Data Mining Tools See5 and C5.0
Quinlan, J. R. (2004) · Medical Entomology and Zoology · Cited by 201
MCAR: multi-class classification based on association rule
Thabtah, F., Cowling, P., & Peng, Y. (2005) · The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005. · doi:10.1109/aiccsa.2005.1387030 · Cited by 170
Self-citationImproving an Association Rule Based Classifier
Liu, B., Ma, Y., & Wong, C. K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_58 · Cited by 160
Classification Using Association Rules: Weaknesses and Enhancements
Liu, B., Ma, Y., & Wong, C. K. (2001) · Massive computing · doi:10.1007/978-1-4615-1733-7_30 · Cited by 144
Proceedings of the 2005 ACM symposium on Applied computing
(2005) · doi:10.1145/1066677 · Cited by 142
Freitas, A. A. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360423 · Cited by 125
Extending naïve Bayes classifiers using long itemsets
Meretakis, D., & Wüthrich, B. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312222 · Cited by 121
Growing decision trees on support-less association rules
Wang, K., Zhou, S., & He, Y. H. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347147 · Cited by 117
Classifying text documents by associating terms with text categories
Zai͏̈ane, O. R., & Antonie, M.-L. (2002) · doi:10.1145/563932.563930 · Cited by 109
An associative classifier based on positive and negative rules
Antonie, M.-L., & Zai͏̈ane, O. R. (2004) · ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD) · doi:10.1145/1008694.1008705 · Cited by 109
A lazy approach to pruning classification rules
Baralis, E., & Garza, P. (2003) · Proceedings · doi:10.1109/icdm.2002.1183883 · Cited by 99
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Das, G., Liu, B., & Yu, P. S. (2004) · doi:10.1145/1008694 · Cited by 51
Using association rules to make rule-based classifiers robust
Hu, H., & Li, J. (2005) · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · Cited by 40
Pruning techniques in associative classification: Survey and comparison
Thabtah, F. (2006) · University of Huddersfield Repository (University of Huddersfield) · Cited by 20
Self-citation
Cited by
Predictive Data Mining for Medical Diagnosis: An Overview of Heart Disease Prediction
Soni, J., Ansari, U., Sharma, D., & Soni, S. (2011) · International Journal of Computer Applications · doi:10.5120/2237-2860 · Cited by 706
A Survey on Malware Detection Using Data Mining Techniques
Ye, Y., Li, T., Adjeroh, D., & Iyengar, S. S. (2018) · ACM Computing Surveys · doi:10.1145/3073559 · Cited by 623
Alcala-Fdez, J., Alcala, R., & Herrera, F. (2011) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2011.2147794 · Cited by 371
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-citationA new machine learning model based on induction of rules for autism detection
Thabtah, F., & Peebles, D. (2020) · Health Informatics Journal · doi:10.1177/1460458218824711 · Cited by 283
Self-citation
Metadata
- Authors
- THABTAH, F.
- Venue
- The Knowledge Engineering Review
- Publisher
- Maximum Academic Press
- Published
- 2007-03
- Volume
- 22
- Issue
- 1
- Pages
- 37-65
- ISSN
- 0269-8889 (ISSN-L)
- 1469-8005
- OpenAlex
- W2138061404
- Cited by
- 282
- References
- 51
- FWCI
- 33.72
- Type
- journal article
- Language
- en
- Open access
- green
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.