By Topic

Computationally efficient incremental transitive closure of sparse fuzzy binary 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

2 Author(s)
Wallace, M. ; Sch. of Electr. & Comput. Eng., National Tech. Univ. of Athens, Zographou, Greece ; Kollias, S.

Existing literature in the field of transitive relations focuses mainly on dense, Boolean, undirected relations. With the emergence of a new area of intelligent retrieval, where sparse transitive fuzzy ordering relations are utilized, existing theory and methodologies need to be extended, as to cover the new needs. This work discusses the incremental update of such fuzzy binary relations, while focusing on both storage and computational complexity issues. Moreover, it proposes a novel transitive closure algorithm that has a remarkably low computational complexity (below O(n2)) for the average sparse relation; such are the relations encountered in intelligent retrieval.

Published in:

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

Date of Conference:

25-29 July 2004