▚ 01 Monotone Constraints 单调性约束

1.1 Definitions 定义

【Monotone Constraints | SpringerLink 】

A constraint C is monotone if and only if for all itemsets S and S′:
if S ⊇ S′ and S violates C, then S′ violates C.

1.2 Key Points 要点

Monotone constraints possess the following property. If an itemset S violates a monotone constraint C, then any of its subsets also violates C. Equivalently, all supersets of an itemset satisfying a monotone constraint C also satisfy C (i.e., C is upward closed). By exploiting this property, monotone constraints can be used for reducing computation in frequent itemset mining with constraints. As frequent itemset mining with constraints aims to find frequent itemsets that satisfy the constraints, if an itemset S satisfies a monotone constraint C, no further constraint checking needs to be applied to any superset of S because all supersets of S are guaranteed to satisfy C. Examples of monotone constraints include min(S. Price) ≤ $30, which expresses that the minimum price of all items in an itemset S is at most $30. Note that, if the minimum price of all items in S is at most $30, adding more items to S would not increase its minimum price (i.e., supersets of S would also satisfy such a monotone constraint).

▚ 02 Anti-monotone Constraints 反单调性约束

2.1 Definitions 定义

【Anti-monotone Constraints | SpringerLink】

A constraint C is anti-monotone if and only if for all itemsets S and S′:
if S ⊇ S′and S satisfies C, then S′ satisfies C.

2.2 Key Points 要点

Anti-monotone constraints possess the following nice property. If an itemset S satisfies an anti-monotone constraint C, then all of its subsets also satisfy C (i.e., C is downward closed). Equivalently, any superset of an itemset violating an anti-monotone constraint C also violates C. By exploiting this property, anti-monotone constraints can be used for pruning in frequent itemset mining with constraints. As frequent itemset mining with constraints aims to find itemsets that are frequent and satisfy the constraints, if an itemset violates an anti-monotone constraint C, all its supersets (which would also violate C) can be pruned away and their frequencies do not need to be counted. Examples of anti-monotone constraints include min(S. Price) ≥ $20 (which expresses that the minimum price of all items in an itemset S is at least $20) and the usual frequency constraint support(S) ≥ minsup (i.e., frequency(S) ≥ minsup). For the former, if the minimum price of all items in S is less than $20, adding more items to S would not increase its minimum price (i.e., supersets of S would not satisfy such an anti-monotone constraint). For the latter, it is widely used in frequent itemset mining, with or without constraints. It states that (i) all subsets of a frequent itemset are frequent and (ii) any superset of an infrequent itemset is also infrequent. This is also known as the Apriori property.

▚ 03 Explanation 解释

假设：我们将S violates C作为事件A，S′ violates C作为事件B；则 S satisfies C为事件not A，then S′ satisfies C为事件not B.

此时，根据Monotone Constraints定义知(A → B)，也即(not B → not A)；
根据Anti-monotonicity Constraints定义知(not A → not B)，也即(B → A)；

因为(A → B)并不一定意味着(B → A)，所以这两者 (Monotone Constraints & Anti-monotonicity Constraints) 的声明是不同的。

▚ 04 Example 示例

For an example. Consider-
C1 = Sum of elements is greater than 5
C2 = Sum of elements is at most 5
U(universe) = Set of non-negative real numbers

In case of C1,
If S violates C1, then S’ obviously violates C1 as well (S being a superset of S’)
Eg. S = {1, 2}, S’ = {2}
Hence C1 is monotonic.

In case of C2,
If S satisfies C2, then S’ obviously satisfies C2 as well (S being a superset of S’)
Eg. S = {1, 2}, S’ = {2}
Hence C2 is anti-monotonic.

▚ 05 数据挖掘的约束限制

Constraint-Based Mining — A General Picture

参考文章

database - What does Antimonotonicity and monotonicity constraint mean? - Code Utility - Code Utility

CS6220: Data Mining Techniques (ucla.edu)

单调性约束与反单调性约束的区别 monotonicity and anti-monotonicity constraint相关推荐

[零散知识]单调性与反单调性约束 Antimonotonicity and monotonicity constraint
Monotonicity constraint: 单调约束具有以下属性.如果项目集S违反单调约束C,则它的任何子集也违反C.等效地,满足单调约束C的项目集的所有超集也满足C(即C向上闭合) 即当且仅当 ...
React学习：双向数据绑定、约束性和非约束性组件-学习笔记
文章目录 React学习:双向数据绑定.约束性和非约束性组件-学习笔记表单约束性和非约束性组件(受限/非受限) 双向数据绑定小例子 React学习:双向数据绑定.约束性和非约束性组件-学习笔记表 ...
sql的外键约束和主键约束_SQL约束
sql的外键约束和主键约束 SQL | 约束条件 (SQL | Constraints) Constraints are the guidelines implemented on the infor ...
MySQL表级约束和列级约束
MySQL中只要支持六种完整性约束,如表所示:其中check约束是MySQL8中提供的支持. 约束条件约束描述 primary key 主键约束,约束的值可唯一的标识对应的记录 not null 非 ...
oracle非延迟约束,Oracle可延迟约束Deferable的使用
标准规定,约束可以是deferrable或not deferrable(默认). not deferrable 约束在每一个DML语句后检查: deferrable 约束可以在每一个insert,de ...
六、约束（主键约束、唯一约束、非空约束、检查约束、外键约束）
## 约束,数据类型,触发器 ## 保证数据的正确性,完整性,有效性 /*主键约束唯一约束非空约束检查约束 (mysql8才有)外键约束默认值约束 */ 1.主键约束 ## 主键约束: 唯一非空 ## ...
【MySQL】（七）SQL约束——主键约束、非空约束、唯一约束、默认值约束、外键约束
目录 1. 主键约束 1.1 SQL 约束 1.2 主键约束 1.3 添加主键约束 1.4 创建主键自增的表 1.5 修改主键自增的起始值 1.6 删除主键约束 1.7 选择主键原则 2. 非空约束 ...
SQL约束(主键约束 primary key、外键约束 foreign key、唯一约束unique 、CHECK约束)
注意: A.表中有数据不能创建约束 B.视图下设置后,要点击保存(只有保存后在才看的到) c 别忘了,点刷新,才会出来呀! 1.主键约束 primary key 主键是每行的唯一标识符,仅仅通过它 ...
22-05-10 西安 mysql基础篇（02）修改表、修改列、commit和rollback、表数据之增删改 DML 、列级约束、表级约束
我们的情绪背后藏着动机,动机总是正面的,因为意识从来不会伤害自己,只是误以为某些行为可以满足自己的这份动机. 结果去重 distinct select distinct 字段列表 from 表名称 [ ...

单调性约束与反单调性约束的区别 monotonicity and anti-monotonicity constraint