![]() |
. | . | ![]() |
. | ||||
Mining Dynamic databases by Weighting1
Acta Cybernetica 16 (2003) 179-205. Abstract:
A dynamic database is a set of transactions, in which the content and the size can change over time. There is an essential difference between dynamic database mining and traditional database mining. This is because recently added transactions can be more `interesting' than those inserted long ago in a dynamic database. This paper presents a method for mining dynamic databases. This approach uses weighting techniques to increase efficiency, enabling us to reuse frequent itemsets mined previously. This model also considers the novelty of itemsets when assigning weights. In particular, this method can find a kind of new patterns from dynamic databases, referred to trend patterns. To evaluate the effectiveness and efficiency of the proposed method, we implemented our approach and compare it with existing methods. Footnotes
This research is partially supported by the Australian Research Council Discovery Grant (DP0343109) and partially supported by a large grant from the Guangxi Natural Science Funds Faculty of Information Technology, University of Technology, Sydney, PO Box 123, Broadway NSW 2007, Australia, and Guangxi Teachers University, Gulin, P R China. Email: zhangsc@it.uts.edu.au Faculty of Information Technology, University of Technology, Sydney, PO Box 123, Broadway NSW 2007, Australia. Email: liliu@it.uts.edu.au Web administrator 2003-10-13 |
||||||||
| Webmester:webmaster@inf.u-szeged.hu |