• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 1 out of 4 pages
Other

Cs 7641 - Final Review Verified Study Guide

Document preview thumbnail
Preview 1 out of 4 pages

CS 7641 - FINAL REVIEW VERIFIED STUDY GUIDE

Content preview

CS 7641 - FINAL REVIEW | VERIFIED STUDY GUIDE

Single Linkage Clustering - Answers - Treat each object as a cluster. Merge the closest
two clusters into a single cluster. Repeat n - k times.

Mutual Information - Answers - how much does one variable say about the other
varibale; or the measure of similarity between two variables

Folk Theorem - Answers - Any acceptable outcome can be a nash equilibrium with the
appropriate discount factor

k-means Clustering - Answers - Pick random k cluster centers. Asssociate each point
with the closest cluster center. Recompute centers by averaging, repeat until
convergence. This converges to a local minima, error decreases, but can get stuck.
Best to do repeated attempts.

Soft Clustering - Answers - Assigning probability to points during clustering

Expectation Maximization - Answers - Performs Expecation: Soft Cluserting "Likelihood
data i element comes from cluster j". Maximization: Calculating means of clusters. Can
allow overlaps of clusters, can get stuck, does not converge

Cluster Properties - Answers - Richness, Scale-invariance, Consistency

Richness - Answers - There is some distance metric D such that any clustering can
work

Scale-Invariance - Answers - The cluster assignments do not change if we change the
scale (e.g. miles vs kilometers)

Consistency - Answers - Shrinking/expanding intracluster distances does not change
the clustering

Impossibility Theorem - Answers - No clustering scheme can achieve all three of:
richness, scale-invarance, and consistency.

Filtering - Answers - Reduce Feature set and then apply learning. Is fast, can use things
like variance, entropy, decision trees, etc.. Can look at labels

Wrapping - Answers - Use Learning to reduce feature set. Much slower than filtering.
Examples are Randomized Optimization algos, forward search and backward search

Forward Search - Answers - Enumerate the features and choose the best combination
of features (e.g. use feature 1 and 3 and test, then 1 and 5, then 2 and 4, etc...)

Document information

Uploaded on
April 15, 2026
Number of pages
4
Written in
2025/2026
Type
Other
Person
Unknown
$12.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
GEEKA
3.8
(379)
Sold
2239
Followers
1451
Items
63784
Last sold
9 hours ago




Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions