Abstract
In order to reduce the computational and spatial complexity in rerunning algorithm of sequential patterns query, this paper proposes sequential patterns based and projection database based algorithm for fast interactive sequential patterns mining algorithm (FISP), in which the number of frequent items of the projection databases constructed by the correct mining which based on the previously mined sequences has been reduced. Furthermore, the algorithm's iterative running times are reduced greatly by, using global-threshold. The results of experiments testify that FISP outperforms PrefixSpan in interactive mining.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Han J, Kamber M.Data Mining: Concepts and Techniques. San Francisco, CA, USA:, Morgan Kaufmann Publisher Inc. 2001. 283–284.
Agrawal C C, Yu P S. Online Generation of Association Rules.Proceedings of the 14 th International Conference on Data Engineering. Orlando, Florida, USA, Feb. 1998. 402–411.
Han J, Pei J, Mortazavi-Asl B,et al. PrefixSpan: Mining Sequence Patterns Efficiently by Prefixprojected Pattern Growth.Proceedings of the International Conference on Data Engineering Heidelberg, Germany: IEEE Press, 2001. 215–226.
Agrawal R, Srikant R. Mining Sequential Patterns: Generalizations and Performance Improvements.Proceedings of the International Conference on Extending Data base Technology. New York: Springer Verlag, 1996. 3–17.
Zaki M J. Efficient Enumeration of Frequent Sequences.Proceedings of the 1998 Assaciation for Computing Machinery (ACM) 7 th International Conference on Information and Knowledge Management (CIKM'98). Washington, United States. November 1998.
Han J, Pei J, Mortazavi-Asl B,et al. Freespan: Frequent Pattern-Projected Sequential Pattern Mining.Proceedings of the International Conference on Knowledge Discovery and Data Mining. Montreal, Conada. (ACM), 2000. 355–359.
Nag B, Deshpande P M, DeWitt D J. Using a Knowledge Cache for Interactive Discovery of Association Rules.Proceedings of the 1999SIGKDD Conference. San Diego, California, Aug. 1999. 244–253.
Hidber C.Online Association Rule Mining. Technical Report UCB/CSD-98-1004, U. C. at Barkeley, 1998.
Parthasarathy S, Dwarkadas S, Ogihara M. Active Mining in a Distributed Setting.Proceedings of Workshop on Large-Scale Parallel KDD Systems. San Diego, CA, USA, Aug. 1999. 65–85.
Parthasarathy S. Zaki M J, Ogihara M,et al. Incremental and Interactive Sequence Mining.Proceedings of the 8 th International Conference on Information and Knowledge Management. Kansas, Missouri, USA, Nov. 1999. 65–85.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Fundation of China (70371015) and the Natural Science Foundation of Jiangsu Province (BK2004058)
Biography: LU Jie-ping(1959-), male, Ph. D. candidate, Professor, research direction: data mining and knowledge discovery.
Rights and permissions
About this article
Cite this article
Jie-ping, L., Yue-bo, L., Wei-wei, N. et al. A fast interactive sequential pattern mining algorithm. Wuhan Univ. J. Nat. Sci. 11, 31–36 (2006). https://doi.org/10.1007/BF02831699
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831699