File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient parallel mining of association rules on shared-memory multiple-processor machine

TitleEfficient parallel mining of association rules on shared-memory multiple-processor machine
Authors
Hu, KanCheung, David WXia, Shaowei
Issue Date1998
PublisherIEEE.
Citation
Proceedings Of The Ieee International Conference On Intelligent Processing Systems, Icips, 1998, v. 2, p. 1133-1137 How to Cite?
DOI: http://dx.doi.org/10.1109/ICIPS.1997.669161
AbstractIn this paper we consider the problem of parallel mining of association rules on a shared-memory multiprocessor system. Two efficient algorithms PSM and HSM have been proposed. PSM adopted two powerful candidate set pruning techniques distributed pruning and global pruning to reduce the size of candidates. HSM further utilized an I/O reduction strategy to enhance its performance. We have implemented PSM and HSM on a SGI Power Challenge parallel machine. The performance studies show that PSM and HSM out perform CD-SM, which is a shared-memory parallel version of the popular Apriori algorithm.
Persistent Identifierhttp://hdl.handle.net/10722/45585

 

DC FieldValueLanguage
dc.contributor.authorHu, Kanen_HK
dc.contributor.authorCheung, David Wen_HK
dc.contributor.authorXia, Shaoweien_HK
dc.date.accessioned2007-10-30T06:29:44Z-
dc.date.available2007-10-30T06:29:44Z-
dc.date.issued1998en_HK
dc.identifier.citationProceedings Of The Ieee International Conference On Intelligent Processing Systems, Icips, 1998, v. 2, p. 1133-1137en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45585-
dc.description.abstractIn this paper we consider the problem of parallel mining of association rules on a shared-memory multiprocessor system. Two efficient algorithms PSM and HSM have been proposed. PSM adopted two powerful candidate set pruning techniques distributed pruning and global pruning to reduce the size of candidates. HSM further utilized an I/O reduction strategy to enhance its performance. We have implemented PSM and HSM on a SGI Power Challenge parallel machine. The performance studies show that PSM and HSM out perform CD-SM, which is a shared-memory parallel version of the popular Apriori algorithm.en_HK
dc.format.extent511836 bytes-
dc.format.extent6619 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings of the IEEE International Conference on Intelligent Processing Systems, ICIPSen_HK
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.-
dc.titleEfficient parallel mining of association rules on shared-memory multiple-processor machineen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailCheung, David W:dcheung@cs.hku.hken_HK
dc.identifier.authorityCheung, David W=rp00101en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICIPS.1997.669161en_HK
dc.identifier.scopuseid_2-s2.0-0031650175en_HK
dc.identifier.hkuros31079-
dc.identifier.volume2en_HK
dc.identifier.spage1133en_HK
dc.identifier.epage1137en_HK
dc.identifier.scopusauthoridHu, Kan=7203085144en_HK
dc.identifier.scopusauthoridCheung, David W=34567902600en_HK
dc.identifier.scopusauthoridXia, Shaowei=7202893313en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats