Mining association rules with multiple minimum supports
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Indirect Association: Mining Higher Order Dependencies in Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Sequential patterns mining is an important research topic in data mining and knowledge discovery. The objective of mining sequential patterns is to find out frequent sequences based on the user-specified minimum support threshold, which implicitly assumes that all items in the data have similar probability distribution. This is often not the case in real-life applications. If the frequencies of items vary a great deal, we will suffer the dilemma called the rare item problem. In order to resolve the dilemma, an algorithm to discover sequential patterns with multiple minimum supports model is proposed, which can specify a different minimum item support for different item. The algorithm can not only discover sequential patterns formed between frequent sequences, but also discover sequential patterns formed either between frequent sequence and rare sequence or among rare sequences only. Moreover, an algorithm for mining direct and indirect sequential patterns with multiple minimum supports is designed simultaneously.