Abstract
In the past, incremental mining approaches usually considered getting the newest set of knowledge consistent with the entire set of data inserted so far. Users can not, however, use them to obtain rules or patterns only from their interesting portion of the data. In addition, these approaches only focused on finding frequent patterns in a specified part of a database. That is, although the data records are collected in under certain time, place and category, such contexts (circumstances) have been ignored in conventional mining algorithms. It will cause the lack of patterns or rules to help users solve problems at different aspects and with diverse considerations. In this paper, we thus attempt to extend incremental mining to online decision support under multidimensional context considerations. We first propose the multidimensional pattern relation to structurally and systematically retain the additional context information and mining information for each inserted dataset into a database. We then develop an algorithm based on the proposed multidimensional pattern relation to correctly and effciently fulfill diverse on-line mining requests.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Wang, CY., Hong, TP., Tseng, SS. Multidimensional On-line Mining. In: Young Lin, T., Ohsuga, S., Liau, CJ., Hu, X. (eds) Foundations and Novel Approaches in Data Mining. Studies in Computational Intelligence, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539827_14
Download citation
DOI: https://doi.org/10.1007/11539827_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28315-7
Online ISBN: 978-3-540-31229-1
eBook Packages: EngineeringEngineering (R0)