Changes between Version 18 and Version 19 of Parallel-DT

Timestamp:

Jan 18, 2010, 6:07:09 PM (14 years ago)

Author:

alexandru.sorici

Comment:

--

Parallel-DT

@@ -5 +5 @@
 
  * Team members: Eremia Bogdan, Andrei Minca, Alexandru Sorici
- * Project Description: Classification is an important data mining problem. One of the most popular algorithms used for classification purposes
-                        are decision trees (DT). Since datasets that are used in data mining problems are usually very large, computationally 
-                        efficient and scalable algorithms are highly desirable. Thus, the project's goal is to parallelize the decision tree inference  
-                        process. A shared memory programming model using OpenMP is being considered for this task.
+ * Project Description: Classification is an important data mining problem. One of the most popular algorithms used for classification purposes are decision trees (DT). Since datasets that are used in data mining problems are usually very large, computationally efficient and scalable algorithms are highly desirable. Thus, the project's goal is to parallelize the decision tree inference process. A shared memory programming model using OpenMP is being considered for this task.
+
 ''' Serial DT process '''
  Most of the existing induction-based algorithms, also C4.5 that is analysed on this topic, use Hunt's method as the basic algorithm. Here is a recursive description of Hunt's method for constructing a decision tree from a set T of trainning cases with classes denoted {C1, C2, C3, ..., Ck} :