Last update: Fri Jan 16 18:50:13 2009

Reading Assignment (for Graduates)

The presentation sessions are to be hold on Dec. 26, 2008.

Task Description

Each group (two graduate students) should pick up exactly one research paper that is related to information retrieval or Web mining, and based on the material develop a short talk. Each group would be given 10 minutes for presenting the paper. We have put together a short list of recommended reading list in the following sections; each group can either 1) pick up the papers in our list, or 2) suggest new papers to the TA. The newly-added paper would also be included in the reading list.

Register your group and the paper your preferred via the job poll system. The poll would be closed at 12pm, Dec. 12, 2008 (See poll-reading-result.html for details).

Session Schedule

The final session schedule is as follows. Each group will be given 10 minutes for their talk.

Session Participating Groups
9:10 to 10:00, Dec 26, 2008 Groups 1 to 5
10:10 to 11:00, Dec 26, 2008 Groups 6 to 10
11:10 to 12:00, Dec 26, 2008 Groups 11 to 15

Topics are shown in the following table.

Group No. Member #1 Member #2 Reading Job No.
1 D93944003 D97921018 Analyzing Search Engine Advertising: Firm Behavior and Cross-Selling in Electronic Markets.
2 P97922003 R97922009 Algorithmic Mediation for Collaborative Exploratory Search.
3 R96922029 R96922017 Flickr Tag Recommendation based on Collective Knowledge.
4 R96942052 R96921033 Selecting Good Expansion Terms for Pseudo-Relevance Feedback.
5 R96944003 R97944034 Can Chinese Web Pages be Classified with English Data Source?
6 R96944016 R97922028 BrowseRank: Letting Web Users Vote for Page Importance.
7 R96944043 R97944018 Tag-based Social Interest Discovery.
8 R97921025 D96921017 Spam Double-Funnel: Connecting Web Spammers with Advertisers.
9 R97921040 R97921038 Automatically Identifying Localizable Queries.
10 R97922041 R97921028 Query Dependent Ranking Using K-Nearest Neighbor.
11 R97922067 R97922019 Enhancing Text Clustering by Leveraging Wikipedia Semantics.
12 R97922110 N/A Discovering Key Concepts in Verbose Queries.
13 R97942033 D97921013 Retrieval and Feedback Models for Blog Feed Search.
14 R97944013 R96944012 Externalities in Online Advertising.
15 R97944029 R97922055 Finding Question-Answer Pairs from Online Forums.

