Paper
18 September 2001 Algorithm based on time-window for mining sequential patterns in relational database
Zhenyu Wang, Lifeng Bian, Xiaoshu Hang
Author Affiliations +
Proceedings Volume 4556, Data Mining and Applications; (2001) https://doi.org/10.1117/12.440302
Event: Multispectral Image Processing and Pattern Recognition, 2001, Wuhan, China
Abstract
Mining sequential patterns is an important topic in the data mining (DM) or knowledge discovery in database (KDD) research. At present, its research and application are mainly focused on analyzing transaction data of market. As the transaction database is very different from general relational database at the aspect of inner makeup, this paper makes relevant study and discussion on how to mine sequential patterns from general relational database. In this paper, a strategy based on time-window is adopted instead of general Apriori algorithm. At last, an algorithm based on time-window for mining sequential patterns (TW_SP) is put forward, and its correctness and validity is further proved by the experiment in a real relational database.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhenyu Wang, Lifeng Bian, and Xiaoshu Hang "Algorithm based on time-window for mining sequential patterns in relational database", Proc. SPIE 4556, Data Mining and Applications, (18 September 2001); https://doi.org/10.1117/12.440302
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Data mining

Mining

Adaptive optics

Analytical research

Knowledge discovery

Lithium

Back to Top