File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICIPS.1997.669161
- Scopus: eid_2-s2.0-0031650175
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Efficient parallel mining of association rules on shared-memory multiple-processor machine
Title | Efficient parallel mining of association rules on shared-memory multiple-processor machine |
---|---|
Authors | |
Issue Date | 1998 |
Publisher | IEEE. |
Citation | Proceedings Of The Ieee International Conference On Intelligent Processing Systems, Icips, 1998, v. 2, p. 1133-1137 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/45585 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hu, Kan | en_HK |
dc.contributor.author | Cheung, David W | en_HK |
dc.contributor.author | Xia, Shaowei | en_HK |
dc.date.accessioned | 2007-10-30T06:29:44Z | - |
dc.date.available | 2007-10-30T06:29:44Z | - |
dc.date.issued | 1998 | en_HK |
dc.identifier.citation | Proceedings Of The Ieee International Conference On Intelligent Processing Systems, Icips, 1998, v. 2, p. 1133-1137 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45585 | - |
dc.description.abstract | In 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.extent | 511836 bytes | - |
dc.format.extent | 6619 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | Proceedings of the IEEE International Conference on Intelligent Processing Systems, ICIPS | en_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.title | Efficient parallel mining of association rules on shared-memory multiple-processor machine | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Cheung, David W:dcheung@cs.hku.hk | en_HK |
dc.identifier.authority | Cheung, David W=rp00101 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICIPS.1997.669161 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0031650175 | en_HK |
dc.identifier.hkuros | 31079 | - |
dc.identifier.volume | 2 | en_HK |
dc.identifier.spage | 1133 | en_HK |
dc.identifier.epage | 1137 | en_HK |
dc.identifier.scopusauthorid | Hu, Kan=7203085144 | en_HK |
dc.identifier.scopusauthorid | Cheung, David W=34567902600 | en_HK |
dc.identifier.scopusauthorid | Xia, Shaowei=7202893313 | en_HK |