このコースについて
4.8
25件の評価
10件のレビュー

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約37時間で修了

推奨:6 weeks, 4-6 hours per week...

英語

字幕:英語

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約37時間で修了

推奨:6 weeks, 4-6 hours per week...

英語

字幕:英語

シラバス - 本コースの学習内容

1
4時間で修了

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件のビデオ (合計66分), 1 reading, 2 quizzes
14件のビデオ
What is formal concept analysis?4 分
Understanding the concept lattice diagram2 分
Reading concepts from the lattice diagram4 分
Reading implications from the lattice diagram5 分
Conceptual clustering6 分
Formal contexts and derivation operators8 分
Formal concepts2 分
Closure operators9 分
Closure systems2 分
Software: Concept Explorer7 分
Many-valued contexts4 分
Conceptual scaling schemas3 分
Scaling ordinal data3 分
1件の学習用教材
Further reading10 分
2の練習問題
Reading concept lattice diagrams
Formal concepts and closure operators
2
4時間で修了

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件のビデオ (合計98分), 3 quizzes
8件のビデオ
Supremum and infimum15 分
Lattices9 分
The basic theorem (I)11 分
The basic theorem (II)12 分
Line diagrams13 分
Context clarification and reduction12 分
Context reduction: an example11 分
3の練習問題
Supremum and infimum30 分
Lattices and complete lattices
Clarification and reduction
3
5時間で修了

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件のビデオ (合計121分), 3 quizzes
13件のビデオ
Drawing a concept lattice diagram4 分
A naive algorithm for enumerating closed sets2 分
Representing sets by bit vectors4 分
Closures in lectic order10 分
Next Closure through an example10 分
The complexity of the algorithm13 分
Basic incremental strategy14 分
An example10 分
The definition of implications10 分
Examples of attribute implications7 分
Implication inference12 分
Computing the closure under implications7 分
3の練習問題
Transposed context30 分
Closures in lectic order
Implications
4
4時間で修了

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件のビデオ (合計67分), 3 quizzes
9件のビデオ
Pseudo-closed sets and canonical basis12 分
Preclosed sets8 分
Preclosure operator6 分
Computing the canonical basis4 分
An example5 分
Complexity issues8 分
Functional dependencies8 分
Translation between functional dependencies and implications5 分
3の練習問題
Implications and pseudo-intents
Canonical basis
Functional dependencies
4.8
10件のレビューChevron Right

33%

コースが具体的なキャリアアップにつながった

人気のレビュー

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

講師

Avatar

Sergei Obiedkov

Associate Professor
Faculty of computer science

ロシア国立研究大学経済高等学院(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...

よくある質問

  • 修了証に登録すると、すべてのビデオ、テスト、およびプログラミング課題(該当する場合)にアクセスできます。ピアレビュー課題は、セッションが開始してからのみ、提出およびレビューできます。購入せずにコースを検討することを選択する場合、特定の課題にアクセスすることはできません。

  • 修了証を購入する際、コースのすべての教材(採点課題を含む)にアクセスできます。コースを完了すると、電子修了証が成果のページに追加されます。そこから修了証を印刷したり、LinkedInのプロフィールに追加したりできます。コースの内容の閲覧のみを希望する場合は、無料でコースを聴講できます。

さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。