This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisition, data analysis and visualization. It provides tools for understanding the data by representing it as a hierarchy of concepts or, more exactly, a concept lattice. FCA can help in processing a wide class of data types providing a framework in which various data analysis and knowledge acquisition techniques can be formulated. In this course, we focus on some of these techniques, as well as cover the theoretical foundations and algorithmic issues of FCA.

oferecido por

## Introduction to Formal Concept Analysis

## Informações sobre o curso

### Resultados de carreira do aprendiz

## 33%

#### 100% on-line

#### Prazos flexíveis

#### Nível intermediário

#### Aprox. 25 horas para completar

#### Inglês

### Resultados de carreira do aprendiz

## 33%

#### 100% on-line

#### Prazos flexíveis

#### Nível intermediário

#### Aprox. 25 horas para completar

#### Inglês

### oferecido por

#### 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.

## Programa - O que você aprenderá com este curso

**5 horas para concluir**

## 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.

**5 horas para concluir**

**15 videos**

**2 leituras**

**2 exercícios práticos**

**4 horas para concluir**

## 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.

**4 horas para concluir**

**8 videos**

**3 exercícios práticos**

**5 horas para concluir**

## 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.

**5 horas para concluir**

**13 videos**

**3 exercícios práticos**

**4 horas para concluir**

## 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.

**4 horas para concluir**

**9 videos**

**3 exercícios práticos**

### Avaliações

##### Principais avaliações do INTRODUCTION TO FORMAL CONCEPT ANALYSIS

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

Was quite hard. Instructor was very helpful. Instructors book helped a lot.

## Perguntas Frequentes – FAQ

Quando terei acesso às palestras e às tarefas?

Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.

O que recebo ao adquirir o Certificado?

Quando você adquire o Certificado, ganha acesso a todo o material do curso, incluindo avaliações com nota atribuída. Após concluir o curso, seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.

Qual é a política de reembolso?

Existe algum auxílio financeiro disponível?

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.