Instructor: Dr. Liping Liu, 360 CBA Building, +5947, liping@uakron.edu
Credits: 3 hours
Text Books:
- Stuart Russel and Peter Norvig, Artificial Intelligence - A Modern Approach, Pearson; 4th edition (May 13, 2021)
- Liping Liu, Lecture Notes on Artificial Intelligence
Time and Location: Mondays and Wednesdays: 3:30-4:45 PM; August 26-December 10, 2025. Regular Classroom: CBA 176 (Computer Lab).
Office Hours: 1:30-3:30 PM Mondays and Wednesdays (No appointments are necessary).
Course Description: This course studies modern approaches to intelligent agents that receive percepts and take actions without programming. It covers problem-solving strategies, including search, optimization, and constraint satisfaction, knowledge representation models, automated planning and decision making, and uncertainty modeling and reasoning using Bayesian networks, fuzzy logic, and evidential theory. This course will use Python programming for exercises. Prerequisite: ISM 310
Philosophy: Although deep learning is currently the most popular approach to AI, there are other promising alternatives such as Bayesian learning and genetic programming. This course puts all these approaches into a broad context of inquires into creating automatic agents without human coding. Also, this course will reinforce student's Python programming skills and enhance their mathematical readiness in matrix and probability for AI.
Course Objectives: Upon satisfactory completion of this course, a student should be able to
- Understand the broad context of AI in history, evolution, society, and academic inquiries.
- Understand the common methods for knowledge acquisition, representation, and reasoning in AI
- Use the language of matrices and tensors and probabilistic logic for AI literature
- Use Python language to code common AI algorithms in search, learning, representation, and reasoning.
Weekly Schedule:
- Week 1: Introduction to AI, agents, Turing tests, algorithms, five tribes, machine learning, business applications, and risks
- Week 2: Mathematics: matrix and tensor operations. Numpy package for array operations
- Week 3: Mathematics: uncertainty, probabilities, Bayesian reasoning, sentiment analysis with Naive Bayesian. Python scikit-learn package for Naive Bayesian classifiers
- Week 4: Intelligent Agents: agents, environments, states, precepts, actions, rationality, agent architecture, reflex and learning agents, model-, goal-, and utility-based agents
- Week 5: Exam I
- Week 6: Search Algorithms: problem solving strategies, search problems in business, best-first, breadth-first, depth-first, heuristic search, Python recursion
- Week 7: Optimization algorithms: multicriteria decision-making, decision making under uncertainty, local search, hill-climbing, simulated-annealing, evolutionary algorithms, gradients, Hessian matrix
- Week 8: Constraint Satisfaction: job-shop scheduling, map coloring, Sudoku, constraint propagation, backtracking search, local search
- Week 9: Knowledge-Based Agents: knowledge as rules, propositional logic, theorem proving, forward-and-backward chaining
- Week 10: Exam II
- Week 11: Automated Planning: air cargo transport, blocks world, search algorithms for planning, heuristics for planning, hierarchical planning
- Week 12: Knowledge under Uncertainty: Bayesian networks, conditional independence, d-separation, moral graph, Hidden Markov Fields
- Week 13: Reasoning with Bayesian networks: cliques, Markov trees, Markov blanket, local propagation architectures, soft and hard evidence
- Week 14: Knowledge with Partial Ignorance: Fuzzy Logic, possibility functions, belief functions, focal elements, mass assignments, Dempster's rule of combination
- Week 15: Final Exam (Dec 19-13, 2025)
Exams: This course will have three major exams as scheduled above. Each exam includes both multiple choice and hands-on questions.
Assignments: Homework is assigned once a week for 12 weeks; each consists of conceptual questions and hands-on projects classified into three grading categories: correctness, closeness, and completeness. The correctness problems will be graded by ecourse.org, and closeness questions are graded and/or commented by instructors. Students will earn points automatically for each completeness question if it is finished (it has to be deemed complete). Assignments are due at the beginning of classes meetings on Mondays (except for holidays). No late homework will be graded. Please show your work in a neat and orderly fashion. Write or type your work on one side and in every other line. Use standard size paper (8 1/2'' by 11''). Do not use spiral notebook paper.
Attendance: Attendance is MUST and will be 10% of your final grade. Attendance will be managed by ecourse.org. The formula for computing your attendance grade is non-linear. It will take one point off for the first absence, 2 points off the second, 3 points off the third, and 4 points off the fourth. If you missed the equivalent of three-week classes, you fail the course automatically. Under special situations, you can take some classes online with the following guidelines:
- You must obtain permission from the instructor at least one day ahead of each online session
- Follow the lectures or recordings to perform all in-class hands-on exercises and take notes. Within one day from the class submit your notes and the finished exercises to ecourse.org as Proof of Attendance.
- All weekly assignments are due at the same time as in-person classes. All exams must be onsite.
Quizzes: I will use quizzes regularly to check your completion or preparation of assignments
Makeup: Each student with appropriate excuses may have at most one chance to makeup homework or quiz. Note that it is your privilege but not your right to have this special favor. Also, all makeups must be completed within one week of due date and before answer key is released.
Grades: Your final grades will be calculated by the following formulas:
35% (HW) + 55% (Tests) + 10% (Attendance)
A = 93-100%; A– = 90-92%; B+ = 87-89%; B = 83-86%; B– = 80-82%; C+ = 77-79%; C = 73-76%; C– =70-72%; D = 60-69%; F = 59% and less
Misconduct: Academic misconduct by a student shall include, but not limited to: disruption of classes, giving and receiving unauthorized aid on exams or in the preparation of assignments, unauthorized removal of materials from the library, or knowingly misrepresenting the source of any academic work. Academic misconduct by an instructor shall include, but not limited to: grading student work by criteria other than academic performance or repeated and willful neglect in the discharge of duly assigned academic duties. Convicted violations may result in grade penalties, besides the school official ones, such as increased scrutiny of future submissions, reduced benefits of curving, if any, and/or the reduction of overall grade.
On Collaboration: All for-credit assignments, except for those designated as group projects, must be done independently, and collaboration in providing or asking for answers to those assignments constitutes cheating.
On AI Tools: In this class, I allow students to use AI tools to help their learning. However, submitting AI generated work for credits is a violation of academic code. If a submitted work is suspected to be AI generated, the student will be asked to reproduce the submitted work in front of the instructor.
Looking for additional help? Students looking for additional assistance outside of the classroom are advised to consider working with a peer tutor through Knack. The University of Akron CBA has partnered with Knack to provide students with access to verified peer tutors who have previously aced this course. To view available tutors, visit uakron.joinknack.com and sign in with your student account. At the same time, if you are doing well in this class, please go to uakron.joinknack.com where you can create a verified tutoring profile and begin helping other students.
|
