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.
Published in:
IT in Medicine and Education, 2008. ITME 2008. IEEE International Symposium on
Date of Conference: 12-14 Dec. 2008