Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICDM

2006

IEEE

2006

IEEE

The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efﬁcient approaches are proposed to solve it. The ﬁrst approach is entropy-based and uses an existing recursive segmentation technique to split the input sequence into a set of homogeneous segments. The key idea of the second approach is to use a set of sliding windows over the sequence. Each sliding window keeps a set of statistics of a sequence segment that mainly includes the number of occurrences of each item in that segment. Combining these statistics efﬁciently yields the complete set of regions of high occurrence of the items of the given alphabet. After identifying these regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a region). An efﬁcient algorithm for mining frequent arrangements of temporal intervals on a single sequence is applied on the converted sequence to discover freq...

Added |
11 Jun 2010 |

Updated |
11 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
ICDM |

Authors |
Panagiotis Papapetrou, Gary Benson, George Kollios |

Comments (0)