About this Course
최근 조회 4,102

다음 전문 분야의 7개 강좌 중 5번째 강좌:

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

초급 단계

완료하는 데 약 9시간 필요

영어

자막: 영어

다음 전문 분야의 7개 강좌 중 5번째 강좌:

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

초급 단계

완료하는 데 약 9시간 필요

영어

자막: 영어

강의 계획 - 이 강좌에서 배울 내용

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>

...
5 videos (Total 33 min), 2 readings, 3 quizzes
5개의 동영상
Which Yeast Genes are Responsible for Wine Making? 6m
Gene Expression Matrices 6m
Clustering as an Optimization Problem 10m
The Lloyd Algorithm for k-Means Clustering 5m
2개의 읽기 자료
Course Details10m
Week 1 FAQs (Optional)
1개 연습문제
Week 1 Quiz20m
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>

...
5 videos (Total 35 min), 1 reading, 3 quizzes
5개의 동영상
From Coin Flipping to k-Means Clustering 4m
Expectation Maximization 7m
Soft k-Means Clustering 3m
Hierarchical Clustering 7m
1개의 읽기 자료
Week 2 FAQs (Optional)
1개 연습문제
Week 2 Quiz15m
3
완료하는 데 1시간 필요

Week 3: Introductory Algorithms in Population Genetics

...
2 readings, 1 quiz
2개의 읽기 자료
Statement on This Week's Material10m
How Have Humans Populated the Earth?10m
1개 연습문제
Week 3 Quiz10m
4.2
11개의 리뷰Chevron Right

33%

이 강좌를 통해 확실한 경력상 이점 얻기

Genomic Data Science and Clustering (Bioinformatics V)의 최상위 리뷰

대학: MMFeb 4th 2019

A nice course to learn clustering algorithm in bioinformatics, it will be better if you take the previous class. Just jump into this class without some pre-knowledge will be quite difficult.

대학: HWJun 10th 2017

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

강사

Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Phillip Compeau

Visiting Researcher
Department of Computer Science & Engineering

캘리포니아 샌디에고 대학교 정보

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

생물 정보학 전문 분야 정보

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!...
생물 정보학

자주 묻는 질문

  • 강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.

  • 강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있고 강좌를 완료하면 수료증을 취득할 수 있습니다. 전자 수료증이 성취도 페이지에 추가되며 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.