[ Discussion Forum | Blogs ]

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

The Golden Rule of CSC4170: No member of the CSC4170 community shall take unfair advantage of any other member of the CSC4170 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.

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

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,

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

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.

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

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

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

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.

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.

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://www.deitel.com/ResourceCenters/Web20/RecommenderSystems/RecommenderSystemsTutorialsandWebcasts/tabid/1313/Default.aspx 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://domino.watson.ibm.com/library/CyberDig.nsf/papers/D12791EAA13BB952852575A1004A055C/$File/rc24789.pdf
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. NetworkX, a Python package for complex networks
2. Mathematica from Wolfram
   1. Wolfram Demonstrations