Some interesting KDD 2006 papers

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!

Published by

Daniel Lemire

A computer science professor at the University of Quebec (TELUQ).

2 thoughts on “Some interesting KDD 2006 papers”

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

    Best wishes, eamonn

Leave a Reply

Your email address will not be published. Required fields are marked *

To create code blocks or other preformatted text, indent by four spaces:

    This will be displayed in a monospaced font. The first four 
    spaces will be stripped off, but all other whitespace
    will be preserved.
    
    Markdown is turned off in code blocks:
     [This is not a link](http://example.com)

To create not a block, but an inline code span, use backticks:

Here is some inline `code`.

For more help see http://daringfireball.net/projects/markdown/syntax