Sciweavers

9 search results - page 1 / 2
» Discovering Frequent Arrangements of Temporal Intervals
Sort
View
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
13 years 10 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
13 years 10 months ago
Discovering Frequent Poly-Regions in DNA Sequences
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 efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
ICDM
2008
IEEE
130views Data Mining» more  ICDM 2008»
13 years 11 months ago
Mining Temporal Patterns with Quantitative Intervals
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...
Thomas Guyet, Rene Quiniou
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 1 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
APWEB
2006
Springer
13 years 8 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang