Über diesen Kurs
3,658

100 % online

Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.

Flexible Fristen

Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.

Stufe „Mittel“

Ca. 37 Stunden zum Abschließen

Empfohlen: 6 weeks, 4-6 hours per week...

Englisch

Untertitel: Englisch

100 % online

Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.

Flexible Fristen

Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.

Stufe „Mittel“

Ca. 37 Stunden zum Abschließen

Empfohlen: 6 weeks, 4-6 hours per week...

Englisch

Untertitel: Englisch

Lehrplan - Was Sie in diesem Kurs lernen werden

Woche
1
4 Stunden zum Abschließen

Formal concept analysis in a nutshell

This week we will learn the basic notions of formal concept analysis (FCA). We'll talk about some of its typical applications, such as conceptual clustering and search for implicational dependencies in data. We'll see a few examples of concept lattices and learn how to interpret them. The simplest data structure in formal concept analysis is the formal context. It is used to describe objects in terms of attributes they have. Derivation operators in a formal context link together object and attribute subsets; they are used to define formal concepts. They also give rise to closure operators, and we'll talk about what these are, too. We'll have a look at software called Concept Explorer, which is good for basic processing of formal contexts. We'll also talk a little bit about many-valued contexts, where attributes may have many values. Conceptual scaling is used to transform many-valued contexts into "standard", one-valued, formal contexts....
14 Videos (Gesamt 66 min), 1 Lektüre, 2 Quiz
14 Videos
What is formal concept analysis?4m
Understanding the concept lattice diagram2m
Reading concepts from the lattice diagram4m
Reading implications from the lattice diagram5m
Conceptual clustering6m
Formal contexts and derivation operators8m
Formal concepts2m
Closure operators9m
Closure systems2m
Software: Concept Explorer7m
Many-valued contexts4m
Conceptual scaling schemas3m
Scaling ordinal data3m
1 Lektüre
Further reading10m
2 praktische Übungen
Reading concept lattice diagrams
Formal concepts and closure operators
Woche
2
4 Stunden zum Abschließen

Concept lattices and their line diagrams

This week we'll talk about some mathematical properties of concepts. We'll define a partial order on formal concepts, that of "being less general". Ordered in this way, the concepts of a formal concept constitute a special mathematical structure, a complete lattice. We'll learn what these are, and we'll see, through the basic theorem on concept lattices, that any complete lattice can, in a certain sense, be modelled by a formal context. We'll also discuss how a formal context can be simplified without loosing the structure of its concept lattice....
8 Videos (Gesamt 98 min), 3 Quiz
8 Videos
Supremum and infimum15m
Lattices9m
The basic theorem (I)11m
The basic theorem (II)12m
Line diagrams13m
Context clarification and reduction12m
Context reduction: an example11m
3 praktische Übungen
Supremum and infimum30m
Lattices and complete lattices
Clarification and reduction
Woche
3
5 Stunden zum Abschließen

Constructing concept lattices

We will consider a few algorithms that build the concept lattice of a formal context: a couple of naive approaches, which are easy to use if one wants to build the concept lattice of a small context; a more sophisticated approach, which enumerates concepts in a specific order; and an incremental strategy, which can be used to update the concept lattice when a new object is added to the context. We will also give a formal definition of implications, and we'll see how an implication can logically follow from a set of other implications....
13 Videos (Gesamt 121 min), 3 Quiz
13 Videos
Drawing a concept lattice diagram4m
A naive algorithm for enumerating closed sets2m
Representing sets by bit vectors4m
Closures in lectic order10m
Next Closure through an example10m
The complexity of the algorithm13m
Basic incremental strategy14m
An example10m
The definition of implications10m
Examples of attribute implications7m
Implication inference12m
Computing the closure under implications7m
3 praktische Übungen
Transposed context30m
Closures in lectic order
Implications
Woche
4
4 Stunden zum Abschließen

Implications

This week we'll continue talking about implications. We'll see that implication sets can be redundant, and we'll learn to summarise all valid implications of a formal context by its canonical (Duquenne–Guigues) basis. We'll study one concrete algorithm that computes the canonical basis, which turns out to be a modification of the Next Closure algorithm from the previous week. We'll also talk about what is known in database theory as functional dependencies, and we'll show how they are related to implications....
9 Videos (Gesamt 67 min), 3 Quiz
9 Videos
Pseudo-closed sets and canonical basis12m
Preclosed sets8m
Preclosure operator6m
Computing the canonical basis4m
An example5m
Complexity issues8m
Functional dependencies8m
Translation between functional dependencies and implications5m
3 praktische Übungen
Implications and pseudo-intents
Canonical basis
Functional dependencies
4.8
10 BewertungenChevron Right

33%

ziehen Sie für Ihren Beruf greifbaren Nutzen aus diesem Kurs

Top-Bewertungen

von EVFeb 21st 2019

It is a very nice course, I fully recommend it. It is very good organized and explained. The task some of them are challenge.

Dozent

Avatar

Sergei Obiedkov

Associate Professor
Faculty of computer science

Über National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

Häufig gestellte Fragen

  • Sobald Sie sich für ein Zertifikat angemeldet haben, haben Sie Zugriff auf alle Videos, Quizspiele und Programmieraufgaben (falls zutreffend). Aufgaben, die von anderen Kursteilnehmern bewertet werden, können erst dann eingereicht und überprüft werden, wenn Ihr Unterricht begonnen hat. Wenn Sie sich den Kurs anschauen möchten, ohne ihn zu kaufen, können Sie womöglich auf bestimmte Aufgaben nicht zugreifen.

  • Wenn Sie ein Zertifikat erwerben, erhalten Sie Zugriff auf alle Kursmaterialien, einschließlich bewerteter Aufgaben. Nach Abschluss des Kurses wird Ihr elektronisches Zertifikat zu Ihrer Seite „Errungenschaften“ hinzugefügt – von dort können Sie Ihr Zertifikat ausdrucken oder es zu Ihrem LinkedIn Profil hinzufügen. Wenn Sie nur lesen und den Inhalt des Kurses anzeigen möchten, können Sie kostenlos als Gast an dem Kurs teilnehmen.

Haben Sie weitere Fragen? Besuchen Sie das Hilfe-Center für Teiln..