mirror of
https://github.com/Brandon-Rozek/website.git
synced 2024-11-22 08:16:29 -05:00
193 lines
6.4 KiB
HTML
193 lines
6.4 KiB
HTML
<!DOCTYPE html>
|
|
<html>
|
|
<head>
|
|
<meta charset="utf-8" />
|
|
<meta name="author" content="Fredrik Danielsson, http://lostkeys.se">
|
|
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
|
<meta name="robots" content="noindex" />
|
|
<title>Brandon Rozek</title>
|
|
<link rel="stylesheet" href="themes/bitsandpieces/styles/main.css" type="text/css" />
|
|
<link rel="stylesheet" href="themes/bitsandpieces/styles/highlightjs-github.css" type="text/css" />
|
|
</head>
|
|
<body>
|
|
|
|
<aside class="main-nav">
|
|
<nav>
|
|
<ul>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Findex.html" data-shortcut="">
|
|
Home
|
|
</a>
|
|
</li>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Fcourses.html" data-shortcut="">
|
|
Courses
|
|
</a>
|
|
</li>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Flabaide.html" data-shortcut="">
|
|
Lab Aide
|
|
</a>
|
|
</li>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Fpresentations.html" data-shortcut="">
|
|
Presentations
|
|
</a>
|
|
</li>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Fresearch.html" data-shortcut="">
|
|
Research
|
|
</a>
|
|
</li>
|
|
<li class="menuitem ">
|
|
<a href="index.html%3Ftranscript.html" data-shortcut="">
|
|
Transcript
|
|
</a>
|
|
</li>
|
|
</ul>
|
|
</nav>
|
|
</aside>
|
|
<main class="main-content">
|
|
<article class="article">
|
|
<h1>Cluster Analysis Spring 2018</h1>
|
|
<h3>Distance, Dimensionality Reduction, and Tendency</h3>
|
|
<ul>
|
|
<li>Distance
|
|
<ul>
|
|
<li>Euclidean Distance</li>
|
|
<li>Squared Euclidean Distance</li>
|
|
<li>Manhattan Distance</li>
|
|
<li>Maximum Distance</li>
|
|
<li>Mahalanobis Distance</li>
|
|
</ul></li>
|
|
<li>Which distance function should you use?</li>
|
|
<li>PCA</li>
|
|
<li>Cluster Tendency
|
|
<ul>
|
|
<li>Hopkins Statistic</li>
|
|
</ul></li>
|
|
<li>Scaling Data</li>
|
|
</ul>
|
|
<h3>Validating Clustering Models</h3>
|
|
<ul>
|
|
<li>Clustering Validation</li>
|
|
<li>Cross Validation</li>
|
|
</ul>
|
|
<h3>Connectivity Models</h3>
|
|
<ul>
|
|
<li>Agglomerative Clustering
|
|
<ul>
|
|
<li>Single Linkage Clustering</li>
|
|
<li>Complete Linkage Clustering</li>
|
|
<li>Unweighted Pair Group Method with Arithmetic Mean (If time permits)</li>
|
|
</ul></li>
|
|
<li>Dendrograms</li>
|
|
<li>Divisive Clustering</li>
|
|
<li>CURE (Clustering using REpresentatives) algorithm (If time permits)</li>
|
|
</ul>
|
|
<h3>Cluster Evaluation</h3>
|
|
<ul>
|
|
<li>Internal Evaluation
|
|
<ul>
|
|
<li>Dunn Index</li>
|
|
<li>Silhouette Coefficient</li>
|
|
<li>Davies-Bouldin Index (If time permits)</li>
|
|
</ul></li>
|
|
<li>External Evaluation
|
|
<ul>
|
|
<li>Rand Measure</li>
|
|
<li>Jaccard Index</li>
|
|
<li>Dice Index</li>
|
|
<li>Confusion Matrix</li>
|
|
<li>F Measure (If time permits)</li>
|
|
<li>Fowlkes-Mallows Index (If time permits)</li>
|
|
</ul></li>
|
|
</ul>
|
|
<h3>Centroid Models</h3>
|
|
<ul>
|
|
<li>Jenks Natural Breaks Optimization</li>
|
|
<li>Voronoi Diagram</li>
|
|
<li>K means clustering</li>
|
|
<li>K medoids clustering</li>
|
|
<li>K Medians/Modes clustering</li>
|
|
<li>When to use K means as opposed to K medoids or K Medians?</li>
|
|
<li>How many clusters should you use?</li>
|
|
<li>Lloyd's Algorithm for Approximating K-means (If time permits)</li>
|
|
</ul>
|
|
<h3>Density Models</h3>
|
|
<ul>
|
|
<li>DBSCAN Density Based Clustering Algorithm</li>
|
|
<li>OPTICS Ordering Points To Identify the Clustering Structure</li>
|
|
<li>DeLi-Clu Density Link Clustering (If time permits)</li>
|
|
<li>What should be your density threshold?</li>
|
|
</ul>
|
|
<h3>Analysis of Model Appropriateness</h3>
|
|
<ul>
|
|
<li>When do we use each of the models above?</li>
|
|
</ul>
|
|
<h3>Distribution Models (If time permits)</h3>
|
|
<ul>
|
|
<li>Fuzzy Clusters</li>
|
|
<li>EM (Expectation Maximization) Clustering</li>
|
|
<li>Maximum Likelihood Gaussian</li>
|
|
<li>Probabilistic Hierarchal Clustering</li>
|
|
</ul>
|
|
<h2>Textbooks</h2>
|
|
<p>Cluster Analysis 5th Edition</p>
|
|
<ul>
|
|
<li>Authors: Brian S. Everitt, Sabine Landau, Morven Leese, Daniel Stahl</li>
|
|
<li>ISBN-13: 978-0470749913</li>
|
|
<li>Cost: Free on UMW Library Site</li>
|
|
<li>Amazon Link: <a href="https://www.amazon.com/Cluster-Analysis-Brian-S-Everitt/dp/0470749911/ref=sr_1_1?ie=UTF8&qid=1509135983&sr=8-1">https://www.amazon.com/Cluster-Analysis-Brian-S-Everitt/dp/0470749911/ref=sr_1_1?ie=UTF8&qid=1509135983&sr=8-1</a></li>
|
|
<li>Table of Contents: <a href="http://www.wiley.com/WileyCDA/WileyTitle/productCd-EHEP002266.html">http://www.wiley.com/WileyCDA/WileyTitle/productCd-EHEP002266.html</a></li>
|
|
</ul>
|
|
<p>Cluster Analysis: 2014 Edition (Statistical Associates Blue Book Series 24) </p>
|
|
<ul>
|
|
<li>Author: David Garson</li>
|
|
<li>ISBN: 978-1-62638-030-1</li>
|
|
<li>Cost: Free with Site Registration</li>
|
|
<li>Website: <a href="http://www.statisticalassociates.com/clusteranalysis.htm">http://www.statisticalassociates.com/clusteranalysis.htm</a></li>
|
|
</ul>
|
|
<h2>Schedule</h2>
|
|
<p>In an ideal world, the topics below I estimated being a certain time period for learning them. Of course you have more experience when it comes to how long it actually takes to learn these topics, so I'll leave this mostly to your discretion.</p>
|
|
<p><strong>Distance, Dimensionality Reduction, and Tendency</strong> -- 3 Weeks</p>
|
|
<p><strong>Validating Cluster Models</strong> -- 1 Week</p>
|
|
<p><strong>Connectivity Models</strong> -- 2 Weeks</p>
|
|
<p><strong>Cluster Evaluation</strong> -- 1 Week</p>
|
|
<p><strong>Centroid Models</strong> -- 3 Weeks</p>
|
|
<p><strong>Density Models</strong> -- 3 Weeks</p>
|
|
<p><strong>Analysis of Model Appropriateness</strong> -- 1 Week</p>
|
|
<p>The schedule above accounts for 14 weeks, so there is a week that is free as a buffer.</p>
|
|
<h2>Conclusion</h2>
|
|
<p>Creating this document got me really excited for this independent study. Feel free to give me feedback :)</p>
|
|
</article>
|
|
</main>
|
|
|
|
<script src="themes/bitsandpieces/scripts/highlight.js"></script>
|
|
<script src="themes/bitsandpieces/scripts/mousetrap.min.js"></script>
|
|
<script type="text/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
tex2jax: {
|
|
inlineMath: [ ['$','$'], ["\\(","\\)"] ],
|
|
processEscapes: true
|
|
}
|
|
});
|
|
</script>
|
|
|
|
<script type="text/javascript"
|
|
src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
|
|
</script>
|
|
<script>
|
|
hljs.initHighlightingOnLoad();
|
|
|
|
document.querySelectorAll('.menuitem a').forEach(function(el) {
|
|
if (el.getAttribute('data-shortcut').length > 0) {
|
|
Mousetrap.bind(el.getAttribute('data-shortcut'), function() {
|
|
location.assign(el.getAttribute('href'));
|
|
});
|
|
}
|
|
});
|
|
</script>
|
|
|
|
</body>
|
|
</html>
|