Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
MIG_2019_scRNAseq-workshop
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
BioCellGen-public
MIG_2019_scRNAseq-workshop
Commits
3b553c8c
Commit
3b553c8c
authored
5 years ago
by
Puxue Qiao
Browse files
Options
Downloads
Patches
Plain Diff
correct spelling mistake
parent
01353111
Branches
Branches containing commit
No related tags found
No related merge requests found
Pipeline
#941
passed
5 years ago
Stage: deploy
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
course_files/clust-intro.Rmd
+3
-3
3 additions, 3 deletions
course_files/clust-intro.Rmd
with
3 additions
and
3 deletions
course_files/clust-intro.Rmd
+
3
−
3
View file @
3b553c8c
...
@@ -209,7 +209,7 @@ that are very fast, although not the most accurate approaches.
...
@@ -209,7 +209,7 @@ that are very fast, although not the most accurate approaches.
#### Con
c
ensus clustering (more robustness, less computational speed)
#### Con
s
ensus clustering (more robustness, less computational speed)
##### __Motivation (Two problems of $K$-means)__: \
##### __Motivation (Two problems of $K$-means)__: \
- __Problem1:__ sensitive to initial partitions \
- __Problem1:__ sensitive to initial partitions \
...
@@ -219,7 +219,7 @@ that are very fast, although not the most accurate approaches.
...
@@ -219,7 +219,7 @@ that are very fast, although not the most accurate approaches.
__Solution:__
__Solution:__
Run $K$-means with a range of $K$'s.
Run $K$-means with a range of $K$'s.
##### __Algorithm of con
c
ensus clustering (simpliest version)__:
##### __Algorithm of con
s
ensus clustering (simpliest version)__:
```{r, eval = F, highlight = F}
```{r, eval = F, highlight = F}
for(k in the range of K){
for(k in the range of K){
for(each subsample of the data){
for(each subsample of the data){
...
@@ -252,7 +252,7 @@ Say we partitioned four data points into 2 clusters.
...
@@ -252,7 +252,7 @@ Say we partitioned four data points into 2 clusters.
<center>{width=60%}</center>
<center>{width=60%}</center>
- __Step2:__ Con
c
ensus matrix: \
- __Step2:__ Con
s
ensus matrix: \
Average of all the partitions
Average of all the partitions
<center>{width=30%}</center>
<center>{width=30%}</center>
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment