Chapter 14. Principal Component
Analysis
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Principal component analysis is usually used to
reduce the dimensionality of data so that the
data can be further visualized or analyzed in a
low-

Chapter 20. Wavelet Analysis
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Many objects have a periodic behavior and thus show a
unique characteristic in the frequency domain
Human sounds different from some animal sounds in
frequen

Chapter 12. Association Rules
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Association rules uncover items that are
frequently associated together
Market basket analysis uncover what items
customers often purchase together
Nong Ye

Chapter 13. Bayesian Network
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
A Bayes classifier requires all the attribute
variables are independent of each other
A Bayesian network allows associations among
the attribute variables th

Chapter 5. Artificial Neural Networks
for Classification and Prediction
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Artificial Neural Networks (ANNs) use the
basic architecture of human brain which
consists of neurons and connectio

Chapter 9. K-Means Clustering
and Density-based Clustering
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
K-means and density-based clustering
algorithms produce non-hierarchical groups of
similar data points based on the centroid and

Chapter 8. Hierarchical Clustering
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Hierarchical clustering produces groups of
similar data points at different levels of
similarity
Nong Ye
Data Mining: Theories, Algorithms, and Examples

Chapter 4. Decision and
Regression Trees
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Decision and regression trees learn and
express classification and prediction patterns
in the form of a tree
A decision tree classifies the categ

Solving Recurrences
Use a recurrence to characterize the running time of a divide-andconquer algorithm, and solving the recurrence gives us the
asymptotic running time
Examples of recurrence
Chapter 4. Divide-and-Conquer
IEE 605, Nong Ye
4.3 The Substitut

Chapter 1. Introduction to Data,
Data Patterns and Data Mining
Nong Ye
Data Mining: Theories, Algorithms, and Examples
1
Overview
Data mining aims at discovering useful data
patterns from massive amounts of data
1.1 Examples of Small Data Sets
1.2 Type

Insertion Sort: Algorithm Design
Insertion sort algorithm
An incremental approach is used in INSERTION-SORT: having
sorted A[1j-1], place A[j] correctly, so that A[1j] is sorted
Chapter 2. Getting Started
IEE 605, Nong Ye
Insertion Sort: Algorithm Design

Asymptotic Notations
Asymptotic efficiency: focus on the order of growth when input sizes
are large
An asymptotic-efficient algorithm is usually the best choice for all but
very small inputs
Chapter 3. Notations
IEE 605, Nong Ye
Asymptotic Notations
O-not

Algorithms
Algorithm: a sequence of computational steps that transform the input
into the output or solve a well-specified computational problem
An example of a computational problem: a sorting problem:
Input: a sequence of n numbers a , a , , a
1
2
n
O