課程信息
4.1
38 個評分
10 個審閱
專項課程

第 5 門課程(共 7 門),位於

100% 在線

100% 在線

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
初級

初級

完成時間(小時)

完成時間大約為9 小時

建議:6 hours/week...
可選語言

英語(English)

字幕:英語(English)...
專項課程

第 5 門課程(共 7 門),位於

100% 在線

100% 在線

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
初級

初級

完成時間(小時)

完成時間大約為9 小時

建議:6 hours/week...
可選語言

英語(English)

字幕:英語(English)...

教學大綱 - 您將從這門課程中學到什麼

1
完成時間(小時)
完成時間為 5 小時

Week 1: Introduction to Clustering Algorithms

<p>Welcome to class!</p><p>At the beginning of the class, we will see how algorithms for&nbsp;<strong>clustering&nbsp;</strong>a set of data points&nbsp;will help us determine how yeast became such good wine-makers. At the bottom of this email is the Bioinformatics Cartoon for this chapter, courtesy of <a href="http://bearandfox.com" target="_blank" title="Link: http://bearandfox.com">Randall Christopher</a> and serving as a chapter header in the Specialization's bestselling <a href="http://bioinformaticsalgorithms.com" target="_blank">print companion</a>. How did the monkey lose a wine-drinking contest to a tiny mammal? &nbsp;Why have Pavel and Phillip become cavemen? And will flipping a coin help them escape their eternal boredom until they can return to the present? Start learning to find out!</p><p><img width="550" alt="" src="http://bioinformaticsalgorithms.com/images/cover/clustering_cropped.jpg" title="Image: http://bioinformaticsalgorithms.com/images/cover/clustering_cropped.jpg"></p>...
Reading
5 個視頻(共 33 分鐘), 2 個閱讀材料, 3 個測驗
Video5 個視頻
Which Yeast Genes are Responsible for Wine Making? 6分鐘
Gene Expression Matrices 6分鐘
Clustering as an Optimization Problem 10分鐘
The Lloyd Algorithm for k-Means Clustering 5分鐘
Reading2 個閱讀材料
Course Details10分鐘
Week 1 FAQs (Optional)分鐘
Quiz1 個練習
Week 1 Quiz20分鐘
2
完成時間(小時)
完成時間為 4 小時

Week 2: Advanced Clustering Techniques

<p>Welcome to week 2 of class!</p> <p>This week, we will see how we can move from a "hard" assignment of points to clusters toward a "soft" assignment that allows the boundaries of the clusters to blend. We will also see how to adapt the Lloyd algorithm that we encountered in the first week in order to produce an algorithm for soft clustering. We will also see another clustering algorithm called "hierarchical clustering" that groups objects into larger and larger clusters.</p>...
Reading
5 個視頻(共 35 分鐘), 1 個閱讀材料, 3 個測驗
Video5 個視頻
From Coin Flipping to k-Means Clustering 4分鐘
Expectation Maximization 7分鐘
Soft k-Means Clustering 3分鐘
Hierarchical Clustering 7分鐘
Reading1 個閱讀材料
Week 2 FAQs (Optional)分鐘
Quiz1 個練習
Week 2 Quiz15分鐘
3
完成時間(小時)
完成時間為 1 小時

Week 3: Introductory Algorithms in Population Genetics

...
Reading
2 個閱讀材料, 1 個測驗
Reading2 個閱讀材料
Statement on This Week's Material10分鐘
How Have Humans Populated the Earth?10分鐘
Quiz1 個練習
Week 3 Quiz10分鐘
4.1
10 個審閱Chevron Right
工作福利

83%

通過此課程獲得實實在在的工作福利

熱門審閱

創建者 HWJun 10th 2017

the part about EM is the best I know, and first time I understand the EM algorithm.

創建者 MKNov 11th 2018

Absolutely fantastic course. Kudos to the course creators.

講師

Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Phillip Compeau

Visiting Researcher
Department of Computer Science & Engineering

關於 University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

關於 Bioinformatics 專項課程

Join Us in a Top 50 MOOC of All Time! How do we sequence and compare genomes? How do we identify the genetic basis for disease? How do we construct an evolutionary Tree of Life for all species on Earth? When you complete this Specialization, you will learn how to answer many questions in modern biology that have become inseparable from the computational approaches used to solve them. You will also obtain a toolkit of existing software resources built on these computational approaches and that are used by thousands of biologists every day in one of the fastest growing fields in science. Although this Specialization centers on computational topics, you do not need to know how to program in order to complete it. If you are interested in programming, we feature an "Honors Track" (called "hacker track" in previous runs of the course). The Honors Track allows you to implement the bioinformatics algorithms that you will encounter along the way in dozens of automatically graded coding challenges. By completing the Honors Track, you will be a bioinformatics software professional! Learn more about the Bioinformatics Specialization (including why we are wearing these crazy outfits) by watching our introductory video. You can purchase the Specialization's print companion, Bioinformatics Algorithms: An Active Learning Approach, from the textbook website. Our first course, "Finding Hidden Messages in DNA", was named a top-50 MOOC of all time by Class Central!...
Bioinformatics

常見問題

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

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心