Abstract
In the past, we proposed an extended multidimensional pattern relation (EMPR) to structurally and systematically store previously mining information for each inserted block of data, and designed a negative-border online mining (NOM) approach to provide ad-hoc, query-driven and online mining supports. In this paper, we try to use appropriate data structures and design efficient algorithms to improve the performance of the NOM approach. The lattice data structure is utilized to organize and maintain all candidate itemsets such that the candidate itemsets with the same proper subsets can be considered at the same time. The derived lattice-based NOM (LNOM) approach will require only one scan of the itemsets stored in EMPR, thus saving much computation time. In addition, a hashing technique is used to further improve the performance of the NOM approach since many itemsets stored in EMPR may be useless for calculating the counts of candidates. At last, experimental results show the effect of the improved NOM approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Yu, P.S.: A New Approach to Online Generation of Association Rules. IEEE Transactions on Knowledge and Data Engineering 13(4), 527–540 (2001)
Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: The ACM International Conference on Very Large Data Bases, pp. 487–499 (1994)
Aref, W.G., Elfeky, M.G., Elmagarmid, A.K.: Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-series Databases. IEEE Transactions on Knowledge and Data Engineering 16(3), 332–342 (2004)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Approach. In: The IEEE International Conference on Data Engineering, pp. 106–114 (1996)
Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. Combinatorica 6(2), 109–122 (1986)
Hong, T.P., Wang, C.Y., Tao, Y.H.: A New Incremental Data Mining Algorithm Using Pre-large Itemsets. An International Journal: Intelligent Data Analysis, 111–129 (2001)
Immon, W.H.: Building the Data Warehouse. Wiley Computer Publishing, Chichester (1996)
Mannila, H., Toivonen, H.: On an Algorithm for Finding All Interesting Sentences. In: The European Meeting on Cybernetics and Systems Research, pp. 973–978 (1996)
Park, J.S., Chen, M.S., Yu, P.S.: Using a Hash-based Method with Transaction Trimming for Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering 9(5), 812–825 (1997)
Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An Efficient Algorithm for the Incremental Update of Association Rules in Large Databases. In: The International Conference on Knowledge Discovery and Data Mining, pp. 263–266 (1997)
Wang, C.Y., Tseng, S.S., Hong, T.P.: Flexible Online Association Rule Mining Based on Multidimensional Pattern Relations. An International Journal: Information Sciences (2005) (to appear)
Wang, C.Y., Tseng, S.S., Hong, T.P., Chu, Y.S.: Online Generation of Association Rules under Multidimensional Consideration Based on Negative-border. Journal of Information Science and Engineering (2005) (to appear)
Widom, J.: Research Problems in Data Warehousing. In: The ACM International Conference on Information and Knowledge Management, pp. 25–30 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, CY., Tseng, SS., Hong, TP. (2006). Improved Negative-Border Online Mining Approaches. In: Ng, WK., Kitsuregawa, M., Li, J., Chang, K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science(), vol 3918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731139_56
Download citation
DOI: https://doi.org/10.1007/11731139_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33206-0
Online ISBN: 978-3-540-33207-7
eBook Packages: Computer ScienceComputer Science (R0)