Resources

Newsgroup

Class Schedule

Class meets at every Thursday, 4:00-5:00pm, 3403 SC

Please check https://agora.cs.uiuc.edu/display/cs591hanfa08/Home for any updates.

Two students per unit (20 minutes presentation and 5 minutes discussion for each research paper, i.e., two papers will be covered per class unit.  However, we may occasionally extend the discussion to 30 minutes, i.e., working on only one paper per class unit time when needed).

You are encouraged to select the papers you believe are interesting and in excellent quality.  Strongly recommend to present the papers published or to be published in 2004 or 2005.  Please discuss with the course instructor before you finalize your paper selection.

Recommended conference proceedings: KDD, SIGMOD, VLDB, PODS, ICDE, WWW, ICDM, SDM, ICML, EDBT, CIKM, PKDD, PAKDD, SSDBM, etc.  You can access SIGMOD/PODS04 E-Proceedings, KDD04 E-Proceedings, VLDB04 E-Proceedings, ICDE05 E-Proceedings, SIGMOD/PODS05 E-Proceedings, KDD05 E-Proceedings, VLDB05 E-Proceedings, ICDE06 E-Proceedings, SIGMOD/PODS06 E-Proceedings, KDD06 E-Proceedings, VLDB06 E-Proceedings,  ICDE07 E-Proceedings, SIGMOD/PODS07 E-Proceedings, KDD’07 E-Proceedings, VLDB07 E-Proceedings, ICDM'07 E-Proceedings, ICDE'08 E-Proceedings, SIGMODPODS08 E-Proceedings, SIAM Data Mining (SDM) Conference Proceedings, by clicking the corresponding links.  Use citeseer or other Web services to find the papers you want to select.

Recommended journals:  IEEE TKDE, DMKD (Data Mining and Knowledge Discovery), KDD Explorations, Machine Learning, ACM Trans. Database Systems, JIIS, Information Systems, VLDB Journal, Data and Knowledge Engineering, Knowledge and Information Systems (KAIS), etc.

Survey papers will usually be allocated as one full slot.

All the papers to be presented must give out the e-paper (one week before the presentation) and e-slides (4 hours before the presentation).


Presentation Schedule for CS591 (Data Mining) Spring 2008


Week 1.   (Jan. 15)  Tuesday 4-5pm 3403 SC

·        Hong Cheng: Towards Accurate and Efficient Classification: A Frequent and Discriminative Pattern-based Approach

Week 2.  (Jan. 23) Wed. 4-5pm 3403 SC

·        Jae-Gil Lee: Fosca Giannotti, Mirco Nanni, Fabio Pinelli, and Dino Pedreschi, "Trajectory Pattern Mining," In Proc. 13th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, 2007.
http://www.cs.uiuc.edu/homes/hanj/refs/kdd07/docs/p330.pdf

