Intervals are found in many real life applications such as web uses; stock market information; patient disease records; records maintained for occurrences of events, either man made or natural etc. Mining frequent intervals from such data allow us to group the transactions with similar behavior. Similar to frequent intervals, mining sparse intervals are also important. In this paper we define the notion of sparse and maximal sparse interval and also propose an algorithm for mining maximal sparse intervals. Computer programs were written and experimented on real life data set and results obtained have been reported. The correctness of the algorithm has also been proved
ABSTRACT Almost all activities observed in nowadays applications are correlated with a timing sequen...
In this paper, we proposed a simi-larity matrix based method to min-ing maximal frequent patterns fr...
DoctorThis dissertation studies an efficient similarity search for time series data represented as i...
Many real world data are closely associated with intervals. Mining frequent intervals from such data...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements o...
International audienceExisting Web Usage Mining techniques are currently based on an arbitrary divis...
The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed tha...
International audienceThis article extends the method of Garriga et al. for mining relevant rules to...
The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed tha...
Interval databases queries are computationally intensive and lend themselves naturally to paralleliz...
In traditional association rule mining algorithms, if the minimum support is set too high, many valu...
[[abstract]]Sequential pattern mining is an important subfield in data mining. Recently, discovering...
Let be a database of transactions on n attributes, where each attribute specifies a (possibly empty)...
International audienceMost methods for temporal pattern mining assume that time is represented by po...
ABSTRACT Almost all activities observed in nowadays applications are correlated with a timing sequen...
In this paper, we proposed a simi-larity matrix based method to min-ing maximal frequent patterns fr...
DoctorThis dissertation studies an efficient similarity search for time series data represented as i...
Many real world data are closely associated with intervals. Mining frequent intervals from such data...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements o...
International audienceExisting Web Usage Mining techniques are currently based on an arbitrary divis...
The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed tha...
International audienceThis article extends the method of Garriga et al. for mining relevant rules to...
The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed tha...
Interval databases queries are computationally intensive and lend themselves naturally to paralleliz...
In traditional association rule mining algorithms, if the minimum support is set too high, many valu...
[[abstract]]Sequential pattern mining is an important subfield in data mining. Recently, discovering...
Let be a database of transactions on n attributes, where each attribute specifies a (possibly empty)...
International audienceMost methods for temporal pattern mining assume that time is represented by po...
ABSTRACT Almost all activities observed in nowadays applications are correlated with a timing sequen...
In this paper, we proposed a simi-larity matrix based method to min-ing maximal frequent patterns fr...
DoctorThis dissertation studies an efficient similarity search for time series data represented as i...