Abstract
Data mining is used to extract hidden information from a large set of data. From the various data mining algorithms available, frequent data mining is one of the most relevant algorithms. This algorithm has been used in varied fields ranging from medicine, weather forecasting, education, insurance, etc. Frequent mining (FM) algorithms have evolved from single processor to multiple processors. Limitation of using multiprocessors is increased cost and decreased throughput. Also the FM algorithms have been based on single process. This is an impediment in case of large data. One solution is to use multiple processes in multi-core environment.In this paper we propose a FM algorithm based on task parallelism. The algorithm is compared with FM algorithm based on data parallelism and serial algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
