Taxonomy trees are used in machine learning, information retrieval, bioinformatics, and multi-agent systems for matching as well as matchmaking in e-business, e-marketplaces, and e-learning. A weighted tree similarity algorithm has been developed earlier which combines matching and missing values between two taxonomy trees. It is shown in this paper that this algorithm has some limitations when...

We present a unification algorithm that automates the process of identifying the testing techniques that are suitable for testing a given class. The algorithm accepts a summary of the class under test and a set of testing techniques available to the developer engaged in performing the test. The summary of the class is based on our taxonomy that maps the features and characteristics of a class i...

We describe a robust approach for linking already existing lexical/semantic hierarchies. We use a constraint satisfaction algorithm (relaxation labelling) to select –among a set of candidates– the node in a target taxonomy that bests matches each node in a source taxonomy. In this paper we present the complete mapping of the nominal, verbal, adjectival and adverbial parts of WordNet 1.5 onto Wo...

The need of taxonomy is vital for knowledge sharing. This need has been portrayed by through-life engineering services/systems. This paper addresses this issue by repair process taxonomy development. Framework for repair process taxonomy was developed followed by its implementation. The importance of repair process taxonomy has been highlighted.

This paper presents a taxonomy of sublinear keyword pattern matching algorithms related to the Boyer-Moore algorithm [BM77) and the Commentz-Walter algorithm [CW79a, CW79b). The taxonomy includes, amongst others, the multiple keyword generalization of the single keyword Boyer-Moore algorithm and an algorithm by Fan and Su [FS93, FS94). The corresponding precomputatioD algorithms are pre~ented a...

This paper presents a taxonomy for Self-organizing Maps (SOMs) for temporal sequence processing. Four main application areas for SOMs with temporal processing have been identified. These are prediction, control, monitoring and data mining. Three main techniques have been used to model temporal relations in SOMs: 1) pre-processing or post-processing the data, but keeping the basic SOM algorithm;...

We address the problem of answering queries over a distributed information system, storing objects indexed by terms organized in a taxonomy. The taxonomy consists of subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. In the first part of the paper, we consider the centralized case, deriving a hypergraph-based algorithm that is efficien...

We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm using a linear-threshold classifier at each node of the taxonomy. These classifiers are trained and evaluated in a hierarchical top-down fashion. We then define a hierachical and parametric data model and prove a bound...