Data Mining Algorithms: Unsupervised Learning

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/17

flashcard set

Earn XP

Description and Tags

Flashcards created based on the lecture notes covering key concepts of unsupervised learning, clustering, outlier detection, and frequent pattern mining, including algorithms and applications.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No study sessions yet.

18 Terms

1
New cards

What is the main difference between supervised and unsupervised learning?

In supervised learning, the training data is labeled with class information, whereas in unsupervised learning, class labels are unknown and the goal is to find structures or patterns in the data.

2
New cards

What is clustering in data mining?

Clustering is the process of grouping a set of data objects into clusters, where objects in the same cluster are similar to each other and dissimilar to objects in other clusters.

3
New cards

What are some common applications of clustering?

Clustering is used in preprocessing, image databases, pattern recognition, spatial data analysis, business intelligence, and biology, among others.

4
New cards

What is the k-means clustering algorithm?

The k-means algorithm partitions data into k clusters by minimizing the variance within each cluster.

5
New cards

What is the Silhouette Coefficient?

The Silhouette Coefficient measures how similar an object is to its own cluster compared to other clusters, providing an indication of the quality of clustering.

6
New cards

Define DBSCAN in the context of density-based clustering.

DBSCAN is a density-based clustering algorithm that groups together points that are closely packed together, marked as core points, and marks points as noise if they lie alone in low-density regions.

7
New cards

What is a key strength of the k-means clustering algorithm?

K-means is relatively efficient and easy to implement.

8
New cards

What is the challenge of choosing the parameter k in k-means clustering?

Choosing the correct number of clusters k is crucial as it directly affects the results; too few clusters may lump distinct groups together, while too many may overfit the data.

9
New cards

What is the role of the Expectation-Maximization (EM) algorithm in clustering?

The EM algorithm is used in clustering for finding maximum likelihood estimates of parameters in probabilistic models, iterating between estimating distributions and maximizing likelihood.

10
New cards

What does the term 'outlier' refer to in the context of data mining?

An outlier is an observation that deviates significantly from the majority of the data points, which may indicate abnormal behavior.

11
New cards

What are three types of outliers identified in data mining?

Clustering-based outliers, statistical outliers, and density-based outliers.

12
New cards

What is frequent pattern mining?

Frequent pattern mining involves discovering patterns, associations, and correlations among sets of items or objects in transaction databases.

13
New cards

What is the Apriori algorithm?

The Apriori algorithm is a classic algorithm used for mining frequent itemsets and sequential patterns by leveraging the property that a subset of a frequent itemset must also be a frequent itemset.

14
New cards

Define the term 'support' in the context of frequent itemset mining.

Support is the frequency with which an itemset appears in the database, calculated as the proportion of transactions containing the itemset.

15
New cards

What is the main limitation of the k-means algorithm?

K-means clustering is sensitive to outliers and requires specifying the number of clusters k in advance.

16
New cards

Describe the concept of hierarchical clustering.

Hierarchical clustering builds a tree of clusters (dendrogram) by either agglomerating smaller clusters into larger ones or dividing larger clusters into smaller ones.

17
New cards

What is association rule mining?

Association rule mining aims to identify interesting relationships between variables in large datasets, typically revealed through rules of the form 'X implies Y'.

18
New cards

What does the term 'confidence' refer to in association rule mining?

Confidence is the measure of the likelihood of item Y being bought when item X is bought, calculated as the proportion of transactions containing X that also contain Y.