A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text-Reference-Cited by-同舟云学术

A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

Published:2004 Issue: Volume: Page:478-486
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

García-Hernández René A.,Martínez-Trinidad José Fco.,Carrasco-Ochoa Jesús Ariel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30463-0_60.pdf

Reference10 articles.

1. Fayyad, U., Piatetsky-Shapiro, G.: Advances in Knowledge Discovery and Data mining. AAAI Press, Menlo Park (1996)

2. Feldman, R., Dagan, I.: Knowledge Discovery in Textual Databases (KDT). In: Proceedings of the 1st International Conference on Knowledge Discovery, KDD 1995 (1995)

3. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proceedings of the International Conference on Data Engineering (1995)

4. Lin, Dao-I. Fast Algorithms for Discovering the Maximum Frequent Set, Ph. Thesis, New York University (1998)

5. Pei, J.H., et al.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proc International Conference on Data Engineering, ICDE 2001 (2001)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear Optimization for Solving Other NLP Tasks;Studies in Computational Intelligence;2022

2. SPaC-NF: A classifier based on sequential patterns with high netconf;Intelligent Data Analysis;2016-09-18

3. SPaR-FTR: An Efficient Algorithm for Mining Sequential Patterns-Based Rules;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2015

4. Graph Ranking on Maximal Frequent Sequences for Single Extractive Text Summarization;Computational Linguistics and Intelligent Text Processing;2014

5. SPaMi-FTS: An Efficient Algorithm for Mining Frequent Sequential Patterns;Advanced Information Systems Engineering;2014