Block I logo
University of Illinois Urbana-Champaign
Siebel School of Computing and Data Science
Search
Menu
Search

CS 440

CS 440 - Artificial Intelligence

Spring 2024

Title Rubric Section CRN Type Hours Times Days Location Instructor
Artificial Intelligence CS440 Q3 31423 LCD 3 1300 - 1350 M W F   THEAT Lincoln Hall  Mark Hasegawa-Johnson
Artificial Intelligence CS440 Q4 31424 LCD 3 1300 - 1350 M W F   THEAT Lincoln Hall  Mark Hasegawa-Johnson
Artificial Intelligence ECE448 Q3 31425 LCD 3 1300 - 1350 M W F   THEAT Lincoln Hall  Mark Hasegawa-Johnson
Artificial Intelligence ECE448 Q4 31426 LCD 3 1300 - 1350 M W F   THEAT Lincoln Hall  Mark Hasegawa-Johnson

See full schedule from Course Explorer

Official Description

Major topics in and directions of research in artificial intelligence: basic problem solving techniques, knowledge representation and computer inference, machine learning, natural language understanding, computer vision, robotics, and societal impacts. Course Information: Same as ECE 448. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310.

Course Director

Margaret M Fleck
Julia Constanze Hockenmaier

Text(s)

Artificial Intelligence a Modern Approach, 3rd E., by Stuart Russell and Peter Norvig

Learning Goals

Master the theoretical issues and principles underlying AI systems and use this understanding to analyze novel AI systems. (1), (6)
Design and implement illustrative AI systems (2)
Judge realistic vs. unrealistic claims for AI in the popular press, and evaluate the likelihood of success of hypothetical applications of AI as components of larger computer systems. (1)

Topic List

World modeling with symbolic and statistical representations:
First-order logic, formal inference, the qualification problem
Random Variables & Distributions, Conditional independence, Bayes &Markov nets, Parameter estimation
Tradeoffs among expressiveness, efficiency, accuracy, & robustness
Sequential decision making: Classical planning, Reinforcement learning, Markov decision processes
Machine learning:
Supervised, unsupervised, semi-supervised
Linear classifiers: Perceptrons, Naïve Bayes, Logistic regression
Nonlinear classifiers: Neural networks, Support vector machines & kernel methods
Computational learning theory: learnability, VC analysis
Statistical learning theory: error bounds, regularization
AI Applications: NLP, vision, search engines, data mining, collaborative filtering
Social & philosophical implications

Assessment and Revisions

Revisions in last 6 years Approximately when revision was done Reason for revision Data or documentation available? Documentation provided?
Increased coverage of Support Vector Machines & kernel methods Fall 2008 Reflect importance of the topic in the field Informal discussions None
Introduce Markov blanket; less emphais on D-Separation Fall 2010 Reflect new & simplified text treatment Informal discussions None
Included Statistical Learning Theory as a separate topic; less emphasis on Computational Learning Theory fall 2010 Stay current with field Informal discussions None
Increase focus statistical methods while decreasing emphasis of symbolic methods On-going Stay current with field Informal discussions None

Required, Elective, or Selected Elective

Selected Elective.

Last updated

2/3/2019by Margaret M. Fleck

Siebel School of Computing and Data Science

Thomas M. Siebel Center for Computer Science

201 N. Goodwin Avenue, MC-258

Urbana, IL 61801

Phone:

Fax:

Email:

  • ph: 217-333-3426 (general)
  • ph: 217-333-4428 (advising)
  • Graduate Admissions:
  • Graduate Advising:
  • Undergraduate Advising:
  • General Email (not for admissions inquiries):
  • Communications: 
  • Webmaster:

Chicago Office
200 South Wacker Drive, 7th Floor
Chicago, IL 60606

  • About Cookies
  • Privacy Policy
  • Copyright © 2025
  • Accessibility
  • Webmaster
  • Login

Content parser: contentLocalUrls |
Total Parsers:1
Memory used: 437.36KB of 4MB
Render time: 2.511 sec., Version: 3.5.4