Title :
A Two-step Discretization Algorithm Based on Rough Set
Author :
Xu Chenggang ; Xu Yulong ; Xiao Dawei
Author_Institution :
Inst. of Inf. & Technol., Henan Univ. of Traditional Chinese Med., Zhengzhou, China
Abstract :
A two-step discretization algorithm by dynamic clustering based on Rough set is proposed. The algorithm first discretization for decision table using dynamic clustering algorithm, then discrete again using cut importance discretization algorithms, and obtain the final cut sets, because the dynamic clustering algorithm processing speed is quickly and it impel a lot of breakpoint be screened, thus the operation efficiency of algorithm is increase notable. Finally, simulation results show that the proposed algorithm is correct and high efficiency.
Keywords :
decision tables; knowledge acquisition; pattern clustering; rough set theory; cut importance discretization algorithm; decision table; dynamic clustering algorithm; knowledge acquisition; rough set; two-step discretization algorithm; Algorithm design and analysis; Approximation algorithms; Clustering algorithms; Complexity theory; Heuristic algorithms; Iris recognition; Partitioning algorithms; Discretization; Partition; rough set;
Conference_Titel :
Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4673-0689-8
DOI :
10.1109/ICCSEE.2012.14