CS 251: Syllabus

Syllabus for Spring 2016, Section A

Topics and Reading Assignments


Learning Goals

  1. Students understand and can write programs to store and manipulate data and measurements.
  2. Students understand and can implement the fundamental concepts of interactive visualization of data.
  3. Students understand and can implement common data transformations and statistical analysis.
  4. Students understand and can make appropriate use of current machine learning techniques for prediction and knowledge discovery.
  5. Students present methods, algorithms, results, and designs in an organized and competently written manner.
  6. Students gain experience working with real data from disciplines outside computer science.

Grading rubric and course goals.


Textbooks

Witten, Frank, and Hall, Data Mining: Practical Machine Learning Tools and Techniques, Morgan Kaufmann, 2011, 3rd Ed.


Grading

Weekly Projects 45%
Quizzes 25%
Homeworks 5%
Class Participation 5%
Final Exam 20%

This course covers the analysis and visualization of scientific data. Topics will include data management, basic statistical analysis, data mining techniques, and the fundamental concepts of machine learning. Students will also learn how to visualize data using 2-D and 3-D graphics, focusing on techniques that highlight patterns and relationships. Course projects will use data from active research projects at Colby.


Daily Topics and Readings

WeekTopicsReading
1:
  • Visualization
  • Coordinate Systems and Transformations
  • Homogeneous Coordinates
Tkinter tutorials
2:
  • Defining 2D and 3D Viewing Systems
  • 2D and 3D Viewing Pipeline
  • User Interaction and View Parameters
Numpy tutorials
3:
  • Interactive camera control
  • Data Representations and Storage
  • Defining Views Given a Data Set (Quiz)
Lecture notes
4:
  • Numeric Computation: Computing a Sum
  • Normalizing Data
  • Representing Data Using Color
Lecture notes
5:
  • Computing Ranges
  • Histograms and Bucket Selection
  • (Quiz)
Lecture notes
6:
  • Linear Regression
  • Multiple Linear Regression
  • Covariance Matrix and PCA
Lecture Notes
7:
  • SVD and Eigenspaces
  • Eigenvalues and Eigenvectors
  • Measurement, Variation, and Noise (Quiz)
Lecture Notes

Spring Break
8:
  • Clustering
  • Kmeans, ISODATA, Online Clustering
  • Estimating the Number of Clusters
Maxwell & Buddemeier, Lecture Notes
9:
  • Fuzzy C Means
  • Distance Metrics
  • Dynamic Time Warp Matching(Quiz)
Lecture Notes
10:
  • Pattern Recognition, No Free Lunch / Ugly Duckling Theorems
  • NN, KNN, Naive Bayes, Decision Tree Classifiers
  • K-D Trees,
Moore K-D Trees, Lecture Notes
11:
  • Decision Trees
  • Regression Trees
  • Locally-Weighted Linear Regression (Quiz)
Lecture Notes
12:
  • Artificial Neural Networks
  • Training ANNs
  • Modern ANN Systems
Lecture Notes
13:
  • Topics in Bioinformatics
  • BLAST Algorithm
  • Review (Quiz)
Lecture Notes

Policies

Attendance and Participation

For this course to be truly successful, your presence and participation are important. This course covers material that is new enough that the lectures and materials provided by the professor will be the primary resource for the course. Asking questions in class is an important part of learning. When you have a question, ask it. It is highly probable that one of your classmates has the same question. When you have an opportunity to share your opinion or your answer, please speak up. Your professor wants to hear what you have to say. And, of course, to participate in class you must attend class. If you must miss a class, you are responsible for making up the material covered in that lecture.

Deadlines

The short homework assignments must be turned in on time. No late short assignments will be accepted because we will refer to their solutions in class. The longer programming assignments must be turned in on time for maximal credit. Late projects (programming assignments) will be accepted, but will be given reduced grades. It is better to hand in a mostly functional project on time than to be late with something that might be better.

Collaboration

Collaboration on programming assignments is encouraged, but you as an individual are responsible for understanding all the material in the assignment. If you have had a substantative discussion of any programming solution with a classmate, then be sure to cite them in your write-up or comments. If you are unsure of what constitutes "substantative", then ask the professor or err on the side of caution. You will not be penalized for working together. However, you must not copy answers directly (electronically) from another student. The professor reserves the right to ask you to verbally explain the reasoning behind any code that you turn in.

Academic Honesty

It is vitally important that you turn in work that is your own. As stated above, you may not copy code from another student. However, there are cases in which you may copy code from the web (we actually recommend you do that for the base Dialog class in the first assignment). In these cases, cite the place you got it from in your comments. Getting solutions for small parts of your programming problem is perfectly reasonable. Your overall design, however, should be yours. We tell you not to copy from friends in the course because they are designing the same (or very similar) software. So, just be honest about where you find code. For one-line solutions (such as the sort you might find on Stack Overflow), use your discretion as to whether or not it is necessary to cite them.

In addition to the ethical implications of dishonesty, you undermine your ability to learn when you cheat. Honesty, integrity, and personal responsibility are cornerstones of a Colby education and provide the foundation for scholarly inquiry, intellectual discourse, and an open and welcoming campus community. These values are articulated in the Colby Affirmation and are central to this course. Students are expected to demonstrate academic honesty in all aspects of this course.

Academic dishonesty includes, but is not limited to: plagiarism (including quoting sources without quotation marks around the borrowed words and a citation); presenting another's work as one's own; buying or attempting to buy papers or projects for a course; fabricating information or citations; knowingly assisting others in acts of academic dishonesty; violating clearly stated rules for taking an exam or completing homework; misrepresentations to faculty within the context of a course; and submitting the same work, including an essay that you wrote, in more than one course without the permission of instructors.

Academic dishonesty is a serious offense against the college. Sanctions for academic dishonesty are assigned by an academic review board and may include failure on the assignment, failure in the course, or suspension or expulsion from the College. For more on recognizing and avoiding plagiarism, see the library guide: avoiding plagiarism.

Sexual Misconduct/Title IX Statement

Colby College prohibits and will not tolerate sexual misconduct or gender-based discrimination of any kind. Colby is legally obligated to investigate sexual misconduct (including, but not limited to sexual assault and sexual harassment).

If you wish to speak confidentially about an incident of sexual misconduct, please contact Colby Counseling Services (207-859-4490) or the Director of the Gender and Sexual Diversity Program, Emily Schusterbauer (207-859-4093).

Students should be aware that faculty members are considered responsible employees; as such, if you disclose an incident of sexual misconduct to a faculty member, they have an obligation to report it to Colby's Title IX Coordinator. "Disclosure" may include communication in-person, via email/phone/text, or through class assignments.

To learn more about sexual misconduct or report an incident, visit http://www.colby.edu/sexualviolence/.