File Download
Supplementary

Conference Paper: A general incremental technique for maintaining discovered association rules

TitleA general incremental technique for maintaining discovered association rules
Authors
KeywordsAssociation Rules
Data Mining
Knowledge Discovery
Large Databases
Maintenance
Issue Date1997
PublisherIEEE.
Citation
The 5th International Conference on Database Systems for Advanced Applications, Melbourne, Australia, 1-4 April 1997. In Conference Proceedings, 1997, p. 185-194 How to Cite?
AbstractA more general incremental updating technique is developed for maintaining the association rules discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. A previously proposed algorithm FUP can only handle the maintenance problem in the case of insertion. The proposed algorithm FUP2 makes use of the previous mining result to cut down the cost of finding the new rules in an updated database. In the insertion only case, FUP2 is equivalent to FUP. In the deletion only case, FUP2 is a complementary algorithm of FUP which is very efficient when the deleted transactions is a small part of the database, which is the most applicable case. In the general case, FUP2 can efficiently update the discovered rules when new transactions are added to a transaction database, and obsolete transactions are removed from it. The proposed algorithm has been implemented and its performance is studied and compared with the best algorithms for mining association rules studied so far. The study shows that the new incremental algorithm is significantly faster than the traditional approach of mining the whole updated database.
Persistent Identifierhttp://hdl.handle.net/10722/57231

 

DC FieldValueLanguage
dc.contributor.authorCheung, DWen_HK
dc.contributor.authorLee, SDen_HK
dc.contributor.authorKao, Ben_HK
dc.date.accessioned2010-04-12T01:30:10Z-
dc.date.available2010-04-12T01:30:10Z-
dc.date.issued1997en_HK
dc.identifier.citationThe 5th International Conference on Database Systems for Advanced Applications, Melbourne, Australia, 1-4 April 1997. In Conference Proceedings, 1997, p. 185-194en_HK
dc.identifier.urihttp://hdl.handle.net/10722/57231-
dc.description.abstractA more general incremental updating technique is developed for maintaining the association rules discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. A previously proposed algorithm FUP can only handle the maintenance problem in the case of insertion. The proposed algorithm FUP2 makes use of the previous mining result to cut down the cost of finding the new rules in an updated database. In the insertion only case, FUP2 is equivalent to FUP. In the deletion only case, FUP2 is a complementary algorithm of FUP which is very efficient when the deleted transactions is a small part of the database, which is the most applicable case. In the general case, FUP2 can efficiently update the discovered rules when new transactions are added to a transaction database, and obsolete transactions are removed from it. The proposed algorithm has been implemented and its performance is studied and compared with the best algorithms for mining association rules studied so far. The study shows that the new incremental algorithm is significantly faster than the traditional approach of mining the whole updated database.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference on Database Systems for Advanced Applications Proceedings-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectAssociation Rulesen_HK
dc.subjectData Miningen_HK
dc.subjectKnowledge Discoveryen_HK
dc.subjectLarge Databasesen_HK
dc.subjectMaintenanceen_HK
dc.titleA general incremental technique for maintaining discovered association rulesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailCheung, DW: dcheung@cs.hku.hken_HK
dc.identifier.emailLee, SD: sdlee@cs.hku.hken_HK
dc.identifier.emailKao, B: kao@cs.hku.hken_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.hkuros42672-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats