Review of dependency estimation with focus on data efficiency: Unterschied zwischen den Versionen

Aktuelle Version vom 11. Januar 2022, 16:40 Uhr

Vortragende(r)	Maximilian Georg
Vortragstyp	Proposal
Betreuer(in)	Bela Böhnke
Termin	Fr 12. November 2021
Vortragsmodus
Kurzfassung	In our data-driven world, large amounts of data are collected in all kinds of environments. That is why data analysis rises in importance. How different variables influence each other is a significant part of knowledge discovery and allows strategic decisions based on this knowledge. Therefore, high-quality dependency estimation should be accessible to a variety of people. Many dependency estimation algorithms are difficult to use in a real-world setting. In addition, most of these dependency estimation algorithms need large data sets to return a good estimation. In practice, gathering this amount of data may be costly, especially when the data is collected in experiments with high costs for materials or infrastructure. I will do a comparison of different state-of-the-art dependency estimation algorithms. A list of 14 different criteria I but together, will be used to determine how promising the algorithm is. This study focuses especially on data efficiency and uncertainty of the dependency estimation algorithms. An algorithm with a high data efficiency can give a good estimation with a small amount of data. A degree of uncertainty helps to interpret the result of the estimator. This allows better decision-making in practice. The comparison includes a theoretical analysis and conducting different experiments with dependency estimation algorithms that performed well in the theoretical analysis.

@@ Zeile 4: / Zeile 4: @@
 |vortragstyp=Proposal
 |betreuer=Bela Böhnke
-|termin=Institutsseminar/2022-01-07
+|termin=Institutsseminar/2021-11-12 Zusatztermin
-|kurzfassung=In our data-driven world where tons of data is collected, dependency estimation is an important tool to get more insight into our data. But many dependency estimation algorithms are hard to use in a real-world setting. In this study, I will do a comparison of different state-of-the-art dependency estimation algorithms. For comparison, a list of different criteria is used and the focus of this study is on data efficiency and uncertainty of the dependency estimation algorithms. The comparison includes a theoretical analysis and a variety of different experiments with an implementation of the dependency estimation algorithm that performed well in the theoretical analysis.
+|kurzfassung=In our data-driven world, large amounts of data are collected in all kinds of environments. That is why data analysis rises in importance. How different variables influence each other is a significant part of knowledge discovery and allows strategic decisions based on this knowledge. Therefore, high-quality dependency estimation should be accessible to a variety of people. Many dependency estimation algorithms are difficult to use in a real-world setting. In addition, most of these dependency estimation algorithms need large data sets to return a good estimation. In practice, gathering this amount of data may be costly, especially when the data is collected in experiments with high costs for materials or infrastructure. I will do a comparison of different state-of-the-art dependency estimation algorithms. A list of 14 different criteria I but together, will be used to determine how promising the algorithm is. This study focuses especially on data efficiency and uncertainty of the dependency estimation algorithms. An algorithm with a high data efficiency can give a good estimation with a small amount of data. A degree of uncertainty helps to interpret the result of the estimator. This allows better decision-making in practice. The comparison includes a theoretical analysis and conducting different experiments with dependency estimation algorithms that performed well in the theoretical analysis.
 }}