课程信息
3,348 次近期查看

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为37 小时

建议:6 weeks, 4-6 hours per week...

英语(English)

字幕:英语(English)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为37 小时

建议:6 weeks, 4-6 hours per week...

英语(English)

字幕:英语(English)

教学大纲 - 您将从这门课程中学到什么

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 个阅读材料, 2 个测验
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 diagrams1小时
Formal concepts and closure operators2小时
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 个测验
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 lattices1小时
Clarification and reduction1小时
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 个测验
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 order1小时
Implications1小时
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 个测验
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-intents1小时
Canonical basis1小时
Functional dependencies1小时
4.8
11 个审阅Chevron Right

33%

通过此课程获得实实在在的工作福利

来自Introduction to Formal Concept Analysis的热门评论

创建者 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.

创建者 RJul 3rd 2019

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

讲师

Avatar

Sergei Obiedkov

Associate Professor
Faculty of computer science

关于 国立高等经济大学

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

常见问题

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您购买证书后,将有权访问所有课程材料,包括评分作业。完成课程后,您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

还有其他问题吗?请访问 学生帮助中心