• CS 3600 Intro to Artificial Intelligence — Spring 2020


    CS 3600 Intro to Artificial Intelligence — Spring 2020

    Course description

    CS 3600 - Introduction to Artificial Intelligence is a 3-credit introductory course intended for undergraduates. Artificial Intelligence is subfield of Computer Science which covers the design, implementation, and analysis of computational systems that can be said to reason, learn, or act rationally. This course presents a broad overview of this material using an agent based approach, and has a particular focus on the details of implementation. The class is programming intensive, and a strong background in the programming language of the assignments (Python) will be very useful.

    Learning objectives:

    • To provide a broad survey of algorithms and approaches in AI.
    • To develop a deeper understanding of several major algorithms in AI.
    • To develop the design and programming skills that will help you to build computational artifacts that act intelligently.
    • To develop the basic skills necessary to pursue research in AI.

    Prerequisites. The official prerequisite for this course is CS 1332, although familiarity in the following topics will be useful:

    • Probability
    • Linear algebra
    • Calculus
    • Data structures
    • Computational complexity

    TextbookArtificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig, Third edition. ISBN: 978‑0136042594.
    Readings for each week are given in the schedule below, and ideally should be completed before class so you can bring your questions to class.

    Projects

    All project submissions will be handled through Canvas, and are due by the date and time listed there. Submissions by email will not be accepted.

    Late Policy

    You have three free late days to be used at your discretion thoughout the semester. That means you might turn in one assignment two days late or two different assignments one day late, etc. A free late day is "used" one minute after an assignment due date. A second free late day is "used" 24 hours and one minute after the due date. A third free late day is used 48 hours and one minute after the due date. After the free late days are exhausted, you will receive a 20% penalty per day.

    Project 1: This project asks you to solve a variety of search tasks, using the techniques covered in the first 4 to 5 weeks of the class. The schedule below has a tentative due date, but be sure to check on Canvas for updates.

    Project 2: This project covers MDPs and Reinforcement Learning approaches to solving problems in environments with action stochasticity.

    Project 3: This project covers inference and filtering in Bayesian Networks.

    Project 4: This project covers Machine Learning using Decision Trees.

    Exams

    There will be two exams in this class, a midterm and a final (cumulative). The date for the midterm may differ from what is listed below, but the intent is for you to have as much feedback as possible before the grade-change deadline. The date for the final is fixed by the registrar. You are allowed one 8.5x11in sheet of notes, front and back. There will be no make up exam unless previously arranged (well in advance), or excused by the Dean of Students.

    Grading policies

    Your TAs and I will strive to provide you reasonably detailed and timely feedback on every assignment and exam. If you have any questions about any of your grades please reach out to us, either by coming to scheduled office hours or via your "@gatech.edu" email address. If there is an error with your grade, please contact us within a week of when feedback is returned, otherwise we might not be able to change it.

    Point breakdown:

    • Projects: 60% (15% each)
    • Midterm: 20%
    • Final: 20%

    Academic Integrity
    All of the assignments in this class are individual work only. There are absolutely solutions to some of these assignments on the Internet. Do not use them. If you can find them, so can we, and we will check. It's probably a bad idea to even look for them, even for "an idea of how to start" because once you see one solution, its hard not to think of it as the solution. If you do wind up "just looking", make sure you document it in your code. Otherwise, you run the risk of appearing to misrepresent another's work as your own. When in doubt, be explicit about where the code came from.

    Being a student at Georgia Tech can be very stressful, and it's far too easy to overload your semester with difficult or time-intensive classes. When you have multiple assignments due in the same week, sometimes you have to decide how much time you can spend on each one, and sometimes there just aren't enough hours in the day. Come and talk to me about it, there's probably some way we can make things work. I'm far more willing to give extensions, hold extra office hours, and curve than I am willing to overlook violations of the honor code.

    https://github.com/yanshengjia/ml-road/blob/master/resources/Artificial%20Intelligence%20-%20A%20Modern%20Approach%20(3rd%20Edition).pdf

    http://aima.cs.berkeley.edu/     第四版都有了

     这个本书的C#代码  https://github.com/aimacode/aima-csharp

  • 相关阅读:
    [HDOJ1827]Summer Holiday(强连通分量,缩点)
    [CF676C]Vasya and String(尺取法,原题)
    [51NOD1105]第k大的数(二分答案)
    [51NOD]BSG白山极客挑战赛
    [HDOJ4635]Strongly connected(强连通分量,缩点)
    Miller_Rabin(米勒拉宾)素数测试算法
    hdu 3501 Calculation 2 欧拉函数
    codeforces 350 div2 D Magic Powder
    codeforces 350 div2 C. Cinema map标记
    hdu 2824 The Euler function 欧拉函数打表
  • 原文地址:https://www.cnblogs.com/chucklu/p/14753622.html
Copyright © 2020-2023  润新知