[ Discussion Forum | Blogs ]

1. December 2, 2015. You finish the report following the report specification.
2. December 1, 2015. Please send the grading excel sheet to cuhk.cmsc5733@gmail.com. The deadline of submitting final report is 14/12/2015.
3. November 27, 2015. Each student is required to peer review other students' project presentation. You had better take your computer, ipad, or other tools supporting instant grading. You can download the grading specification.
4. November 26, 2015. You could use the following template in your final report. report_template.doc
5. November 16, 2015. You could check your HW3 and midterm scores from the following list. If you have any problem, please contact to the tutor. Score list (updated): HW3&MidtermScore.pdf.
6. November 15, 2015. The venue of class on Nov. 16, 2015 (Monday) is in AIT_G02 (An Integrated Teaching Building), CUHK.
7. November 11, 2015. Presentation schedule is open. You can sign-up to choose a time slot for your group presentation. Each group has 15 minutes. We may give a bit more time for groups with more than 1 member and groups with system demo. And we also leave some time for course evaluation and possible delays. So there is a gap between two sessions.
8. November 8, 2015. Sorry for that there are typos in computing pagerank in HW3 solution. It is updated now. Please use the new version.
9. November 6, 2015. In order to reduce your calculation time, we allow you to use calculators in the exam. But only the calculators listed in the following are allowed. We will check your calculator on the exam day. Please do not use disallowed calculators. Thanks. Remind: We will also provide a look-up table for you. So the calculator is not necessary.
Calculator list:calculator_list_eng.pdf
10. November 4, 2015. There is no lecture next week. We will take midterm exam on next Monday. The time and venue are the same as usual. Kind remind Time: 7:00-10:00pm, 09/11/2015, Venue: HKPC108.
11. October 26, 2015. Project midterm check specification is uploaded.
12. October 25, 2015. You are allowed to write your homework manually and submit the scanned file.
13. October 21, 2015. We add extra question for HW3. Please download the new version. Notes: Extra question helps you to get higher scores. It is not hard. Please try it.
14. October 19, 2015. You can check your HW1 and HW2 scores from the following file. If you have any problem, please contact the tutor. Score file: hw1_2_score.pdf.
15. October 17, 2015. There is a typo in previous HW3.pdf. Please download the new version.
16. October 15, 2015.To leave you more time to finish the project, we have sent the proposal feedback today. So there is no feedback on Oct. 19, 2015. Re-inform: project mid-term check is on Nov. 2, 2015.
Grading criteria: Each proposal is graded according to the four factors listed in the feedback, ranging from 1 to 5. The full mark is not a simple average of the four factors. If you do really good in some factors, you may still get full marks. So some proposals may not get full marks in each factor, but they finally get full marks. Thanks.
17. October 14, 2015. Project mid-term check is changed to Nov. 2, 2015.
18. October 7, 2015. Tutorial is updated. Data source page is added.
19. October 6, 2015. Group information is updated. All students are included.
20. October 6, 2015. Students in the following list have not successfully handed in the homework 2 solution. Please resend it if you sent to the wrong email. You'd better give evidence that you really sent before the deadline. <out of date>
21. October 6, 2015. Group information is updated. If you are not included, please send an email to the tutor.
22. September 28, 2015. Project specification and proposal template are uploaded.
23. September 24, 2015. Please follow the definition in the lecture (L=C-D) to compute the Laplacian matrix in homework 2.
24. September 20, 2015. Please check the following list that contains all students, from whom the tutor has received the homework 1 solutions. If you have handed in the homework but not in the list, please contact the tutor. Student id list: hw1_list.pdf
25. September 14, 2015. Please join the LinkedIn group ASAP. It will be shut down this Friday (18/09/2015).
26. September 12, 2015. The first homework is open now.

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

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.

Students will be able to:

1. provide an overview of recent developments in social computing;
2. explain various theories and models in social computing;
3. design and implement simple systems to process social data

1. Lectures
2. Tutorials (hands-on)
3. Web resources
4. Videos
5. Quizzes
6. Examinations
7. Project presentations

• Expectations

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

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

• Web 2.0
  • Ajax, CSS,
• Social Media
  • blogs, microblogs, wikis, mashup,

• The time slots are for Monday, November 30, 2015 (5 pm - 11 pm).
• The venue is SHB121.
• Please enter all team members' name in one slot in either Session 1 or Session 2 table.
• Instructions
  1. Put the name of all your team members under the “Real name” column.
  2. Select one slot from either the Session 1 or Session 2 table.
  3. Press “Submit”.
  4. Make sure it does not conflict with others.

