Đang chuẩn bị liên kết để tải về tài liệu:
Efficiently mining association rules based on maximum single constraints

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

The present paper focuses on the discovery of association rules in which the left-handed and right-handed sides contain in two user-supplied maximum single constraints. If the constraints appear on or differ from a lattice of closed itemsets (together with their typically undersized generators and supports) that have been mined and saved once, we quickly extract the corresponding frequent sub one. | Efficiently mining association rules based on maximum single constraints