Learn the basic AI techniques, the problems for which they are applicable and their limitations. Topics covered include search algorithms (including heuristic search), knowledge representation, learning algorithms, and elements of probabilistic modeling.
Academic honesty is taken very seriously. It is the responsibility of each student to be familiar with UCI's current academic honesty policies. Please take the time to read the current UCI Senate Academic Honesty Policies. Also you may want to look at the ICS Department's policies on cheating .
There will be one computer project and you will have at least 3 weeks to complete it. The project assignment will be handed out after the first week of classes.
Policy on Late Projects: You will automatically lose 20% for each period of 24 hours for which a project deliverables is late: after 5 days you will receive no credit.
There will be weekly homework assignments that are intended to help you understand material and keep up with what is covered on the lectures. You will be allowed to work in teams of at most 3 people on the assignment. Each person participating in the team must make a significant contribution and turn in her/his own write-up of the problems. The questions similar to the ones in homework will be given on quizzes or exam. Solutions to assignments will be discussed on the discussion sections. Homeworks will account for 20% of your grade.
There will be a 15-20 minute quiz in the beginning of each Wednesday's lecture. The quizzes will account for 30% of your overall grade.
There will be a final exam, closed-book, during finals week. This will account for 30% of your grade.
There will be one computer project, possibly with intermediate deliverables. The project will account for 20% of your grade.
Policy on Regrading: Turn in the paper, with a reason for the request for regrading written down on a separate sheet of paper and a signed statement that the paper wasn't altered in any way, to your TA or instructor within 1 week of receiving it. Note that the entire paper will be regraded which could result in your grade either increasing or decreasing.
Please post questions, suggestions, etc to the ics.171 news group . Also please check this news group for announcements, answers to homework etc. If you don't understand something, others probably don't either and will have the same question.
|
Lecture #, Date |
Lecture Topic, Recommended Reading |
Quiz / Exam |
Homework |
|
L1, Mon. August 9 |
Course Introduction, What is AI? Reading: R.&N. Ch. 1, 2 |
|
HWK 1 handed out |
|
L2, Wed. August 11 |
Statement of Search Problems in AI. Examples. Uninformed Search Reading: R.&N. Ch. 3 (3.1-3.4) |
|
Project Assignment handed out |
|
L3, Fri. August 13 |
Uninformed Search(ctn.), Informed Search Reading: R.&N. Ch. 3, Ch.4 (4.1) |
|
|
|
L4, Mon. August 16 |
Optimal Search, A* algorithm and its properties, IDA*. Reading: R.&N. Ch.4 (4.1 – 4.3) |
Q1, covers L1-L3 |
HWK 1 due. HWK 2 handed out |
|
L5, Wed. August 18 |
Optimization as a Special Type of Search. Constraint Satisfaction Problems. Reading: R.&N. Ch.4 (4.4) |
|
|
|
L6, Fri. August 20 |
Constraint Satisfaction Problems (ctn.) Game playing. Reading: R.&N. Ch.5 (5.1-5.3) |
|
|
|
L7, Mon. August 23 |
Game playing (ctd.) Minimax Search and a -b pruning.Reading: R.&N. Ch.5 (5.1-5.4) |
Q2, covers L4-L6 |
HWK 2 due. HWK 3 handed out |
|
L8, Wed. August 25 |
Knowledge Representation. Propositional Logic. Inference Rules. Reading: R.&N. Ch.6 (6.1-6.4) |
|
|
|
L9, Fri. August 27 |
Knowledge Representation. First order (Predicate) Logic. Reading: R.&N. Ch.7 (7.1), Ch.9(9.1-9.5) |
|
|
|
L10, Mon. August 30 |
Resolution as a Complete Inference Procedure. Examples. Review of Logic. Reading: R.&N. Ch.9 (9.5-9.7) |
Q3, covers L7-L9 |
HWK 3 due. HWK 4 handed out |
|
L11, Wed. Sept. 1 |
Reasoning Under Uncertainty. Rules of Probability. Bayes Rule. Reading: R.&N. Ch. 14 (14.1-14.3) |
|
|
|
L12, Fri. Sept. 3 |
Probabilistic Classification. Naïve Bayes Classifier. Reading: R.&N. Ch. 14 (14.4) |
|
|
|
Mon. Sept. 6 |
***LABOR DAY. NO LECTURE*** |
|
|
|
L13, Wed. Sept. 8 |
Overview of Machine Learning. Types of Learning. Examples. Learning Decision Trees. Reading: R.&N. Ch. 18 (18.1-18.4) |
Q4, covers L10-L12 |
HWK 4 due. HWK 5 handed out |
|
L14, Fri. Sept. 10 |
Perceptron and Neural Networks. Reading: R.&N. Ch. 18 (19.1-19.4) |
|
|
|
L15, Mon. Sept. 13 |
Review |
|
Project is Due. |
|
|
Final Exam according to the Schedule of Classes |
|
HWK 5 is due on the same day as Final |
|
Fri. Sept. 17 |
Grades are Due |
|
|
Thanks to
Professor Padhraic Smyth for the help in the preparation of this page.