Discriminating subsequence discovery for sequence clustering

Jianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations


In this paper, we explore the discriminating subsequence- based clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining process and a new algorithm, CONTOUR, is developed to efficiently and directly mine a subset of discriminating frequent subsequences which can be used to cluster the input sequences. Second, an accurate hierarchical clustering algorithm, SSC, is constructed based on the result of CONTOUR. The performance study evaluates the efficiency and scalability of CONTOUR, and the clustering quality of SSC.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th SIAM International Conference on Data Mining
PublisherSociety for Industrial and Applied Mathematics Publications
Number of pages6
ISBN (Print)9780898716306
StatePublished - 2007
Event7th SIAM International Conference on Data Mining - Minneapolis, MN, United States
Duration: Apr 26 2007Apr 28 2007

Publication series

NameProceedings of the 7th SIAM International Conference on Data Mining


Other7th SIAM International Conference on Data Mining
Country/TerritoryUnited States
CityMinneapolis, MN


  • Clustering
  • Sequence mining
  • Summarization subsequence


Dive into the research topics of 'Discriminating subsequence discovery for sequence clustering'. Together they form a unique fingerprint.

Cite this