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

On the min-transitive approximation of symmetric fuzzy relations

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)
Dawyndt, P. ; Lab. of Microbiol., Ghent Univ., Gent, Belgium ; De Meyer, H. ; De Baets, B.

Two new algorithms are proposed for generating a min-transitive approximation of a given reflexive and symmetric fuzzy relation which, in general, deviates less from the given fuzzy relation than its min-transitive closure, and which is guaranteed to be still reflexive and symmetric. Since the new algorithms are weight-driven, they can be used to generate layer by layer the partition tree associated to the corresponding min-transitive approximation. We report on numerical tests that have been carried out on synthetic data to compare the approximations generated by the new algorithms to the min-transitive closure and the min-transitive approximation delivered by the UPGMA clustering algorithm.

Published in:

Fuzzy Systems, 2004. Proceedings. 2004 IEEE International Conference on  (Volume:1 )

Date of Conference:

25-29 July 2004

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.