SDM 2010 summary

SDM 2010 is in Columbus this year and my first time attending data mining conf. I found out that this conf is quite small and concrete, all accepted 80 papers have enough opportunities to present, because they could present in oral and poster sessions, both.

Here are some good presentations:

1, L1 sparse tutorial by Jieping Ye: provides lots of insightful and uptodated resources, amazing part is about that separable non-smooth penalty from the loss func.

2, Best Paper Award
Fast Single-Pair SimRank Computation, Pei Li, Renmin University of China;
this paper improves the simrank algorithm, but badly presented.


3, Best Student Paper Award
A Compression Based Distance Measure for Texture
Authors: Bilson J. Campana and Eamonn Keogh, University of California, Riverside.

Impressive part is the constant time figure, and the authors make the PPT with lots of cartoon, (but as well as making it a bit childish....)


4, social network and graph ming.
Now it's the era of social network and graph ming.... lots of papers in this topic. Esp. heterogeneous biological network label propagation.