Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "break-down-and-build-up" methodology. The "breakdown" is based on the observation that all occurrences of a fr...
Saved in:
Main Authors: | ZHU, Feida, YAN, Xifeng, HAN, Jiawei, YU, Philip S. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/933 https://ink.library.smu.edu.sg/context/sis_research/article/1932/viewcontent/EfficientDiscoveryFrequentAppSeqPatterns_2007.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining normalized weighted frequent sequential patterns with Time intervals algorithm
by: Trần Huy Dương, Vũ Đức Thi
Published: (2016) -
Thuật toán khai phá mẫu dãy thường xuyên trọng số chuẩn hóa với khoảng cách thời gian
by: Trần Huy Dương, Vũ Đức Thi
Published: (2016) -
Non-redundant sequential rules-Theory and algorithm
by: Lo, D., et al.
Published: (2013) -
Non-Redundant Sequential Rules - Theory and Algorithm
by: LO, David, et al.
Published: (2009) -
Approximate Bayesian Computation for Smoothing
by: Martin, J.S., et al.
Published: (2016)