Version space retraction with instance-based boundary sets

Concept Lattices

“…One attempt is for instance Wille et al's work on Contextual Logic, where FCA is considered as a theory for concepts as basic units of thought, while concept(ual) graphs are formalizing judgments and conclusions [59,42] (see also [57]). This combination of FCA and conceptual graphs aims thus at one unifying theory for formalizing traditional logic based on the triad concept -judgmentconclusion.…”

“…Version spaces can be defined in different ways: e.g., in terms of sets of maximal and minimal elements [44,45] or in terms of minimal elements and sets of negative examples [59]. They can also be defined in terms of some matching predicate.…”

“…These representations are equivalent, however transformations from one into another are not always polynomially tractable. We will start from the representation with matching predicates, in terms slightly modified as compared with [44,59], in order to avoid collision of FCA terminology and that of machine learning. In the sequel, we shall usually fix L c , L e , and M (c, e) and write VS(E + , E − ) or even just VS for short.…”

Untitled

“…This framework has inspired a number of theoretical works (see (Smith & Rosembloom, 1990;Norton & Hirsh, 1993;Smirnov & Braspenning, 1998) among many others), but is severely limited due to its complexity (Haussler, 1988); further, its strict completeness and correction requirements are ill-suited to real problems.…”

Evolutionary membrane computing: A comprehensive survey and new results

“…This strategy improves algorithms for local search and other global search algorithms such as simulated annealing [33] and tabu search [22]. Also, their stochasticity improves the heuristic artificial intelligence [46,47] and machine-learning algorithms [44,66]. EC mostly involves meta-heuristic optimization techniques and generally includes two broad areas: evolutionary algorithms (EAs) and swarm intelligence [4].…”