- 6
- 0
- 约4.03万字
- 约 84页
- 2018-03-26 发布于广东
- 举报
* Data Mining: Concepts and Techniques * Constrain-Based Association Query Database: (1) trans (TID, Itemset ), (2) itemInfo (Item, Type, Price) A constrained asso. query (CAQ) is in the form of {(S1, S2 )|C }, where C is a set of constraints on S1, S2 including frequency constraint A classification of (single-variable) constraints: Class constraint: S ? A. e.g. S ? Item Domain constraint: S? v, ? ? { ?, ?, ?, ?, ?, ? }. e.g. S.Price 100 v? S, ? is ? or ?. e.g. snacks ? S.Type V? S, or S? V, ? ? { ?, ?, ?, ?, ? } e.g. {snacks, sodas } ? S.Type Aggregation constraint: agg(S) ? v, wh
原创力文档

文档评论(0)