Information retrieval is the important work for Electronic Commerce. Ontology-based semantic retrieval is a hotspot of current research. In order to achieve fuzzy semantic retrieval, this paper applies a fuzzy ontology framework to information retrieval system in E-Commerce. The framework includes three parts: concepts, properties of concepts and values of properties, in which property’s value ...

This paper is a survey of fuzzy set theory applied in cluster analysis. These fuzzy clustering algorithms have been widely studied and applied in a variety of substantive areas. They also become the major techniques in cluster analysis. In this paper, we give a survey of fuzzy clustering in three categories. The first category is the fuzzy clustering based on fuzzy relation. The second one is t...

In this note, we continue the works in the paper [Some properties of L-fuzzy approximation spaces on bounded integral residuated lattices", Information Sciences, 278, 110-126, 2014]. For a complete involutive residuated lattice, we show that the L-fuzzy topologies generated by a reflexive and transitive L-relation satisfy (TC)L or (TC)R axioms and the L-relations induced by two L-fuzzy topologi...

We continue in this article the abstract algebraic treatment of quantum sentential logics [39]. The Notions borrowed from the field of Model Theory and Abstract Algebraic Logic AAL (i.e., consequence relation, variety, logical matrix, deductive filter, reduced product, ultraproduct, ultrapower, Frege relation, Leibniz congruence, Suszko congruence, Leibniz operator) are applied to quantum logic...

Information retrieval is the essential task for Traffic Information Service System in Intelligent Transportation Systems (ITS). There a lot of fuzzy traffic information derived from human factor. To achieve fuzzy semantic retrieval, this paper proposes an approach using Resource Description Framework (RDF) and fuzzy ontology. First, we apply RDF data model to represent traffic information on th...

The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation is considered to be a table, then a rectangular subset of the domain whose values under this relation are greater than the values of all neighboring fields is called an island. Consequently, the so called rectangular fu...

A T-fuzzy equivalence relation is a fuzzy binary relation on a set X which is reflexive, symmetric and T-transitive for a t-norm T. Recently, Mesiar et al. [R. Mesiar, B. Reusch, H. Thiele, Fuzzy equivalence relations and fuzzy partitions, J. Multi-Valued Logic Soft Comput. 12 (2006) 167–181] have generalised the t-norm T to any general conjunctor C and investigated the minimal assumptions requ...

The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...

(E;L) denotes an aÆne plane, (E;L; ) an ordered plane, and denotes the congruence relation on E E. If we assume (E;L; ) as an hyperbolic plane, there exists the corresponding theorem for hyperbolic planes (cf. [3]). For both proofs we consider rst the group of motions, in particular the line re ections. For the de nition of a motion and a line re ection we need only a congruence relation (cf. [...

There are fast known algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute T-transitive low approximations of a fuzzy relation. A fast method to compute a T-transitive low approximation of a reflexive and symmetric fuzzy relation is given for any continuous tnorm, spending O(n) time.