Chevron Left
Retour à Discrete Math and Analyzing Social Graphs

Avis et commentaires pour d'étudiants pour Discrete Math and Analyzing Social Graphs par Université nationale de recherche, École des hautes études en sciences économiques

5 évaluations
1 avis

À propos du cours

The main goal of this course is to introduce topics in Discrete Mathematics relevant to Data Analysis. We will start with a brief introduction to combinatorics, the branch of mathematics that studies how to count. Basics of this topic are critical for anyone working in Data Analysis or Computer Science. We will illustrate new knowledge, for example, by counting the number of features in data or by estimating the time required for a Python program to run. Next, we will apply our knowledge in combinatorics to study basic Probability Theory. Probability is everywhere in Data Analysis and we will study it in much more details later. Our goals for probability section in this course will be to give initial flavor of this field. Finally, we will study the combinatorial structure that is the most relevant for Data Analysis, namely graphs. Graphs can be found everywhere around us and we will provide you with numerous examples. We will mainly concentrate in this course on the graphs of social networks. We will provide you with relevant notions from the graph theory, illustrate them on the graphs of social networks and will study their basic properties. In the end of the course we will have a project related to social network graphs. As prerequisites we assume only basic math (e.g., we expect you to know what is a square or how to add fractions), basic programming in Python (functions, loops, recursion), common sense and curiosity. Our intended audience are all people that work or plan to work in Data Analysis, starting from motivated high school students....
Filtrer par :

1 - 1 sur 1 Avis pour Discrete Math and Analyzing Social Graphs

par Deleted A

Jan 14, 2020

Great Course. Concise and Easy to Follow. Final Assignment should have been more comprehensive.