Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
9-2003
Abstract
Computing the frequency of a pattern is one of the key operations in data mining algorithms. Recently, the Optimized Segment Support Map (OSSM) was introduced as a simple but powerful way of speeding up any form of frequency counting satisfying the monotonicity condition. However, the construction cost to obtain the ideal OSSM is high, and makes it less attractive in practice. In this paper, we propose the FSSM, a novel algorithm that constructs the OSSM quickly using a FP-Tree. Given a user-defined segment size, the FSSM is able to construct the OSSM at a fraction of the time required by the algorithm previously proposed. More importantly, this fast construction time is achieved without compromising the quality of the OSSM. Our experimental results confirm that the FSSM is a promising solution for constructing the best OSSM within user given constraints.
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Publication
Data Warehousing and Knowledge Discovery: 5th International Conference, DaWak 2003, Prague, Czech Republic, September 3-5, 2003: Proceedings
Volume
2737
First Page
257
Last Page
266
ISBN
9783540408079
Identifier
10.1007/978-3-540-45228-7_26
Publisher
Springer Verlag
City or Country
Berlin
Citation
ONG, Kok-Leong; NG, Wee-Keong; and LIM, Ee Peng.
SSM: Fast construction of the Optimized Segment Support Map. (2003). Data Warehousing and Knowledge Discovery: 5th International Conference, DaWak 2003, Prague, Czech Republic, September 3-5, 2003: Proceedings. 2737, 257-266.
Available at: https://ink.library.smu.edu.sg/sis_research/1028
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1007/978-3-540-45228-7_26
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons