CSC4170 Web Intelligence and Social Computing

Breaking News

  • Dec 14, 2009. The project demo of CSC4170 will be held on this Wednesday(16th, Dec) at 924B of Ho Sin-Hang Engineering Building. You are required to go to following link to sign a timeslot. Each group has 15 minutes, and each group is required to attend 15 minutes earlier than their timeslot. The hard copy report is required to submit at the demo time.

http://spreadsheets.google.com/ccc?key=0ApPqLXd5MIzkdGIwOGJsOXlsbHE1Mnd1QXA1eUc3Unc&hl=en

  • November 24, 2009. Sample answer of asgn2 is released.
  • November 11, 2009. Please make sure that you register for the upcoming Public Lecture by Dr. Craig Mundie on “Rethinking Computing” on November 16, 2009 at 4:00 pm at the LT6 Teaching Complex at Western Campus (TCWC). This talk is mandatory for the class so please sign-up <here>.
  • November 8, 2009. The class on Monday (November 9) will be canceled because Prof. King is out of town for a conference.
  • October 27, 2009. We will have our Guest Speaker, Dr. Raman Chandrasekar from Microsoft Research on Monday, Novebmer 2, 2009 from 10:30 am to 11:30 am on the topic of ”Page Hunt: Improving Search Engines Using Human Computation Games” in Room 121. Everyone is required to attend.
  • October 14, 2009. Specifications of programming assignment 1 is updated, and more testcases are provided.
  • September 15, 2009. Due to the typhoon No. 8 signal still being raised at 8:00 am, our class for today has been canceled. The tutorial will still be carried out in SHB 507 at 6:30 pm.
  • September 28, 2009. I have updated the class notes on Social Network Analysis and uploaded the latest one on Graph Mining.
  • September 28, 2009. The project due date has been moved back one week due to the various delays we have had.

Extra Credit Assignments

2009-10 Term 1

Lecture I Lecture II Tutorial I Tutorial II
Time M5, 12:30 pm - 1:15 pm T3-T4, 10:30 am - 12:15 pm T11 6:30 pm - 7:15 pm TBA
Venue ERB 706 ERB 408 SHB 507 TBA

The Golden Rule of CSC4170: No member of the CSC4170 community shall take unfair advantage of any other member of the CSC4170 community.

Course Description

This course introduces fundamental as well as applied computational techniques for collaborative and collective intelligence of group behaviours on the Internet. The course topics include, but are not limited to: web intelligence, web data mining, knowledge discovery on the web, web analytics, web information retrieval, learning to rank, ranking algorithms, relevance feedback, collaborative filtering, recommender systems, human/social computation, social games, opinion mining, sentiment analysis, models and theories about social networks, large graph and link-based algorithms, social marketing, monetization of the web, security/privacy issues related to web intelligence and social computing, etc.

Learning Objectives

Learning Outcomes

Learning Activities

  1. Lectures
  2. Tutorials
  3. Web resources
  4. Videos
  5. Quizzes
  6. Examinations

Personnel

Lecturer Tutor Tutor
Name Irwin King Tom Chao Zhou Xin Xin
Email king AT cse.cuhk.edu.hk czhou AT cse.cuhk.edu.hk xxin AT cse.cuhk.edu.hk
Office Rm 908 Room114A Room101
Telephone 2609 8398
Office Hour(s) * M10, Monday 4:30 to 5:30

* T3, Tuesday 10:30 to 11:30
Tuesday 15:30 to 16:30 Tuesday 15:30 to 16:30

Note: This class will be taught in English. Homework assignments and examinations will be conducted in English.

Syllabus

The pdf files are created in Acrobat 6.0. Please obtain the correct version of the Acrobat Reader from Adobe.

Week Date Topics Tutorials Homework & Events Resources
1 7/9 Introduction to Web Intelligence and Social Computing
Web 2.0

01-Introduction.pdf
Tim O'Reilly on Web 2.0, The Economist, 20/3/2009
2 14/9 Introduction to Web Intelligence and Social Computing

Podcast090914-01
Regular Expressions Web Crawler Introduction to Social Networks
3 21/9 Social Networks-Theory
Graph Theory

02-SNA.pdf OLD!
02-SNA-01.pdf OLD!
02-SNA-02.pdf NEW!
Graph Visualization HW #1
(Due on or before 6:30 pm, Friday, 2 October, 2009)
grading-asgn1
SWT Theory
4 28/9 Graph Mining

03-GraphMining-01.pdf

Podcast090928-01
Podcast090929-01
Graph Mining Algorithms
hits.ppt
Generating Random Graphs
The Clique Algorithm
5 5/10 Link Analysis

04-LinkAnalysis-01.pdf NEW!

Podcast091006-01
PageRank, HITS, etc. HW #2
hw2 sample answer
grading-asgn2
HW Programming #1 HW Programming #1 Testcases

(Due on or before 6:30 pm, Monday, 19 October, 2009)
grading-programming
Introduction to Information Retrieval
6 12/10 Learning to Rank

05-Learning2Rank-01.pdf OLD!
05-Learning2Rank-02.pdf NEW!

Podcast091012-01
Podcast091013-01
PageRank Project Specification
Movie Dataset
7 19/10 Recommender Systems I

06-Recommender-01.pdf
Evaluation Methods
8 26/10 Recommender Systems II
Query Expansion

CIKM2008 Query Suggestion
QF/IQF HW #3
(Due: Monday,23 November,18:30)
9 2/11 Human Computation/Social Games

