CONTOUR: an efficient algorithm for discovering discriminating subsequences

Author： Wang Jianyong   Zhang Yuzhou   Zhou Lizhu   Karypis George   Aggarwal Charu  

Publisher： Springer Publishing Company

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.18, Iss.1, 2009-02, pp. : 1-29

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A time- and memory-efficient frequent itemset discovering algorithm for association rule mining

By Ivancsy Renata   Vajk Istvan  

International Journal of Computer Applications in Technology, Vol. 27, Iss. 4, 2007-01 ,pp. : 270-280

Inderscience Publishers

Access to resources Recommend Favorite

An Algorithm for Compressing Digital Contour Data

By Li Zhilin  

The Cartographic Journal, Vol. 25, Iss. 2, 1988-12 ,pp. : 143-146

Maney Publishing

Access to resources Recommend Favorite

A Smoothing Algorithm for Contour Lines by Means of Triangulation

By Irigoyen Jesus   Martin Maria T.   Rodriguez Jaime  

The Cartographic Journal, Vol. 46, Iss. 3, 2009-08 ,pp. : 262-267

Maney Publishing

Access to resources Recommend Favorite

An Algorithm for Localised Contour Removal over Steep Terrain

By Mackaness William   Steven Mike  

The Cartographic Journal, Vol. 43, Iss. 2, 2006-07 ,pp. : 144-156

Maney Publishing

Access to resources Recommend Favorite

Discovering the efficient organization structure: horizontal versus vertical

By Ikeda Satoshi  

Artificial Life and Robotics, Vol. 15, Iss. 4, 2010-12 ,pp. : 478-481

Springer Publishing Company

Access to resources Recommend Favorite