Lecture Notes in Computer Science, 2000, Volume 1846/2000, 139-144, DOI: 10.1007/3-540-45151-X_13

Discovering Sequential Patterns from Non-uniform Databases
(Extended Abstract)

Du Dang and X. Sean Wang

View Related Documents

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.

Fulltext Preview

Image of the first page of the fulltext document