Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Chao-Tungen_US
dc.contributor.authorShih, Wen-Chungen_US
dc.contributor.authorTseng, Shian-Shyongen_US
dc.date.accessioned2018-08-21T05:56:28Z-
dc.date.available2018-08-21T05:56:28Z-
dc.date.issued2008-01-01en_US
dc.identifier.issn1098-7584en_US
dc.identifier.urihttp://dx.doi.org/10.1109/FUZZY.2008.4630704en_US
dc.identifier.urihttp://hdl.handle.net/11536/146227-
dc.description.abstractEffective data distribution techniques can significantly reduce the total execution time of a program on grid computing environments, especially for data mining applications. In this paper, we describe a linear programming formulation for the data distribution problem on grids. Furthermore, a heuristic method, named HDDS (Heuristic Data Distribution Scheme), is proposed to solve this problem. We implement the parallel association rule mining method and conduct the experimentations on our grid testbed. Experimental results showed that data mining programs using our HDDS to distribute data could execute more efficiently than traditional schemes could.en_US
dc.language.isoen_USen_US
dc.titleA Heuristic Data Distribution Scheme for Data Mining Applications on Grid Environmentsen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/FUZZY.2008.4630704en_US
dc.identifier.journal2008 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-5en_US
dc.citation.spage2398en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000262974001138en_US
Appears in Collections:Conferences Paper