Cart (Loading....) | Create Account
Close category search window
 

Function Bidirectional S-Rough Sets and Bellman principle realize knowledge measure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tian Min-ge ; Math & Comput. Sci. Dept., Sanming Coll., Sanming ; Lu Chang-jing ; Qiu Jin-ming

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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.