·        Deng Cai: Deng Cai, Xiaofei He, Wei Vivian Zhang, and Jiawei Han, “Regularized Locality Preserving Indexing”, Proc. 2007 ACM Int. Conf. on Information and Knowledge Management (CIKM'07), Lisboa, Portugal, Nov. 2007

 

Week 3.   (Jan. 30)   No meeting, NSF meeting at D.C.

 

Week 4.   (Feb. 6) 

·        Chandra Ramachandran:  Nikolay Archak, Anindya Ghose, Panagiotis G. Ipeirotis: "Show me the money!: Deriving the pricing power of product features by mining consumer reviews," pp.56-65, KDD 2007.  (Presentation slides: http://netfiles.uiuc.edu/cramach2/shared/CS591.ppt)

·        Sang Kim: Sangkyum Kim, Xin Jin and Jiawei Han, “SpaRClus: Spatial Relationship Pattern-Based Hierarchical Clustering”, Proc. 2008 SIAM Int. Conf. on Data Mining (SDM'08), Atlanta, GA, April 2008.

 

Week 5.   (Feb. 13) 

·        Hector Gonzalez: Mining Massive Moving Object Datasets: From RFID Data Flow Analysis to Traffic Mining

 

Week 6.   (Feb. 20) 

·        Tianyi Wu: Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou: SPARK: Top-k Keyword Query in Relational Databases (SIGMOD 2007) http://www.itee.uq.edu.au/~zxf/_papers/SIGMOD07.pdf

·        Feida Zhu:    “Fast Best-effort Pattern Matching in Large Attributed Graphs” by Hanghang Tong, Brian Gallagher, Christos Faloutsos and Tina Eliassi-Rad, KDD 07.  http://www.cs.uiuc.edu/homes/hanj/refs/kdd07/docs/p737.pdf

 

Week 7.   (Feb. 27) 

·        Peixiang Zhao: B. Yu, G. Li, K. Sollins, A. K. H. Tung, “Effective Keyword-based Selection of Relational Databases”, SIGMOD’07.

·        Zhijun Yin:  W. Dai, G.-R. Xue, Q. Yang, Y. Yu, “Co-clustering Based Classification for Out-of-domain Documents”, KDD'07

 

Week 8.   (March 5) 

·        Xiaolei Li: Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, and Yizhou Sun, “Sampling Cube: A Framework for Statistical OLAP over Sampling Data”, Proc. 2008 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'08), Vancouver, BC, Canada, June 2008.

·        Liangliang Cao:  (1) T. Quack, et al: Efficient Mining of Frequent and Distinctive Feature Configurations, ICCV 2007; (2)S. Nowozin, et al: Discriminative Subsequence Mining for Action Classification, ICCV 2007

 

Week 9.   (March 11)  Please note the time is changed to Tuesday for this week only!

·        Bolin Ding: Jiexing Li, Yufei Tao, Xiaokui Xiao: Preservation of Proximity Privacy in Publishing Numerical Sensitive Data. SIGMOD08. http://www.cse.cuhk.edu.hk/~taoyf/paper/sigmod08-numeric.html

·        Zhenhui Li: Doug Burdick, AnHai Doan, Raghu Ramakrishnan, Shivakumar Vaithyanathan. OLAP over Imprecise Data with Domain Constraints. VLDB 2007, p.39

 

Week 10.   (March 19)  No meeting, Spring break

 

Week 11.   (March 26) No meeting, NASA meeting in California

 

Week 12.   (April 2) 

·        Jing Gao: H. Becker, M. Arias (Columbia University), Real-time Ranking with Concept Drift Using Expert Advice (Page 86), KDD 2007. (http://www.cs.uiuc.edu/homes/hanj/refs/kdd07/docs/p86.pdf)

·        Yizhou Sun: B. Long, Z. Zhang (State University of New York at Binghamton), P. S. Yu (IBM Watson Research Center). A Probabilistic Framework for Relational Clustering (KDD'07, www.cs.uiuc.edu/homes/hanj/refs/kdd07/docs/p470.pdf)

 

Week 13.   (April 9) No meeting, ICDE’08

 

Week 14.   (April 16) 

  • Xide Lin: Jason Hartline (Northwestern U.), Vahab S. Mirrokni (Microsoft Research) and Mukund Sundararajan (Stanford U.), Optimal Marketing Strategies over Social Networks, WWW’08, www.cs.uiuc.edu/homes/hanj/refs/cs591/08s/www08.pdf
  • ICDE’08 report (Deng Cai, Jae-Gil Lee, and Jiawei Han)

 

Week 15.   (April 23) 

·        Chen Chen:  J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: Towards Verification-Free Query Processing on Graph Databases. SIGMOD’07. www.cs.ust.hk/~csjames/FGindex_sigmod07.pdf

·        Min-Soo Kim: Jimeng Sun, Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos, “GraphScope: Parameter-free Mining of Large Time-evolving Graphs,” in KDD 2007.

 

Week 16.   Thursday (May 1) 

·        Xin Jin: Bansal, N., Chiang, F., Koudas, N., and Tompa, F. W.  Seeking Stable Clusters in the Blogosphere. (VLDB 2007 ). www.blogscope.net/about/docs/stable-clusters-vldb07.pdf  (www.vldb2007.org/program/slides/s806-bansal.pdf)

·        SDM’08 report (Sang Kim)

 

Week 17.  Monday (May 5) 2-5pm 3403 SC

·        Data Mining Group semester summary

 


Jiawei Han