{"doi":"10.1145/170035.170072","title":"Mining association rules between sets of items in large databases","abstract":"We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.","journal":"Proceedings of the 1993 ACM SIGMOD international conference on Management of data","year":1993,"id":8848,"datarank":35.14063223622924,"base_score":9.600488775972455,"endowment":9.600488775972455,"self_citation_contribution":1.4400733163958683,"citation_network_contribution":33.70055891983337,"self_endowment_contribution":1.4400733163958683,"citer_contribution":33.70055891983337,"corpus_percentile":99.3,"corpus_rank":1692,"citation_count":14771,"citer_count":189,"citers_with_citation_signal":189,"citers_with_endowment":189,"datacite_reuse_total":0,"is_dataset":false,"is_oa":true,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"1993-06-01","authors":[{"id":75750,"name":"Tomasz Imieliński","orcid":null,"position":1,"is_corresponding":false},{"id":75751,"name":"Arun Swami","orcid":null,"position":2,"is_corresponding":false},{"id":75749,"name":"Rakesh Agrawal","orcid":null,"position":0,"is_corresponding":true}],"reference_count":14,"raw_metadata":{"citation_network_status":"fetched"},"created_at":"2026-03-01T18:20:47.508186Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}