Monday, July 3rd, 2006

Some interesting KDD 2006 papers

Filed under: — Daniel Lemire @ 12:36

Here are some papers with sounding interesting titles from the list of ACM KDD papers:

Global Distance-Based Segmentation of Trajectories
Aris Anagnostopoulos, Michail Vlachos, Marios Hadjieleftheriou, Eamonn Keogh, Philip Yu

Rule Interestingness Analysis Using OLAP Operations
Bing Liu, Kaidi Zhao, Jeffrey Benkler, Weimin Xiao

Topics over Time: A Non-Markov Continuous-Time Model of Topical Trends
Xuerui Wang, Andrew McCallum

Algorithms for time series knowledge mining
Fabian Morchen

Semi-Supervised Time Series Classification
Li Wei, Eamonn Keogh

Two of the papers I selected are from the infamous Eamonn Keogh. I wonder what it means? I must like the guy’s work!

2 Comments »

  1. Thanks for the nice comments! I want to be famous, but in the meantime “infamous” will do ;-)

    Best wishes, eamonn

    Comment by Eamonn — 12/7/2006 @ 13:35

  2. May I know why is he infamous ?

    Comment by AN — 26/12/2006 @ 6:50

RSS feed for comments on this post.

Leave a comment

Warning: When entering a long comment, please ensure that you make copy of your text prior to submitting it. If the server should fail or if you hit a bug, you might lose your work. I am not responsible for your lost effort.

To spammers: I carefully review every single post and make sure that spam gets deleted. You are wasting your time if you are manually entering spam using this form. Read my terms of use to see what I consider to be abusive.

Example: I + II + IX= XII. Yes, you have to enter a roman numeral. (Answer must be in upper case.)

« Blog's main page

26 queries. 0.317 seconds. Valid XHTML

Powered by WordPress

© 2004-2008, Daniel Lemire (lemire at acm dot org). This work is licensed under a Creative Commons License.

Subscribe to this blog in a reader or by Email.