New Jersey Institute of Technology
Department of Computer Science
CS670 - Artificial Intelligence -
Fall'2024
Friday 1:00 - 3:50 PM, FMH 319
Course
Description | Outcomes | Readings | Tentative Contents | Grading Policy | Miscellaneous
Chengjun Liu, Ph.D.
Email: cliu@njit.edu
Phone: 973-596-5280
Office: GITC 4306
Office Hours: Thursday 1:00-2:00PM & Friday 4:00-5:30PM or by appointment
Course Description
- This course introduces concepts, approaches and techniques of
artificial intelligence, and focuses on materials that are
fundamental and have a broad scope of applications. Topics
include Problem Solving, Intelligent Agents, Logical Agents,
Propositional Logic Knowledge
Representation and Reasoning, First-Order Logic Knowledge Representation and Reasoning,
Uncertain Knowledge Representation and
Reasoning, Quantifying Uncertainty, Probabilistic Reasoning,
Learning, Statistical Learning Theory, Bayesian Learning,
Decision Tree learning, Neural Networks, Deep Learning, and
Perception.
Measurable
Learning Outcomes
- Students learn the concepts, approaches and techniques of
artificial intelligence.
- Students learn the materials that are fundamental and have a
broad scope of applications in artificial intelligence, such as
Problem Solving, Intelligent Agents, Knowledge and Reasoning,
Logical Agents, Propositional Logic, First-Order Logic,
Uncertain Knowledge and Reasoning, Quantifying Uncertainty,
Probabilistic Reasoning, Learning, General Learning Model,
Decision Tree learning, Unsupervised Learning, Supervised
Learning, Statistical Learning Theory, Structural Risk
Minimization, Support Vector Machine, Perception.
Readings
- S. Russell and P. Norvig, Artificial
Intelligence: A Modern Approach, 4th edition, Prentice Hall, 2020.
- V. N. Vapnik, The Nature of Statistical Learning Theory,
2nd edition, Springer, 2000.
- Selected papers and handouts.
Tentative
Contents
- Introduction
- AI Fundamentals (Turing test,
cognitive science, logic, learning, games, robot, vehicle,
agent)
- AI prehistory and AI history:
connectionism, symbolism, AI winters
- Programming Languages: Lisp, Prolog, Matlab, C/C++, Java
- Related Fields: ML, NN, EC, CV, PR,
IP
- Problem Solving
- Intelligent Agents
- Solving Problems by Searching
- Breadth-first Search, Depth-first Search
- Best-first Search, Greedy Search, A* Search
- Games (Adversarial Search, Alpha-Beta Pruning)
- Knowledge and Reasoning - Logical Agents
- Knowledge-Based Agents
- Logic, Propositional Logic
- Models, Semantics, Inference, Validity
and Satisfiability
- Propositional Theorem Proving,
Resolution, CNF
- Games (Wumpus World)
- Knowledge and Reasoning - First-Order Logic
- FOL Syntax and Semantics
- FOL Sentences, Models, Interpretation
- FOL Quantification, Properties of Quantifiers
- FOL KBs, Deducing Hidden Properties
- Knowledge and Reasoning - Inference in First-Order Logic
- Propositional vs. First-Order Inference
- Universal and Existential Instantiation
- Unification, GMP, Soundness of GMP
- FOL KB and Resolution
- Logic Programming - Prolog
- Uncertain Knowledge and Reasoning - Quantifying Uncertainty
- Acting under Uncertainty
- Uncertainty and Probability
- Syntax and Semantics
- Inference by Enumeration, Normalization
- Uncertain Knowledge and Reasoning - Probabilistic Reasoning
(optional)
- Bayesian Networks
- Hidden Markov Models
- Kalman Filters
- Learning - Theory of Learning
- General Learning Model
- Inductive Learning
- Learning Decision Trees
- Artificial Neural Networks (Perceptrons, RBF, Deep Learning)
- Learning - Unsupervised Learning
- Clustering, K-Means, EM Algorithm
- Principal Component Analysis
- Applications: Compression, Feature Representation
- Learning -
Supervised Learning
- Bayes Classifier, Bayes Decision Rules
- Discriminant Analysis
- Applications: Feature Extraction for Classification
- Learning -Probabilistic Models
- Statistical Learning Theory (STL)
- Structural Risk Minimization (SRM)
- Support Vector Machines (SVM)
- Learning - Other Popular Models (optional)
- Bayesian Learning
- Genetic Algorithms
- Reinforcement Learning
- Perception - Search in Spatial Domain and Frequency Domain (optional)
- FFT, Lowpass
and Highpass Filtering, Convolution
Theorem
- Edge Detection, Line and Curve
Detection (Hough Transform)
- Pictorial Information Search using
Geometric or Frequency
Features
- Action - Robotics (optional)
- Sensors and Vision
- Path Planning
- Moving and Control
Grading Policy
Homework 20%
Midterm exam 20%
Project and presentation (topics are related to our course Contents) 20%
Class attendance and participation 10%
Final exam 30%
Statement on academic integrity:
“Academic Integrity is the cornerstone of higher education and
is central to the ideals of this course and the university.
Cheating is strictly prohibited and devalues the degree that you
are working on. As a member of the NJIT community, it is your
responsibility to protect your educational investment by knowing
and following the academic code of integrity policy that is found
at: NJIT Academic Integrity Code.
Please note that it is my professional obligation and
responsibility to report any academic misconduct to the Dean of
Students Office. Any student found in violation of the code by
cheating, plagiarizing or using any online software
inappropriately will result in disciplinary action. This may
include a failing grade of F, and/or suspension or dismissal from
the university. If you have any questions about the code of
Academic Integrity, please contact the Dean of Students Office at
dos@njit.edu”
Statement
on the use of generative AI tools:
Students should not use generative AI tools for homework
and project assignments.
Miscellaneous