Association Rule

An expression of the form A→C, where A and C are itemsets. A is Antecedent and C is Consequent.

Apriori principle

If an itemset is frequent, then all of its subsets must also be frequent

Statistical Independence

Statistical-based Measures

Lift

lift(A⟹C)=conf(A⟹C)sup(C)=P(A,C)P(A)P(C)

Leverage

leve(A⟹C)=P(A,C)−P(A)P(C)=sup(A∨C)−sup(A)sup(C)

Conviction

conv(A⟹C)=1−sup(C)1−conf(A⟹C)=P(A)(1−P(C))P(A)−P(A,C)

conclusion

Classification

截屏2026-02-08 17.14.52.png

All models are wrong, but some are usefull.

Activation Function Comparison Table

Activation Output Range Derivative Range Zero-Centered? Common Use
Sigmoid (0, 1) (0, 0.25) No Binary output, probability modeling
Tanh (-1, 1) (0, 1) Yes Hidden layers (small networks)
ReLU [0, +inf) 0, 1 No Default for deep hidden layers
LeakyReLU (-inf, +inf) alpha, 1 Partially Fix for dying ReLU
Arctan (-pi/2, pi/2) (0, 1) Yes Smooth alternative to tanh
Softmax (0, 1), sum=1 Complex No Multi-class output layers