Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: With recent technological advances, shared memory parallel machines have become more scalable, and offer large main memories and high bus bandwidths. They are emerging as good platforms for data warehousing and data mining. In This work,  focus on shared memory parallelization of data mining algorithms.  have developed a series of techniques for parallelization of data mining algorithms, including full replication, full locking, fixed locking, optimized full locking, and cache-sensitive locking. Unlike previous work on shared memory parallelization of specific data mining algorithms, all of our techniques apply to a large number of popular data mining algorithms. In addition,  propose a reduction-object-based interface for specifying a data mining algorithm.  show how our runtime system can apply any of the techniques  have developed starting from a common specification of the algorithm.  have carried out a detailed evaluation of the parallelization techniques and the programming interface.  have experimented with apriori and fp-tree-based association mining, k-means clustering, k-nearest neighbor classifier, and decision tree construction. The main results from our experiments are as follows: 1) Among full replication, optimized full locking, and cache-sensitive locking, there is no clear winner. Each of these three techniques can outperform others depending upon machine and dataset parameters. These three techniques perform significantly better than the other two techniques. 2) Good parallel efficiency is achieved for each of the four algorithms  experimented with, using our techniques and runtime system. 3) The overhead of the interface is within 10 percent in almost all cases. 4) In the case of decision tree construction, combining different techniques turned out to be crucial for achieving high performance.
['Ruoming Jin', 'Ge Yang', 'Gagan Agrawal']
I am writing a research paper on a idea Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance
[{"from": "human", "value": "I am writing a research paper on a idea Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: With recent technological advances, shared memory parallel machines have become more scalable, and offer large main memories and high bus bandwidths. They are emerging as good platforms for data warehousing and data mining. In This work,  focus on shared memory parallelization of data mining algorithms.  have developed a series of techniques for parallelization of data mining algorithms, including full replication, full locking, fixed locking, optimized full locking, and cache-sensitive locking. Unlike previous work on shared memory parallelization of specific data mining algorithms, all of our techniques apply to a large number of popular data mining algorithms. In addition,  propose a reduction-object-based interface for specifying a data mining algorithm.  show how our runtime system can apply any of the techniques  have developed starting from a common specification of the algorithm.  have carried out a detailed evaluation of the parallelization techniques and the programming interface.  have experimented with apriori and fp-tree-based association mining, k-means clustering, k-nearest neighbor classifier, and decision tree construction. The main results from our experiments are as follows: 1) Among full replication, optimized full locking, and cache-sensitive locking, there is no clear winner. Each of these three techniques can outperform others depending upon machine and dataset parameters. These three techniques perform significantly better than the other two techniques. 2) Good parallel efficiency is achieved for each of the four algorithms  experimented with, using our techniques and runtime system. 3) The overhead of the interface is within 10 percent in almost all cases. 4) In the case of decision tree construction, combining different techniques turned out to be crucial for achieving high performance."}]