Add to ORKGNational audienceWe present a complete and correct incremental algorithm for mining frequent sequences in a sliding window over a stream of itemsets. It relies on a representation of frequent sequences inspired by the PSP algorithm and on an original method for counting the minimal occurrences of a sequence. Experiments made on simulated and real data show that our incremental algorithm significantly improves the computation time compared to a non-incremental approach
Mining frequent sequences patterns invokes the interests of many searchers. However, the result set ...
Data mining is a part of know ledge Discovery in database process (KDD). As technology advances, flo...
[[abstract]]Mining frequent sequences in large databases has been an important research topic. The m...
National audienceWe present a complete and correct incremental algorithm for mining frequent sequenc...
National audienceWe introduce the problem of mining frequent sequences in a window sliding over a st...
We study the problem of finding frequent itemsets in a continuous stream of transactions. The curren...
Traditional algorithms for frequent itemset discovery are designed for static data. They cannot be s...
The subject of the paper is to analyze the problem of the frequency of the subsequences in large vol...
The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequen...
We study two problems: (1) mining frequent sequences from a transactional database, and (2) incremen...
Many critical applications, like intrusion detection or stock market analysis, require a nearly imme...
Mining frequent sequences patterns invokes the interests of many searchers. However, the result set ...
Data mining is a part of know ledge Discovery in database process (KDD). As technology advances, flo...
[[abstract]]Mining frequent sequences in large databases has been an important research topic. The m...
National audienceWe present a complete and correct incremental algorithm for mining frequent sequenc...
National audienceWe introduce the problem of mining frequent sequences in a window sliding over a st...
We study the problem of finding frequent itemsets in a continuous stream of transactions. The curren...
Traditional algorithms for frequent itemset discovery are designed for static data. They cannot be s...
The subject of the paper is to analyze the problem of the frequency of the subsequences in large vol...
The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequen...
We study two problems: (1) mining frequent sequences from a transactional database, and (2) incremen...
Many critical applications, like intrusion detection or stock market analysis, require a nearly imme...
Mining frequent sequences patterns invokes the interests of many searchers. However, the result set ...
Data mining is a part of know ledge Discovery in database process (KDD). As technology advances, flo...
[[abstract]]Mining frequent sequences in large databases has been an important research topic. The m...