Class Project Presentation Session 1
Real name	17:00	17:15	17:30	17:45	18:00	18:15	18:30	18:45	19:00	19:15
HUANG XIANGHAI, ZHAO CHE, GU ZHIJING, LYU ZISHE
Yao Fangjie, Cheng Ruobing, Zhang Yu
Li Yae, Wen Weiwei, Gao Chao
Ng Tsz Ming
Sun Qijia
ZHU Mingjie, SHEN Qinyi, ZHU Xuan, YANG Yang
XIE Tianlei, LIU hanbo
HUANG Jiahao, FAN Zeng
FENG Chen, LUO Linhua
Tutor
ZAP
acb
	3	2	2	2	2	2	2	2	2	2

Class Project Presentation Session 2
Real name	20:00	20:15	20:30	20:45	21:00	21:15	21:30	21:45	22:00	22:15
IP Wai Han
TSOI Yao Tak Alphred, Chang Ho Kit, Cheng Ka Chi Cyrus
Leung Chun Man, Tsang Man Kin
Lui Man Hong, Yip Chun Ho
Chung Ho Pun, Lam Wai Yue, Wan Chi Yik
ZHAO Jialiang, WU Di, ZHANG Feng
WONG Yan-ho, Michael
Tang Yuen Ting, Ho lik hang, Lam Sing
Man Kwok Wing
ZAP
	2	2	2	2	2	2	2	2	1	2

• 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.

• CUHK Registration and Examination

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.
4. One A4-sized cheat-sheet page.

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

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

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.

1. Pajek, a network analysis and visualization program.
2. Package for Large Network Analysis
3. UCINET 6
4. Netdraw
5. StOCNET

• http://www.cs.purdue.edu/homes/neville/courses/aaai08-tutorial.html
  
• http://cs.stanford.edu/people/jure/icml09networks/
  
• http://www.ofcom.org.uk/advice/media_literacy/medlitpub/medlitpubrss/socialnetworking/report.pdf
  

• http://www.cs.cmu.edu/~deepay/mywww/papers/csur06.pdf
  
• http://cs.stanford.edu/people/jure/talks/www08tutorial/
  
• http://www.xifengyan.net/tutorial/KDD08_graph_partI.pdf
  
• http://www.xifengyan.net/tutorial/KDD08_graph_partII.pdf

• http://analytics.ijs.si/events/Tutorial-TextMiningLinkAnalysis-KDD2007-SanJose-Aug2007/
  
• http://www.sigkdd.org/explorations/issues/7-2-2005-12/1-Getoor.pdf
  
• http://www.ncjrs.gov/pdffiles1/nij/grants/219552.pdf
  
• http://delab.csd.auth.gr/~dimitris/papers/ENVO07LARskm.pdf

• http://www2009.org/pdf/T7A-LEARNING%20TO%20RANK%20TUTORIAL.pdf
  
• http://radlinski.org/papers/LearningToRank_NESCAI08.pdf
  
• http://www.aclweb.org/anthology/P/P09/P09-5005.pdf
  
• http://www.cse.iitb.ac.in/~soumen/doc/www2007/TutorialSlides.pdf

• http://en.wikipedia.org/wiki/Recommender_system
• http://goo.gl/nNiGRP
• http://www.computer.org/portal/web/csdl/doi/10.1109/TKDE.2005.99
• http://www.springerlink.com/content/n881136032u8k111/
• http://www.csd.abdn.ac.uk/~jmasthof/Publications/WPRSIUI07.pdf

• http://lml.bas.bg/ranlp2005/tutorials/magnini.ppt
  
• http://tcc.itc.it/research/textec/topics/question-answering/Tut-Prager.ppt
  
• http://en.wikipedia.org/wiki/Question_answering
  
• http://trec.nist.gov/pubs/trec9/papers/webclopedia.pdf
  
• http://goo.gl/4YFCzz
  
• http://www.umiacs.umd.edu/~jimmylin/publications/Lin_Katz_EACL2003_tutorial.pdf
  
• http://answers.yahoo.com/
  
• http://zhidao.baidu.com/
  
• http://wenda.tianya.cn/wenda/
  
• http://hk.knowledge.yahoo.com/
  

• http://www.gwap.com/gwap/
  
• http://www.cs.cmu.edu/~biglou/
  

• http://www.cs.uic.edu/~liub/FBS/opinion-mining-sentiment-analysis.pdf
  
• http://www.cs.cornell.edu/home/llee/omsa/omsa-published.pdf
  
• http://www.cs.cmu.edu/~wcohen/10-802/sentiment-sep-4.ppt
  

1. Many Eyes Visualization

1. Python Programming Tutorial
2. Python Web Scraping Tutorial
3. NetworkX, a Python package for complex networks
4. Mathematica from Wolfram
   1. Wolfram Demonstrations