07-HumanComputation-01.pdf NEW!
humancomputation.ppt Guest Speaker
10 9/11 Crowdsourcing language model
11 16/11 Q&A
Virtual Communities

CSC4170-08-QandA.pdf
Wikis, Blogs, etc. HW #4
(Due: Friday, 4 December 4, 2009, 18:30)
gradings asgn4
hw4 sample answer
12 23/11 Privacy and Security of Information
Education, Policy

09-Security.pdf
NEW!
13 30/11 Wrap Up

Project Presentations
EduTech on Social Computing in Education
  • Web 2.0
    • Ajax, CSS,
  • Social Media
    • blogs, microblogs, wikis, mashup,

Class Project

Class Project Presentation Schedule

  1. TING KAM CHEUNG & MA MING CHAO
  2. YANG NGAI KEUNG
  3. YAU MING HIU & CHOW TSZ YEUNG
  4. LAM KA LOK
  5. TUNG WO HOU
  6. WONG YUK KI & TO KA CHUN
  7. LI WAI WA & TSO XIN
  8. TSANG HO KWAN & TANG CHI CHIU
  9. ZACK BUSH
  10. HO CHUN KIU
  11. LEE WING HUNG

Class Project Presentation Requirements

  1. For each group, the total time for the presentation is 15 minutes, including 12 minutes for the talk and 3 minutes for Q&A. The presentation will follow the order above. Since this class will last until the end of all the presentations, if the time is not suitable for you, you can tell us to change your order.
  2. In the presentation, there is no demo part. The demo part is an independent process divided into two sub-sections. The first section will be hold in tutorial time on Dec. 1st. In this section, all the groups should demo your program to the two tutors. The tutors will guide you to revise your program. The second section will be hold on Wednesday, Dec. 16th. In this section, Prof. King will check your program before the final submission of your codes.
  3. For groups implementing graphical algorithms, you should explain one algorithm as detailed as you can in the presentation. You should give an example with the structure of nodes, values, and your calculations. You also need to analyze the complexity of your algorithms and test whether your algorithms can be applied in large graphs. For other groups, you should focus on three aspects including the motivation of your idea, the detailed algorithms, and the justification of your methods comparing to naive methods through experiments.

Examination Matters

Examination Schedule

Time Venue Notes
Midterm Examination
Written
TBD TBD TBD
Midterm Examination
Programming
TBD TBD TBD
Final Examination 9/12/2009 Wed.
9:30 am to 11:30 am
Room 103, John Fulton Centre The final examination covers all materials presented in the class.

Written Midterm Matters

  1. The midterm will test your knowledge of the materials.
  2. Answer all questions using the answer booklet. There will be more available at the venue if needed.
  3. Write legibly. Anything we cannot decipher will be considered incorrect.

Grade Assessment Scheme

Homework
Assignments
Project Report Project Presentation Final Examination
20% 20% 10% 50%
  1. Assignments (20%)
    1. Written assignment
    2. Optional quizzes
  2. Project (30%)
    1. Report (20%)
    2. Presentation (10%)
  3. Final Examination (50%)
  4. Extra Credit (There is no penalty for not doing the extra credit problems. Extra credit will only help you in borderline cases.)

Required Background

  1. Pre-requisites
    1. - CSC 1110 or 1130 or its equivalent. (Not for students who have taken CSC 2520).

Reference Books

Book Sources

  1. Academic & Professional Book Centre, 1H Cheong Ming Bldg., 80-86 Argyle St., Kowloon, 2398-2191, 2391-7430 (fax)
  2. Caves Books (H. K.), 4B Ferry St., G/F., Yaumatei, Kowloon, 2780-0987, 2771-2298
  3. Man Yuen Book Company, 45 Parkes street, Jordan Road, Kowloon, Hong Kong, 2366-0594. Not very large, Asian edition books, fair price, wide range, some 10% discount.
  4. Swindon Book Co. Ltd, 13-15 Lock Road, Tsim Sha Tsiu, Kowloon, 2366-8001. One of the largest book stores in Hong Kong, exchange rate is not favorable.
  5. Hongkong Book Centre, 522-7064. A branch of the Swindon book shop.

FAQ

  1. Q: What is departmental guideline for plagiarism?
    A: If a student is found plagiarizing, his/her case will be reported to the Department Discipline Committee. If the case is proven after deliberation, the student will automatically fail the course in which he/she committed plagiarism. The definition of plagiarism includes copying of the whole or parts of written assignments, programming exercises, reports, quiz papers, mid-term examinations. The penalty will apply to both the one who copies the work and the one whose work is being copied, unless the latter can prove his/her work has been copied unwittingly. Furthermore, inclusion of others' works or results without citation in assignments and reports is also regarded as plagiarism with similar penalty to the offender. A student caught plagiarizing during tests or examinations will be reported to the Faculty Office and appropriate disciplinary authorities for further action, in addition to failing the course.
  2. Q: What is ACM ICPC?
    A: Association of Computer Machinery International Collegiate Programming Contest. Teams from CUHK have done quite well in the previous years. More information on the CSE's programming team can be found at http://www.cse.cuhk.edu.hk/~acmprog.
  3. Q: What are some of the common mistakes made in online and real-time contest?
    A: There are a few common mistakes. Please check out this site for more information.

Resources

Social Networks-Theory Graph Theory

Graph Mining

Link Analysis

Learning to Rank

Recommender Systems

Q & A

Human Computation/Social Games

Opinion Mining/Sentiment Analysis

Visualization

Programming

 
teaching/csc4170/2009.txt · Last modified: 2011/01/22 07:04 by admin     Back to top