The exam will be comprehensive,
with more emphasis on the material after the midterm.
Reminders:
Additional office
hours by instructor:
Tu-Wed-Thu 12/3-5, 2-3pm, on the usual zoom.
Drill questions
(similar to the exam questions - internal to CMU).
Ignore the questions that are out of scope (like SQL, B-trees,
graph generators, etc).
Sample exam
is here
(internal to CMU),
and the solutions.
As in the original reading list, with several papers deleted.
Specifically, the material consists of the union of:
All
the lecture slides below
All the papers and book-chapters below.
1. Slides
Everything we covered in the slides (see their pdf, in the course schedule page), up to and including
the lecture of Nov. 22 (Multimedia; Compression).
Specifically:
From
110_SAMs1.pdf
to
330_JPEG.pdf.
Notice that the file names are numbered in increasing order.
The graph mining slides from the begining of the course:
420_GraphMining_patterns.pdf
to
436_GraphMining_types_of_fraud.pdf
600_Conclusions.pdf
Excluded:
SQL, B-trees and hashing; time-series forecasting;
graph mining generators and tools.
Myron Flickner, Harpreet Sawhney, Wayne Niblack, Jon
Ashley, Qian Huang, Byron Dom, Monika Gorkani, Jim Hafner,
Denis Lee, Dragutin Petkovic, David Steele and Peter Yanker
Query by Image and Video Content: the QBIC System
IEEE Computer 28, 9, Sep. 1995, pp. 23-32.
[PTVF] William H. Press Saul A.
Teukolsky William T. Vetterling Brian P. Flannery Numerical
Recipes in C Cambridge University Press, 1992, 2nd
Edition. On-line evaluation copy
Last modified: Dec. 6, 2024, by Christos Faloutsos