# Suchergebnis: Katalogdaten im Herbstsemester 2017

Computational Biology and Bioinformatics Master More informations at: Link | ||||||

Master-Studium (Studienreglement 2017) | ||||||

Kernfächer Please note that the list of core courses is a closed list. Other courses cannot be added to the core course category in the study plan. Also the assignments of courses to core subcategories cannot be changed. Students need to pass at least one course in each core subcategory. A total of 40 ECTS needs to be acquired in the core course category. | ||||||

Data Science | ||||||

Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
---|---|---|---|---|---|---|

636-0018-00L | Data Mining I | W | 6 KP | 3G + 2A | K. M. Borgwardt | |

Kurzbeschreibung | Data Mining, the search for statistical dependencies in large databases, is of utmost important in modern society, in particular in biological and medical research. This course provides an introduction to the key problems, concepts, and algorithms in data mining, and the applications of data mining in computational biology. | |||||

Lernziel | The goal of this course is that the participants gain an understanding of data mining problems and algorithms to solve these problems, in particular in biological and medical applications. | |||||

Inhalt | The goal of the field of data mining is to find patterns and statistical dependencies in large databases, to gain an understanding of the underlying system from which the data were obtained. In computational biology, data mining contributes to the analysis of vast experimental data generated by high-throughput technologies, and thereby enables the generation of new hypotheses. In this course, we will present the algorithmic foundations of data mining and its applications in computational biology. The course will feature an introduction to popular data mining problems and algorithms, reaching from classification via clustering to feature selection. This course is intended for both students who are interested in applying data mining algorithms and students who would like to gain an understanding of the key algorithmic concepts in data mining. Tentative list of topics: 1. Distance functions 2. Classification 3. Clustering 4. Feature Selection | |||||

Skript | Course material will be provided in form of slides. | |||||

Literatur | Will be provided during the course. | |||||

Voraussetzungen / Besonderes | Basic understanding of mathematics, as taught in basic mathematics courses at the Bachelor's level. | |||||

401-6282-00L | Statistical Analysis of High-Throughput Genomic and Transcriptomic Data (University of Zurich)Der Kurs muss direkt an der UZH belegt werden. UZH Modulkürzel: STA426 Beachten Sie die Einschreibungstermine an der UZH: Link | W | 5 KP | 3G | H. Rehrauer, M. Robinson | |

Kurzbeschreibung | A range of topics will be covered, including basic molecular biology, genomics technologies and in particular, a wide range of statistical and computational methods that have been used in the analysis of DNA microarray and high throughput sequencing experiments. | |||||

Lernziel | -Understand the fundamental "scientific process" in the field of Statistical Bioinformatics -Be equipped with the skills/tools to preprocess genomic data (Unix, Bioconductor, mapping, etc.) and ensure reproducible research (Sweave) -Have a general knowledge of the types of data and biological applications encountered with microarray and sequencing data -Have the general knowledge of the range of statistical methods that get used with microarray and sequencing data -Gain the ability to apply statistical methods/knowledge/software to a collaborative biological project -Gain the ability to critical assess the statistical bioinformatics literature -Write a coherent summary of a bioinformatics problem and its solution in statistical terms | |||||

Inhalt | Lectures will include: microarray preprocessing; normalization; exploratory data analysis techniques such as clustering, PCA and multidimensional scaling; Controlling error rates of statistical tests (FPR versus FDR versus FWER); limma (linear models for microarray analysis); mapping algorithms (for RNA/ChIP-seq); RNA-seq quantification; statistical analyses for differential count data; isoform switching; epigenomics data including DNA methylation; gene set analyses; classification | |||||

Skript | Lecture notes, published manuscripts | |||||

Voraussetzungen / Besonderes | Prerequisites: Basic knowlegde of the programming language R, sufficient knowledge in statistics Former course title: Statistical Methods for the Analysis of Microarray and Short-Read Sequencing Data | |||||

252-0535-00L | Machine Learning | W | 8 KP | 3V + 2U + 2A | J. M. Buhmann | |

Kurzbeschreibung | Machine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects. | |||||

Lernziel | Students will be familiarized with the most important concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. A machine learning project will provide an opportunity to test the machine learning algorithms on real world data. | |||||

Inhalt | The theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data. Topics covered in the lecture include: - Bayesian theory of optimal decisions - Maximum likelihood and Bayesian parameter inference - Classification with discriminant functions: Perceptrons, Fisher's LDA and support vector machines (SVM) - Ensemble methods: Bagging and Boosting - Regression: least squares, ridge and LASSO penalization, non-linear regression and the bias-variance trade-off - Non parametric density estimation: Parzen windows, nearest nieghbour - Dimension reduction: principal component analysis (PCA) and beyond | |||||

Skript | No lecture notes, but slides will be made available on the course webpage. | |||||

Literatur | C. Bishop. Pattern Recognition and Machine Learning. Springer 2007. R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley & Sons, second edition, 2001. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. | |||||

Voraussetzungen / Besonderes | The course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments. Students should at least have followed one previous course offered by the Machine Learning Institute (e.g., CIL or LIS) or an equivalent course offered by another institution. |

- Seite 1 von 1