Computationally efficient incremental transitive closure of sparse fuzzy binary relations

Wallace, M; Kollias, S

dc.contributor.author	Wallace, M	en
dc.contributor.author	Kollias, S	en
dc.date.accessioned	2014-03-01T02:42:33Z
dc.date.available	2014-03-01T02:42:33Z
dc.date.issued	2004	en
dc.identifier.issn	10987584	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31041
dc.subject	Binary Relation	en
dc.subject	Computational Complexity	en
dc.subject	Transitive Closure	en
dc.subject.other	Binary relations	en
dc.subject.other	Document analysis	en
dc.subject.other	Intelligent retrieval	en
dc.subject.other	Prototype implementations	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Graph theory	en
dc.subject.other	Information retrieval	en
dc.subject.other	Knowledge representation	en
dc.subject.other	Multimedia systems	en
dc.subject.other	Semantics	en
dc.subject.other	Fuzzy sets	en
dc.title	Computationally efficient incremental transitive closure of sparse fuzzy binary relations	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/FUZZY.2004.1375408	en
heal.identifier.secondary	http://dx.doi.org/10.1109/FUZZY.2004.1375408	en
heal.publicationDate	2004	en
heal.abstract	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 paper 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.	en
heal.journalName	IEEE International Conference on Fuzzy Systems	en
dc.identifier.doi	10.1109/FUZZY.2004.1375408	en
dc.identifier.volume	3	en
dc.identifier.spage	1561	en
dc.identifier.epage	1565	en