Conceptual Exploration by Bernhard Ganter, Sergei Obiedkov

By Bernhard Ganter, Sergei Obiedkov

This is the 1st textbook on characteristic exploration, its concept, its algorithms forapplications, and a few of its many attainable generalizations. characteristic explorationis important for buying established wisdom via an interactive strategy, byasking queries to knowledgeable. Generalizations that deal with incomplete, defective, orimprecise info are mentioned, however the concentration lies on wisdom extraction from areliable info source.The process relies on Formal proposal research, a mathematical conception ofconcepts and proposal hierarchies, and makes use of its expressive diagrams. The presentationis self-contained. It presents an creation to Formal proposal Analysiswith emphasis on its skill to derive algebraic constructions from qualitative data,which will be represented in significant and certain graphics.

Show description

Read or Download Conceptual Exploration PDF

Best data mining books

Machine Learning: The Art and Science of Algorithms that Make Sense of Data

As some of the most complete computer studying texts round, this publication does justice to the field's excellent richness, yet with out wasting sight of the unifying rules. Peter Flach's transparent, example-based process starts through discussing how a junk mail clear out works, which supplies an instantaneous advent to laptop studying in motion, with at the very least technical fuss.

Fuzzy logic, identification, and predictive control

The complexity and sensitivity of contemporary commercial tactics and structures more and more require adaptable complex keep watch over protocols. those controllers must be in a position to care for conditions tough ôjudgementö instead of easy ôyes/noö, ôon/offö responses, situations the place an obscure linguistic description is usually extra correct than a cut-and-dried numerical one.

Data Clustering in C++: An Object-Oriented Approach

Info clustering is a hugely interdisciplinary box, the aim of that's to divide a suite of items into homogeneous teams such that items within the comparable team are related and items in numerous teams are rather particular. millions of theoretical papers and a few books on information clustering were released during the last 50 years.

Fifty Years of Fuzzy Logic and its Applications

Finished and well timed document on fuzzy common sense and its applications
Analyzes the paradigm shift in uncertainty administration upon the advent of fuzzy logic
Edited and written by way of most sensible scientists in either theoretical and utilized fuzzy logic

This e-book provides a complete record at the evolution of Fuzzy common sense on the grounds that its formula in Lotfi Zadeh’s seminal paper on “fuzzy sets,” released in 1965. additionally, it includes a stimulating sampling from the large box of analysis and improvement encouraged by way of Zadeh’s paper. The chapters, written via pioneers and famous students within the box, convey how fuzzy units were effectively utilized to man made intelligence, keep an eye on idea, inference, and reasoning. The e-book additionally reviews on theoretical matters; good points contemporary functions of Fuzzy common sense within the fields of neural networks, clustering, information mining and software program trying out; and highlights an enormous paradigm shift brought on by Fuzzy common sense within the zone of uncertainty administration. Conceived by way of the editors as a tutorial occasion of the fifty years’ anniversary of the 1965 paper, this paintings is a must have for college students and researchers keen to get an inspiring photo of the prospects, boundaries, achievements and accomplishments of Fuzzy Logic-based systems.

Topics
Computational Intelligence
Data Mining and data Discovery
Control
Artificial Intelligence (incl. Robotics)

Additional info for Conceptual Exploration

Sample text

4 The closure system of closure systems A closure system on M is a set of subsets of M which is closed under arbitrary intersections. There are many closure systems, even when the base set M is of modest size. Their numbers are known up to |M | = 7 [121, 64]: Size of the base set M Number of closure systems |M | # closure syst. 0 1 6 75 973 751 474 1 2 2 7 3 61 4 2 480 5 1 385 552 7 14 087 648 235 707 352 472 The intersection of arbitrary many closure systems (on the same base set) is again a closure system.

11 and follow the descending paths from the corresponding nodes in the diagram. There is always a unique highest point where these paths meet, that is, the highest concept that is below both, namely, the infimum. Any other concept below both can be reached from the highest one on a descending path. Similarly, for any two formal concepts there is always the lowest node (the supremum of the two) that can be reached from both concepts via ascending paths. And any common superconcept of the two is on an ascending path from their supremum.

Chapter 2 An algorithm for closure systems The knowledge acquisition algorithm that is the central theme of our book can most naturally be phrased in the language of Formal Concept Analysis. It essentially relies on a single property of concept lattices, namely, that the set of concept intents is closed under intersection. The technique works for an arbitrary intersection-closed family of sets, that is, for a closure system. Readers who are familiar with closure systems but not with Formal Concept Analysis may prefer this approach.

Download PDF sample

Rated 4.45 of 5 – based on 32 votes