research-article

Mining frequent sequential patterns with first-occurrence forests

Authors:

Erich A. Peterson,

Peiyi TangAuthors Info & Claims

ACMSE '08: Proceedings of the 46th annual ACM Southeast Conference

Pages 34 - 39

https://doi.org/10.1145/1593105.1593115

Published: 28 March 2008 Publication History

Get Access

Abstract

In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers to the first-occurrences of a symbol in the aggregate tree [1], as the basic data structure for database representation, and does not rebuild aggregate trees for projection databases. The experimental evaluation shows that our new FOF mining algorithm outperforms the PLWAP-tree mining algorithm [2] and the FLWAP-tree mining algorithm [3], both in the mining time and the amount of memory used.

References

[1]

Myra Spiliopoulou and Lukas C. Faulstich. WUM: A tool for web utilization analysis. In Proceedings of EDBT Workshop Web DB'98. Springer Verlag, LNCS 1590, 1998.

Digital Library

Google Scholar

[2]

Christie I. Ezeife and Yi Lu. Mining web log sequential patterns with position coded pre-order linked wap-tree. International Journal of Data Mining and Knowledge Discovery, 10:5--38, 2005.

Digital Library

Google Scholar

[3]

Peiyi Tang, Markus P. Turkia, and Kyle A. Gallivan. Mining web access patterns with first-occurrence linked WAP-trees. In Proceedings of the 16th International Conference on Software Engineering and Data Engineering (SEDE'07), pages 247--252, Las Vegas, USA, July 2007.

Google Scholar

[4]

Ramakrishnan Srikant and Rakesh Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the International Conference on Extending Database Technology, pages 3--17, 1996.

Digital Library

Google Scholar

[5]

Jian Pei, Jiawei Han, Behzad Mortazavi-asl, and Hua Zhu. Mining access patterns efficiently from web logs. In Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), pages 396--407. Lecture Notes in Computer Science, Vol. 1805, 2000.

Digital Library

Google Scholar

[6]

Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International on Management of Data, pages 1--12. ACM Press, 2000.

Digital Library

Google Scholar

Cited By

View all

Navarro OCumplido RVillaseñor-Pineda LFeregrino-Uribe CCarrasco-Ochoa J(2014)A Node Linkage Approach for Sequential Pattern MiningPLoS ONE10.1371/journal.pone.00954189:6(e95418)Online publication date: 16-Jun-2014
https://doi.org/10.1371/journal.pone.0095418
Onal KKaragoz PAkerkar RBassiliades NDavies JErmolayev V(2014)Improving Efficiency of Sequence Mining by Combining First Occurrence Forest (FOF) Strategy and Sibling PrincipleProceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14)10.1145/2611040.2611061(1-9)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2611040.2611061
Rajimol ARaju G(2011)FOL-Mine - A More Efficient Method for Mining Web Access PatternAdvances in Computing and Communications10.1007/978-3-642-22714-1_27(253-262)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22714-1_27
Show More Cited By

Index Terms

Mining frequent sequential patterns with first-occurrence forests
1. Information systems
  1. Information systems applications
    1. Data mining

Recommendations

A hybrid approach to mining frequent sequential patterns
ACMSE '09: Proceedings of the 47th annual ACM Southeast Conference

The mining of frequent sequential patterns has been a hot and well studied area---under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)---for well over a decade. Yet researchers are still uncovering interesting problems, ...
Closed frequent similar pattern mining

The concept of closed frequent similar pattern mining is introduced.Several lemmas to prune the search space are introduced and proved.A novel closed frequent similar pattern mining algorithm (CFSP-Miner), is proposed.CFSP-Miner is more efficient than ...
Maximum item first pattern growth for mining frequent patterns
RSFDGrC'03: Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Frequent pattern mining plays an essential role in many important data mining tasks. FP-Growth, an algorithm which mines frequent patterns in the frequent pattern tree (FP-tree), is very efficient. However, it still encounters performance bottlenecks ...

Comments

Information & Contributors

Information

Published In

ACMSE '08: Proceedings of the 46th annual ACM Southeast Conference

March 2008

548 pages

ISBN:9781605581057

DOI:10.1145/1593105

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ACM SE08

ACM SE08: ACM Southeast Regional Conference

March 28 - 29, 2008

Alabama, Auburn

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
144
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Navarro OCumplido RVillaseñor-Pineda LFeregrino-Uribe CCarrasco-Ochoa J(2014)A Node Linkage Approach for Sequential Pattern MiningPLoS ONE10.1371/journal.pone.00954189:6(e95418)Online publication date: 16-Jun-2014
https://doi.org/10.1371/journal.pone.0095418
Onal KKaragoz PAkerkar RBassiliades NDavies JErmolayev V(2014)Improving Efficiency of Sequence Mining by Combining First Occurrence Forest (FOF) Strategy and Sibling PrincipleProceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14)10.1145/2611040.2611061(1-9)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2611040.2611061
Rajimol ARaju G(2011)FOL-Mine - A More Efficient Method for Mining Web Access PatternAdvances in Computing and Communications10.1007/978-3-642-22714-1_27(253-262)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22714-1_27
Rajimol ARaju G(2010)Web access pattern mining --- a surveyProceedings of the Second international conference on Data Engineering and Management10.1007/978-3-642-27872-3_4(24-31)Online publication date: 29-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-27872-3_4
Peterson ETang PMcGregor J(2009)A hybrid approach to mining frequent sequential patternsProceedings of the 47th annual ACM Southeast Conference10.1145/1566445.1566559(1-4)Online publication date: 19-Mar-2009
https://dl.acm.org/doi/10.1145/1566445.1566559

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A hybrid approach to mining frequent sequential patterns

Closed frequent similar pattern mining

Maximum item first pattern growth for mining frequent patterns

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations