Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 233

The DOI matches its Crossref record.

Efficient mining of weighted association rules (WAR)

Open access
Wang, Wei, Yang, Jiong, Yu, Philip S. · 2000 · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

In this paper, we extend the tradition association rule problem by allowing a weight to be associated with each item in a transaction, to re ect interest/intensity of the item within the transaction.This provides us in turn with an opportunity to associate a weight parameter with each item in the resulting association rule.We call it weighted association rule (WAR).WAR not only improves the con dence of the rules, but also provides a mechanism to do more effective target marketing by identifying or segmenting customers based on their potential degree of loyalty o r v olume of purchases.Our approach mines WARs by rst ignoring the weight and nding the frequent itemsets (via a traditional frequent itemset discovery algorithm), and is followed by i n troducing the weight during the rule generation.It is shown by experimental results that our approach not only results in shorter average execution times, but also produces higher quality results than the generalization of previous known methods on quantitative association rules.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/347090.347149

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 233

Metadata

Authors
Wang, W., Yang, J., & Yu, P. S.
Venue
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2000-08
Pages
270-274
OpenAlex
W2057858164
Cited by
233
References
0
FWCI
3.34
Type
conference paper
Language
en
Open access
bronze

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient mining of weighted association rules (WAR). https://app.cochat.ai/papers/10.1145/347090.347149
The paper
Wang, W., Yang, J., & Yu, P. S. (2000). Efficient mining of weighted association rules (WAR). Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/347090.347149

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.