Abstract
Databases, when used to collect data in the dynamic world, change over time. As a consequence, different parts of a database that come into the database at different times may contain activities with different characteristics. In other words, the data in the database are “non-uniform”. This non-uniformity of the database gives rise to the idea of a Divide and Conquer strategy that divides a very large and non-uniform database into component parts for better mining. Experiments conducted show that the method is effective under various situations.
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
Charu C. Aggarwal and Philip S. Yu, “A new framework for itemset generation,” PODS, 1998, pp. 18–24.
Rakesh Agrawal and Ramakrishnan Srikant, “Mining Sequential Patterns,” IEEE Eleventh International Conference on Data Engineering, IEEE Computer Society Press, 1995.
Heikki Mannila, Hannu Toivonen and A.Inkeri Verkamo, “Discovering Frequent Episodes in Sequences,” First Conference on Knowledge Discovery and Data Mining, Montreal, California, August 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, D., Wang, X.S. (2000). Discovering Sequential Patterns from Non-uniform Databases. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_13
Download citation
DOI: https://doi.org/10.1007/3-540-45151-X_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67627-0
Online ISBN: 978-3-540-45151-8
eBook Packages: Springer Book Archive