Informally, coalition formation is the process of agents forming coalitions (e.g., teams) in order to accomplish tasks, complete goals or in general improve their (individual or collective) situation beyond what each agent could achieve on its own. Much research has been done on this abstract coalition formation problem [12, 15, 14, 16, 17, 4]. However, the informal “coalition formation problem...

Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation load and memory. Parallel Genetic Algorithms (PGAs) are parallel implementations of GAs which can provide considerable gains in terms of performance and scalability. PGAs can easily be implemented on networks of ...

In this research, we propose an integrated classification GANB algorithm that combines a feature extractor with classifier to construct model. The automates the examination of raw pre-processed unstructured documents. Following extraction, categorization generates meaningful classes based on supplied features. study uses genetic (GA) for extraction and Naïve Bayes(NB) purposes. simulation evalu...

We propose a novel algorithm for inducing semantic taxonomies. Previous algorithms for taxonomy induction have typically focused on independent classifiers for discovering new single relationships based on hand-constructed or automatically discovered textual patterns. By contrast, our algorithm flexibly incorporates evidence from multiple classifiers over heterogenous relationships to optimize ...

In this work we present SIFT, a 3-step algorithm for the analysis of the structural information represented by means of a taxonomy. The major advantage of this algorithm is the capability to leverage the information inherent to the hierarchical structures of taxonomies to infer correspondences which can allow to merge them in a later step. This method is particular relevant in scenarios where t...

The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the Boyer-Moore algorithm developed by Horspool. In this paper, I present t...

Taxonomy is widely used in many of the website and directory navigation schemes for content/knowledge retrieval. However, information or content navigation support through taxonomy is often constrained due to its inability to take into account the full nomenclature and cultural nuances of knowledge seekers. The emergence and increasing adoption of collaborative tagging (social bookmarking) tool...

Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (respectively negative examples) are sets of frequent concepts with respect to a minimal support, whose extent contains only positive examples (respectively negative examples). In terms of association rules, the above ...

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this taxonomy is the various flavors of the shortest-path probl...