ASIA unversity:Item 310904400/4739
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21654712      Online Users : 1003
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4739


    Title: Maintenance of discovered sequential patterns for record deletion
    Authors: C. Y. Wang;T. P. Hong;S. S. Tseng
    Contributors: Department of Information Science and Applications
    Keywords: data mining;sequential pattern;incremental mining
    Date: 2002
    Issue Date: 2009-11-30 08:03:21 (UTC+0)
    Publisher: Asia University
    Abstract: Mining sequential patterns from temporal transaction databases attempts to find customer behavior models and to assist managers in making correct and effective decisions. The sequential patterns discovered may, however, become invalid or inappropriate when databases are updated. Conventional approaches may re-mine entire databases to get correct sequential patterns for maintenance. However, when a database is massive in size, this will require considerable computation time. In the past, Lin and Lee proposed an incremental mining algorithm for maintenance of sequential patterns as new records were inserted. In addition to record insertion, record deletion is also commonly seen in real-world applications. Processing record deletion is, however, different from processing record insertion. The former can even be thought of the contrary of the latter. In this paper, we thus attempt to design an effective maintenance algorithm for sequential patterns as records are deleted. Our proposed algorithm utilizes previously discovered large sequences in the maintenance process, thus reducing numbers of rescanning databases. In addition, rescanning requirement depends on decreased numbers of customers, which are usually zero when numbers of deleted records are not large. This characteristic is especially useful for dynamic database mining.
    Relation: Intelligent Data Analysis 6(5):399-410
    Appears in Collections:[Department of Applied Informatics and Multimedia] Journal Article

    Files in This Item:

    File Description SizeFormat
    0KbUnknown468View/Open
    310904400-4739.doc40KbMicrosoft Word382View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback