Title :
Function Bidirectional S-Rough Sets and Bellman principle realize knowledge measure
Author :
Tian Min-ge ; Chang-jing, Lu ; Jin-ming, Qiu
Author_Institution :
Math & Comput. Sci. Dept., Sanming Coll., Sanming
Abstract :
Function bidirectional S-rough sets realizes dynamic template matching between reference template and test template, then calculates the Levenstein distance with dynamic programming algorithm of Bellman principle and finds the knowledge distance measure which can reduce the compute complexity greatly.
Keywords :
computational complexity; dynamic programming; equivalence classes; pattern matching; rough set theory; Bellman principle; Levenstein distance; computational complexity; dynamic pattern matching; dynamic programming algorithm; dynamic template matching; equivalence class; function bidirectional S-rough set; knowledge distance measure; Computer science; Computer science education; Dynamic programming; Educational institutions; Gain measurement; Heuristic algorithms; Optimized production technology; Pattern recognition; Q measurement; Testing;
Conference_Titel :
IT in Medicine and Education, 2008. ITME 2008. IEEE International Symposium on
Conference_Location :
Xiamen
Print_ISBN :
978-1-4244-3616-3
Electronic_ISBN :
978-1-4244-2511-2
DOI :
10.1109/ITME.2008.4743827
