{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:20Z","timestamp":1760707100101,"version":"3.40.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Intelligence"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021931008240","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:29Z","timestamp":1048290989000},"page":"119-135","source":"Crossref","is-referenced-by-count":36,"title":["Scoring the Data Using Association Rules"],"prefix":"10.1007","volume":"18","author":[{"given":"Bing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiming","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching Kian","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5112274_CR1","unstructured":"R. Quinlan, C4.5: Program for Machine Learning, Morgan Kaufmann, 1992."},{"key":"5112274_CR2","volume-title":"Classification and Regress Trees","author":"L. Breiman","year":"1984","unstructured":"L. Breiman, J. Friedman, R. Ohlsen, and C. Stone, Classification and Regress Trees, Wadsworth & Brooks: Pacifc Grove, CA, 1984."},{"key":"5112274_CR3","doi-asserted-by":"crossref","unstructured":"R. Kohavi, G. John, R. Long, D. Manley, and K. Pfleger, \u201cMLC++: A machine learning library in C++,\u201d Tools with Artificial Intelligence, 1994, pp. 740\u2013743.","DOI":"10.1109\/TAI.1994.346412"},{"issue":"2\/3","key":"5112274_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29s.","author":"P. Domingos","year":"1997","unstructured":"P. Domingos and M. Pazzani, \u201cOn the optimality of the simple bayesian classifier under zero-one loss,\u201d Machine Learning, vol. 29, nos.2\/3, pp. 103\u2013130, 1997.","journal-title":"Machine Learning"},{"key":"5112274_CR5","unstructured":"R. Quinlan, \u201cBagging, Boosting, and C4.5,\u201d in Proceeding of National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 725\u2013730."},{"key":"5112274_CR6","unstructured":"P. Langley, W. Iba, and K. Thomson, \u201cAn analysis of Bayesian classifiers,\u201d in Proceeding of National Conference on Artificial Intelligence (AAAI-92), 1992, pp. 223\u2013228."},{"key":"5112274_CR7","unstructured":"B. Liu, W. Hsu, and Y. Ma, \u201cIntegrating classification and association rule mining,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998, pp. 80\u201386."},{"key":"5112274_CR8","volume-title":"The Complete Database Marketer","author":"A.M. Hughes","year":"1996","unstructured":"A.M. Hughes, The Complete Database Marketer, Chicago, Ill.: Irwin Professional, 1996."},{"key":"5112274_CR9","unstructured":"C. Ling and C. Li, \u201cData mining for direct marketing: Problems and solutions,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998, pp. 73\u201379."},{"key":"5112274_CR10","doi-asserted-by":"crossref","unstructured":"G. Piatetsky-Shapiro and B. Massand, \u201cEstimating campaign benefits and modelling lift,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), 1999, pp. 185\u2013193.","DOI":"10.1145\/312129.312225"},{"key":"5112274_CR11","unstructured":"R. Agrawal and R. Srikant, \u201cFast algorithms for mining association rules,\u201d in Proceedings of International Conference on Very Large Databases (VLDB-94), 1994, pp. 487\u2013499."},{"key":"5112274_CR12","unstructured":"Y. Freund and R.E. Schapire, \u201cExperiments with a new boosting algorithm,\u201d in Proceedings of the International Conference on Machine Learning (ICML-96), 1996, pp. 148\u2013156."},{"key":"5112274_CR13","unstructured":"Z. Zheng, G. Webb, and K.M. Ting, \u201cLazy Bayesian rules:Alazy semi-naive Bayesian learning technique competitive to boosting decision trees,\u201d in Proceedings of the International Conference on Machine Learning (ICML-99), 1999, pp. 493\u2013502."},{"key":"5112274_CR14","unstructured":"M. Kubat and S. Matwin, \u201cAddressing the curse of imbalanced training sets,\u201d in Proceedings of the International Conference on Machine Learning (ICML-97), 1997, pp. 179\u2013186."},{"key":"5112274_CR15","unstructured":"P.K. Chan and S.J. Stolfo, \u201cTowards scaleable learning with non-uniform class and cost distributions: A case study in credit card fraud detection,\u201d in Proceedings of ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998, pp. 164\u2013168."},{"key":"5112274_CR16","first-page":"263","volume":"2","author":"T. Dietterich","year":"1995","unstructured":"T. Dietterich and G. Baskiri, \u201cSolving multiclass learning problems via error-correcting output code,\u201d Journal of AI research, vol. 2, pp. 263\u2013286, 1995.","journal-title":"Journal of AI research"},{"key":"5112274_CR17","unstructured":"M. Pazzani, C. Merz, P. Murphy, K. Ali, T. Hume, and C. Brunk, \u201cReducing misclassification costs,\u201d in Proceedings of the International Conference on Machine Learning (ICML-97), 1997."},{"key":"5112274_CR18","doi-asserted-by":"crossref","unstructured":"M. Kubat, R. Holte, and S. Matwin, \u201cLearning when negative examples abound,\u201d in Proceedings of the European International Conference on Machine Learning (ECML-97), 1997, pp. 146\u2013153.","DOI":"10.1007\/3-540-62858-4_79"},{"key":"5112274_CR19","unstructured":"F. Provost and T. Fawcettt, \u201cAnalysis and visualization of classifier performance: Comparison under imprecise class and cost distributions,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997, pp. 43\u201348."},{"key":"5112274_CR20","doi-asserted-by":"crossref","unstructured":"G. Dong, X. Zhang, L. Wong, and J. Li, \u201cCAEP: Classification by aggregating emerging patterns,\u201d in Proceedings of Discovery-Science-99, 1999, pp. 30\u201342.","DOI":"10.1007\/3-540-46846-3_4"},{"key":"5112274_CR21","doi-asserted-by":"crossref","unstructured":"D. Meretkis and B. Wuthrich, \u201cExtending na\u00efve bayes classifiers using long itemsets,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), 1999, pp. 165\u2013174.","DOI":"10.1145\/312129.312222"},{"key":"5112274_CR22","doi-asserted-by":"crossref","unstructured":"H. Mannila, D. Pavlov, and P. Smyth, \u201cPrediction with local patterns using cross-entropy,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), 1999, pp. 357\u2013361.","DOI":"10.1145\/312129.312281"},{"key":"5112274_CR23","doi-asserted-by":"crossref","unstructured":"C. Aggarwal and P. Yu, \u201cOnline generation of association rules,\u201d in Proceedings of IEEE International Conference on Data Engineering (ICDE-98), 1998, pp. 402\u2013411.","DOI":"10.1109\/ICDE.1998.655803"},{"key":"5112274_CR24","doi-asserted-by":"crossref","unstructured":"R. Bayardo, R. Agrawal, and D. Gunopulos, \u201cConstraint-based rule mining in large, dense databases,\u201d in Proceedings of IEEE International Conference on Data Engineering (ICDE-99), 1999, pp. 188\u2013197.","DOI":"10.1109\/ICDE.1999.754924"},{"key":"5112274_CR25","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J. Ullman, and S. Tsur, \u201cDynamic itemset counting and implication rules for market basket data,\u201d in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-97), 1997, pp. 255\u2013264.","DOI":"10.1145\/253260.253325"},{"key":"5112274_CR26","doi-asserted-by":"crossref","unstructured":"T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, \u201cData mining using two-dimensional optimized association rules: Scheme, algorithms and visualization,\u201d in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-96), 1996, pp. 13\u201323.","DOI":"10.1145\/233269.233313"},{"key":"5112274_CR27","unstructured":"J. Han and Y. Fu, \u201cDiscovery of multiple-level association rules from large databases,\u201d in Proceedings of International Conference on Very Large Databases (VLDB-95), 1995, pp. 420\u2013431."},{"key":"5112274_CR28","doi-asserted-by":"crossref","unstructured":"R.T. Ng, L. Lakshmanan, and J. Han, \u201cExploratory mining and pruning optimisation of constrained association rules,\u201d in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), 1998, pp. 13\u201324.","DOI":"10.1145\/276304.276307"},{"key":"5112274_CR29","doi-asserted-by":"crossref","unstructured":"R. Rastogi and K. Shim, \u201cMining optimized association rules with categorical and numeric attributes,\u201d in Proceedings of IEEE International Conference on Data Engineering (ICDE\u201398), 1998, pp. 503\u2013512.","DOI":"10.1109\/ICDE.1998.655813"},{"key":"5112274_CR30","unstructured":"H. Toivonen, \u201cSampling large databases for association rules,\u201d in Proceedings of International Conference on Very Large Databases (VLDB-96), 1996, pp. 134\u2013145."},{"key":"5112274_CR31","doi-asserted-by":"crossref","unstructured":"A. Tong, H. Lu, J. Han, and L. Feng, \u201cBreak the barrier of transactions: mining inter-transaction association rules,\u201d in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), 1999, pp. 297\u2013301.","DOI":"10.1145\/312129.312258"},{"key":"5112274_CR32","unstructured":"U.M. Fayyad and K.B. Irani, \u201cMulti-interval discretization of continuous-valued attributes for classification learning,\u201d in Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-93), 1993, pp. 1022\u20131029."},{"key":"5112274_CR33","doi-asserted-by":"crossref","unstructured":"Z. Zheng and G. Webb, \u201cStochastic attribute selection committees with multiple boosting: Learning more accurate and more stable classifier committees,\u201d in Proceedings of Pacific Asia International Conference on Knowledge Discovery and Data Mining (PAKDD-99), 1999, pp. 123\u2013132.","DOI":"10.1007\/3-540-48912-6_17"},{"key":"5112274_CR34","unstructured":"C.J. Merz and P. Murphy, UCI repository of machine learning databases [http:\/\/www.cs.uci.edu\/~mlearn\/MLRepository.html], 1996."},{"key":"5112274_CR35","doi-asserted-by":"crossref","unstructured":"B. Liu, W. Hsu, and Y. Ma, \u201cMining association rules with multiple minimum supports,\u201d in Proceedings of ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), 1999, pp. 337\u2013341.","DOI":"10.1145\/312129.312274"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021931008240.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021931008240\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021931008240.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:55:17Z","timestamp":1747580117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021931008240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5112274"],"URL":"https:\/\/doi.org\/10.1023\/a:1021931008240","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}