Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||Santhi Thilagam, P.||-|
|dc.identifier.citation||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008, Vol.4904 LNCS, , pp.251-256||en_US|
|dc.description.abstract||Association rule mining is one of the most researched areas because of its applicability in various fields. We propose a novel data structure called Sequence Pattern Count, SPC, tree which stores the database compactly and completely and requires only one scan of the database for its construction. The completeness property of the SPC tree with respect to the database makes it more suitable for mining association rules in the context of changing data and changing supports without rebuilding the tree. A performance study shows that SPC tree is efficient and scalable. We also propose a Doubly Logaxithmic-depth Tree, DLT, algorithm which uses SPC tree to efficiently mine the huge amounts of geographically distributed datasets in order to minimize the communication and computation costs. DLT requires only O(n) messages for support count exchange and it takes only O(log log n) time for exchange of messages, which increases its efficiency. � Springer-Verlag Berlin Heidelberg 2008.||en_US|
|dc.title||An abstraction based communication efficient distributed association rule mining||en_US|
|Appears in Collections:||2. Conference Papers|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.