Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: THEend8_
Topics for the Major Project
Abbreviation MC refers to the book “Networked Life” by Mung Chiang.
Abbreviation KT refers to the COMP3121 textbook Algorithms Design by
Kleinberg and Tardos.
Here are a few topics for those undecided about what to do as a Major Project
for this class (50% of your class mark). You can choose several kinds of projects.
Here are some possible choices.
(I) You can choose the topic yourselves, in consultation with me. That would
be the best choice, choosing something which you are personally interested in,
preferably in a field that you would like to make a career in. If you have lined
up a job already, talk to your future manager and ask them for a project related
to what you will be working on. I’ll keep your project report confidential if
your future employer requests that. You can also choose to implement an app
that you have an idea for, in any field.
(II) You can write a scholarly essay, explaining a topic on the level equal to
my lectures or in more detail. Here are a few options.
(1) Local Search. See pages 661-700 in KT. This is an important technique
for finding an approximate solution to problems which are too hard to
solve exactly in a reasonable amount of time. For a high mark, include
solutions of the exercises at the end of this chapter of KT.
1
(2) Random Walks and Markov Chains See pages 76-116 in BHK. This
is an extremely important material of which the PageRank is probably
the most important example. For a high mark include solutions to a few
exercises at the end of that chapter of BHK.
(3) Random Graphs See pages 245-299 in BHK. For a high mark include
solutions to a few exercises at the end of the chapter.
(4) Topic Models, Nonnegative Matrix Factorisation, Hidden Markov
Models, and Graphical Models See pages 310-355 in BHK. These
are extremely important topics for those interested in advanced Machine
Learning. For a high mark include solutions to a few exercises at the end
of this chapter of BHK.
(5) Compressed Sensing and Sparse Vectors. See pages 360-373 in BHK.
A relatively new field important for dealing with massive data. For a high
mark include solutions to a few exercises at the end of that chapter of
BHK.