File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient mining of association rules in distributed databases

TitleEfficient mining of association rules in distributed databases
Authors
KeywordsAssociation rule
Data mining
Distributed algorithm
Distributed data mining
Distributed database
Knowledge discovery
Partitioned database
Issue Date1996
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tkde
Citation
Ieee Transactions On Knowledge And Data Engineering, 1996, v. 8 n. 6, p. 911-922 How to Cite?
AbstractMany sequential algorithms have been proposed for mining of association rules. However, very little work has been done in mining association rules in distributed databases. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. In this study, an efficient algorithm, DMA, is proposed. It generates a small number of candidate sets and requires only O(n) messages for support count exchange for each candidate set, where n is the number of sites in a distributed database. The algorithm has been implemented on an experimental test bed and its performance is studied. The results show that DMA has superior performance when comparing with the direct application of a popular sequential algorithm in distributed databases. ©1996 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/43636
ISSN
2015 Impact Factor: 2.476
2015 SCImago Journal Rankings: 2.087
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorCheung, DWen_HK
dc.contributor.authorNg, VTen_HK
dc.contributor.authorFu, AWen_HK
dc.contributor.authorFu, Yen_HK
dc.date.accessioned2007-03-23T04:50:59Z-
dc.date.available2007-03-23T04:50:59Z-
dc.date.issued1996en_HK
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 1996, v. 8 n. 6, p. 911-922en_HK
dc.identifier.issn1041-4347en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43636-
dc.description.abstractMany sequential algorithms have been proposed for mining of association rules. However, very little work has been done in mining association rules in distributed databases. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. In this study, an efficient algorithm, DMA, is proposed. It generates a small number of candidate sets and requires only O(n) messages for support count exchange for each candidate set, where n is the number of sites in a distributed database. The algorithm has been implemented on an experimental test bed and its performance is studied. The results show that DMA has superior performance when comparing with the direct application of a popular sequential algorithm in distributed databases. ©1996 IEEE.en_HK
dc.format.extent1648560 bytes-
dc.format.extent26624 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tkdeen_HK
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineeringen_HK
dc.rights©1996 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectAssociation ruleen_HK
dc.subjectData miningen_HK
dc.subjectDistributed algorithmen_HK
dc.subjectDistributed data miningen_HK
dc.subjectDistributed databaseen_HK
dc.subjectKnowledge discoveryen_HK
dc.subjectPartitioned databaseen_HK
dc.titleEfficient mining of association rules in distributed databasesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1041-4347&volume=8&issue=6&spage=911&epage=922&date=1996&atitle=Efficient+mining+of+association+rules+in+distributed+databasesen_HK
dc.identifier.emailCheung, DW:dcheung@cs.hku.hken_HK
dc.identifier.authorityCheung, DW=rp00101en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/69.553158en_HK
dc.identifier.scopuseid_2-s2.0-0030379749en_HK
dc.identifier.hkuros26194-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030379749&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume8en_HK
dc.identifier.issue6en_HK
dc.identifier.spage911en_HK
dc.identifier.epage922en_HK
dc.identifier.isiWOS:A1996WC05700005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridCheung, DW=34567902600en_HK
dc.identifier.scopusauthoridNg, VT=7102162966en_HK
dc.identifier.scopusauthoridFu, AW=25957576800en_HK
dc.identifier.scopusauthoridFu, Y=7404433401en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats