This course will be offered again in Spring 2002.
Students taking 254 for four units should follow these project guidelines. We now have a feedback form for presentations. On Wednesday June 4, each person doing a project gave a short talk about his or her project. Here are the final project reports.
Please read, reflect upon, and follow these presentation guidelines. Immediately after your presentation, please email to elkan@cs a copy of your slides. For ease of viewing, please make this copy be two slides per page in Adobe PDF.
The schedule of papers and presentations is below. Second presentations are on June 4 and later. Participants who do not yet have a presentation date may "bump" these second presentations. Participants who have not chosen a paper yet should look at this list of possible papers and contact the instructor.
If you want to change your presentation date, please arrange a swap
with another student and notify the instructor at least two weeks in advance.
| date | presenter | paper title | author(s) |
board |
|
| April 2 | organizational meeting |
|
|||
| April 4 | Per Jambeck | Boosting image retrieval | Kinh Tieu, Paul Viola |
|
|
| April 9 | Frank Dellaert | Faculty candidate talk, 11am, APM 4301 | |||
| April 11 | Bianca Zadrozny | An adaptive regularization criterion for supervised learning | Dale Schuurmans, Finnegan Southey |
|
slides |
| April 16 | Joe Drish | Transductive inference for text classification using support vector machines | Thorsten Joachims |
|
slides |
| April 18 | Per Jambeck | Matching shapes | Serge Belongie, Jitendra Malik, Jan Puzicha |
|
(gzip) |
| April 23 | Aldebaro Klautau | Reducing multiclass to binary: A unifying approach for margin classifiers | Erin Allwein, Robert E. Schapire, Yoram Singer |
|
slides |
| April 25 | Melanie Dumas | Arachnid: Adaptive retrieval agents choosing heuristic neighborhoods for information discovery | Filippo Menczer |
|
slides |
| April 30 | Victor Gidofalvi | Mining of concurrent text and time series | Victor Lavrenko, Matt Schmill, Dawn Lawrie, Paul Ogilvie, David Jensen, James Allan |
|
slides |
| May 2 | Hector Jasso | Will reasoning improve learning? | Nicolaas Vriend |
|
slides |
| May 7 | Sameer Agarwal | Strategy acquisition for the game Othello based on reinforcement learning | T. Yoshioka, S. Ishii, M. Ito |
|
slides |
| May 9 | Jonathan Ultis | Probabilistic latent semantic indexing | Thomas Hofmann |
|
slides |
| May 14 | Greg Hamerly | Information extraction with HMMs and shrinkage | Dayne Freitag, Andrew McCallum |
|
slides |
| May 16 | David Kauchak | Boosted wrapper induction | Dayne Freitag, Nicholas Kushmerick |
|
slides |
| May 21 |
|
||||
| May 23 | Sameer Agarwal | Image analogies | Aaron Hertzmann, Charles E. Jacobs, Nuria Oliver, Brian Curless, David H. Salesin |
|
slides |
| May 28 |
|
||||
| May 30 | Kristin Branson | Supervised learning of belief net classifiers | Wei Zhou, Russell Greiner |
|
|
| June 4 | Yang Yu | Enhanced hypertext categorization using hyperlinks | Soumen Chakrabarti, Byron Dom, Piotr Indyk |
|
slides |
| June 6 | 254 students | Ten minute project presentations |
|
|
Students may take CSE 254 for one, two, or four units:
CSE 254 is not offered every academic year, so interested students should enroll this quarter. CSE 254 is open to all students in computer science, cognitive science, or engineering who have already taken at least one graduate course at UCSD or elsewhere in artificial intelligence or a closely related area such as statistics, pattern recognition, bioinformatics, or information theory. Appropriate courses at UCSD include CSE 250A, CSE 253, Cognitive Science 202, ECE 270A, and CSE 275A.
The seminar will meet on Mondays and Wednesdays from 10:10am to 11:30pm in the APM building, room 5218 (not 3218 as announced previously). The first meeting will be on Monday April 2, and the final meeting will be on Wednesday June 6, 2001.
Topics to be covered in CSE 254 may include:
The instructor is Charles Elkan, Associate Professor, with office in AP&M room 4856. Feel free to send email to arrange an appointment, or telephone (858) 534-8897.
One textbook is recommended as background reading for CSE 254: Machine
Learning by Tom Mitchell, McGraw Hill, 1997, ISBN 0070428077.
Some papers will be theoretical, and some will be applied. Two related applications papers may be discussed together. Theoretical papers will typically be presented and discussed alone, to ensure that mathematical and algorithmic questions are discussed in sufficient depth.
In the first week, we will make a schedule of papers and presentations for the whole quarter. With 10 participants, each student will make two separate presentations. The procedure for one presentation is as follows:
For each presentation, we will have a web-based discussion area. Each seminar participant is expected to contribute at least one message to the discussion, before the presentation. A message may ask an interesting question, point out a strength or weakness of the paper, or answer a question asked by someone else. Messages should be thoughtful!
Each student will also do one term project following specific guidelines. The project should be at the frontier of current research, and preferably closely inspired by one of the papers discussed in the class. Project reports will be evaluated using these grading criteria. There is a schedule for handing in a detailed project proposal, a draft project report, and then the final report.
The seminar will have no final exam. Final grades will be based
50% on presentations and participation in class and in the web-based discussions.
The other 50% will be the project report.
Most recently updated on June 16, 2001 by Charles Elkan, elkan@cs.ucsd.edu