Fuzzy Sequential Pattern Mining in Incomplete Databases.
A widely used fuzzy reasoning algorithm was modified and implemented via an expert system to assess the potential risk of employee repetitive strain injury in the workplace. This fuzzy relational model, known as the Priority First Cover Algorithm (PFC), was adapted to describe the relationship between 12 cumulative trauma disorders (CTDs) of the upper extremity, and 29 identified risk factors. The algorithm, which finds a suboptimal subset from a group of variables based on the criterion of priority,...
Every computer vision level crawl with uncertainty, what makes its management a significant problem to be considered and solved when trying for automated systems for scene analysis and interpretation. This is why fuzzy set theory and fuzzy logic is making many inroads into the handling of uncertainty in various aspects of image processing and computer vision.The growth within the use of fuzzy set theory in computer vision is keeping pace with the use of more complex algorithms addressed to solve...
Fuzzy set theory, a recent generalization of classical set theory, has attracted the attention of researchers working in various areas including pattern recognition, which has had a seminal influence in the development of this new theory. This paper attempts to discuss some of the methodologies that have been suggested for pattern recognition, and techniques for image processing and speech recognition.
This article presents an XML[2] based language for the specification of objects in the Soft Computing area. The design promotes reuse and takes a compositional approach in which more complex constructs are built from simpler ones; it is also independent of implementation details as the definition of the language only states the expected behaviour of every possible implementation. Here the basic structures for the specification of concepts in the Fuzzy Logic area are described and a simple construct...
Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.
An overview of direct and inverse fuzzy transforms of three types is given and applications to data processing are considered. The construction and some important properties of fuzzy transforms are presented on the theoretical level. Three applications of -transform to data processing have been chosen: compressional and reconstruction of data, removing noise and data fusion. All of them successively exploit the filtering property of the inverse fuzzy transform.
The weighted average is a well-known aggregation operator that is widely applied in various mathematical models. It possesses some important properties defined for aggregation operators, like monotonicity, continuity, idempotency, etc., that play an important role in practical applications. In the paper, we reveal whether and in which way such properties can be observed also for the fuzzy weighted average operator where the weights as well as the weighted values are expressed by noninteractive fuzzy...
A flexible query model is presented for semi-structured information stored in well-formed XML documents, modeled as XML fuzzy graphs by computing estimates of the importance of the information associated to XML elements and attributes. The notion of fuzzy graph closure with threshold is then used to obtain a fuzzy extension of the XML fuzzy graphs’ topological structure. Weights associated to closure arcs are computed as a conjunction of the importance values of the underlying arcs in the original...
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure...
La elaboración de mapas que incluyen contornos de nivel se hace a partir de un conjunto de puntos dados por sus coordenadas. Existen varias formulaciones analíticas para definir una función de interpolación. En este artículo se propone una variante de la formulación de Little que puede servir para mejorar localmente su funcionamiento. Con objeto de estudiar su rendimiento se describen las alternativas presentes con cuatro ejemplos.