Reading List

  1. M. Bendersky and B. Croft, Discovering Key Concepts in Verbose Queries.
  2. G. Cong, L. Wang, C.Y. Lin, Y.I. Song and Y. Sun, Finding Question-Answer Pairs from Online Forums.
  3. G. Cao, J.Y. Nie, J. Gao and S. Robertson, Selecting Good Expansion Terms for Pseudo-Relevance Feedback.
  4. J. Elsas, J. Arguello, J. Callan and J. Carbonell, Retrieval and Feedback Models for Blog Feed Search.
  5. J. Guo, G. Xu, H. Li and X. Cheng, A Unified and Discriminative Model for Query Refinement.
  6. X. Geng, T.Y. Liu, T. Qin, A. Arnold, H. Li and H.Y. Shum, Query Dependent Ranking Using K-Nearest Neighbor.
  7. J. Hu, L. Fang, Y. Cao, H. J. Zeng, H. Li, Q. Yang, and Z. Chen, Enhancing Text Clustering by Leveraging Wikipedia Semantics.
  8. P. Heymann, D. Ramage and H. Garcia-Molina, Social Tag Prediction.
  9. T. Joshi, J. Joy, T. Kellner, U. Khurana, A. Kumaran and V. Sengar, Crosslingual Location Search.
  10. F. Radlinski, A. Broder, P. Ciccolo, E. Gabrilovich, V. Josifovski and L. Riedel, Optimizing Relevance and Revenue in Ad Search: A Query Substitution Approach.
  11. K.S. Lee, B. Croft and J. Allan, A Cluster-Based Resampling Method for Pseudo-Relevance Feedback.
  12. Y. Liu, B. Gao, T.Y. Liu, Y. Zhang, Z. Ma, S. He and H. Li, !BrowseRank: Letting Web Users Vote for Page Importance.
  13. Y. Liu, J. Bian and E. Agichtein, Predicting Information Seeker Satisfaction in Community Question Answering.
  14. B. Mehta and W. Nejdl, Attack Resistant Collaborative Filtering.
  15. J. Pickens, G. Golovchinsky, C. Shah, P. Qvarfordt and M. Back, Algorithmic Mediation for Collaborative Exploratory Search.
  16. T. Roelleke and J. Wang, TF-IDF Uncovered: A Study of Theories and Probabilities.
  17. D. V. Kalashnikov, R. Nuray-Turan and S. Mehrotra, Towards Breaking the Quality Curse: A Web-Querying Approach to Web People Search.
  18. R. Schenkel, T. Crecelius, M. Kacimi, S. Michel, T. Neumann, J. Xavier Parreira and G. Weikum, Efficient Top-k Querying over Social-Tagging Networks.
  19. X. Wang, H. Fang, and C. Zhai, A Study of Methods for Negative Relevance Feedback.
  20. M. Welch and J.J. Cho, Automatically Identifying Localizable Queries.
  21. Y. Wu and D. Oard, Bilingual Topic Aspect Classification with A Few Training Examples.
  22. S. Xu, S. Bao, B. Fei, Z. Su and Y. Yu, Exploring Folksonomy for Personalized Search.
  23. A. Fuxman, P. Tsaparas, K. Achan and R. Agrawal, Using the Wisdom of the Crowds for Keyword Generation.
  24. A. Ghosh and M. Mahdian, Externalities in Online Advertising.
  25. U. Feige, N. Immorlica, V.S. Mirrokni and H. Nazerzadeh, A Combinatorial Allocation Mechanism With Penalties For Banner Advertising.
  26. H. Nazerzadeh, A. Saberi and R. Vohra, Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising.
  27. A. Ghose and S. Yang, Analyzing Search Engine Advertising: Firm Behavior and Cross-Selling in Electronic Markets.
  28. J. Yi, F. Maghoul and J. Pedersen, Deciphering Mobile Search Patterns: A Study of Yahoo! Mobile Search Queries.
  29. B. Sigurbjörnsson and R. van Zwol, Flickr Tag Recommendation based on Collective Knowledge.
  30. L. Backstrom, J. Kleinberg, R. Kumar and J. Novak, Spatial Variation in Search Engine Queries.
  31. B. Tan and F. Peng, Unsupervised Query Segmentation Using Generative Language Models and Wikipedia.
  32. D. Chakrabarti, D. Agarwal and V. Josifovski, Contextual Advertising by Combining Relevance with Click Feedback.
  33. X. Li, L. Guo and Y.E. Zhao, Tag-based Social Interest Discovery.
  34. X. Ling, G.R. Xue, W. Dai, Y. Jiang, Q. Yang and Y. Yu, Can Chinese Web Pages be Classified with English Data Source?
  35. G.N. Noren, A. Bate, J. Hopstadius, K. Star and I.R. Edwards, Temporal pattern discovery for trends and transient effects: its application to patient records.

Presentation Guidelines

Each group would be given 10 minutes for presenting the paper. Normally, with such a tight schedule, 5 to 7 slides would already be enough. We would also recommend speakers lay out their presentation slides in the following fashion.

  • Use no more than 2 pages of slides for topics title, outline, and references.
  • Skip overlengthy background introduction.
  • Highlight the insight of the work in the first 2 pages of slides.
  • Show only the most important results (if any).
  • Give out your own comments or critics in the end of presentation.

New: Save the presentation slides in .ppt or .pdf (recommended) format and send it to the submission program. Please do NOT send it as a message to the TA.