Algorithm 1: Dependency based attribute reduction algorithm

Input:, threshold of SU: σ

Output: List (d-table)

1

Traverse every item in A as d

2

Set d as the decision attribute, the others in A as the condition attribute C, get decision table d-table

3

Get all the d-table in I, named as List (d-table)

4

Traverse dt in List (d-table)

5

Traverse every item c in C

6

Calculate su of c and d.

7

If su < σ, delete c in C of dt

8

Traverse dt in List (d-table)

9

Traverse c in C of dt

10

Traverse other items c’ in C

11

Calculate su’ between c and c’

12

Set the SU between c’ and d as su

13

If su’ < su, delete c’ in C of dt

14

Return List (d-table)