Periodicity search, that is, searchfor cyclicity in time-related databases, is an interesting data mining problem. Mostprevious studies have been on finding full-cycle periodicity...
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...