Download Topics and Events

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
Week
1*
2
3*
4*
5
6*
7
8
Break
9*
10
11*
12
13*
14
Topics and Events
Introduction
“How to Solve It” list
Foundational Skills
Algorithms vs. Heuristics
Problem Organization and Planning
Process
Data Mining Overview
Database Systems
Decision Support Systems
Data Warehousing
Statistical Data Mining
Data Analysis
Data Scrubbing
Bayesian Analysis
Statistical Data Mining
Hypothesis Testing
Regression
Correlation
Classification
Bayesian Classification
K Nearest Neighbors Algorithm
Classification
ID3
CART
Neural Network Supervised Learning
Clustering
Squared Error Clustering
K-Means Clustering
Nearest Neighbor Clustering
BREAK WEEK
Clustering
Clustering with Genetic Algorithms
Self-Organizing Map
Association Rules
Basic Algorithms
Parallel and Distributed Algorithms
Association Rules
Advanced Association Rule Techniques
Measuring the Quality of Rules
Neural Networks
Biological Foundations
Activation Functions
Learning Optimization
Machine Learning
Learning and Memory Models
Supervised Learning Algorithms
Machine Learning
Unsupervised Learning Algorithms
Genetic Algorithms
Biological Foundations
Evolutionary Algorithms
Search (Min-Max) Algorithms
15
Genetic Algorithms
Optimal Solution Algorithms
16
EXAM WEEK
Research Reports
Readings & Assignments
Polya: Pages 1 – 36 and selected topics from Part III
Monty Hall Conundrum exercise
Polya: selected topics from Part III
Choose Student Presentation Topic
Dunham: Pages 1 – 45
Multivariate Analysis exercise
Dunham: Pages 46 – 72
Multivariate Analysis exercise
Noisy Data & Missing Values exercise
Dunham: Pages 46 – 72
Multivariate Classification exercise
Noisy Data & Missing Values exercise
Dunham: Pages 73 – 124
K Nearest Neighbors Algorithm exercise
Dunham: Pages 73 – 124
ID3 exercise
C4.5 exercise
Dunham: Pages 125 – 163
K-Means Clustering exercise
Research Project Proposals Due
None
Dunham: Pages 125 – 163
Self-Organizing Map exercise
Dunham: Pages 164 – 192
Association Rules exercise #1
Dunham: Pages 164 – 192
Association Rules exercise #2
Supplementary Readings
Backpropagation Network exercise
Self-Organizing Map exercise – revisited
Supplementary Readings
Evolutionary Computataion exercise
Noisy Data exercise
Supplementary Readings
Genetic Programming exercise
Evolutionary Optimization exercise #1
Supplementary Readings
Evolutionary Optimization exercise #2
Research Report Due
Research Report Presentations
Related documents