3 citations found. Retrieving documents...
T.-S. Lim, W.-Y. Loh, and Y.-S. Shih, "A comparison of prediction accuracy, complexity, and training time of 33 old and new classification algorithms," Machine Learning, vol. 40, pp. 203--228, 2000.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Omnivariate Decision Trees - Yildiz, al.   (Correct)

....2001, pp. 1977 1982. 9] J. G. Proakis, Digital Communication. New York: McGraw Hill, 1995. 10] T. Kim, Y. Kim, J. Park, K. Ko, S. Choi, C. Kang, and D. Hong, Performance of an MC CDMA system with frequency offsets in correlated fading, in Proc. IEEE ICC 2000, vol. 2, 2000, pp. 1095 1099. [11] S. Hara and R. Prasad, DS CDMA, MC CDMA and MT CDMA for mobile multimedia communications, in Proc. IEEE VTC 96, 1996, pp. 1106 1110. 12] K. Ko, S. Choi, and D. Hong, Multistage interference cancellation for an MC CDMA systems with carrier frequency offset, Proc. IEEE ICOIN 13, pp. ....

....tree construction continues recursively for each child with training instances taking that branch. Surveys about constructing and simplifying decision trees can be found in [6] and [15] A recent survey comparing different decision tree methods with other classification algorithms is given in [11]. The best split is when all the instances from a class lie on the same side of the decision boundary, i.e. return the same truth value for fm . There are various measures proposed for measuring the impurity of a split; examples are entropy [17] and the Gini index [4] Murthy et al. 14] ....

T.-S. Lim, W.-Y. Loh, and Y.-S. Shih, "A comparison of prediction accuracy, complexity, and training time of 33 old and new classification algorithms," Machine Learning, vol. 40, pp. 203--228, 2000.


Feature Transformation Methods in Data Mining - Member (2001)   (Correct)

....revised July 25, 2001. The author is with the Intelligent Systems Laboratory, Department of Mechanical and Industrial Engineering, The University of Iowa, Iowa City, IA 52242 1527 USA (e mail: andrew kusiak uiowa.edu) Publisher Item Identifier S 1521 334X(01)08957 1. TABLE I DATA SET Lim [20] presented a comprehensive comparative study of over thirty learning algorithms of categories A, B, C, E, and F. The background of the category D learning algorithms is provided in [21] The algorithms of class G are discussed in [22] The roots of the class G algorithms are in evolutionary ....

T.-S. Lim, W.-Y. Loh, and Y.-S. Shih, "A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms," Mach. Learn., vol. 40, pp. 203--228, 2000.


G-Algorithm for Extraction of Robust Decision.. - Kusiak, Law, II (2001)   (Correct)

.... and Slowinski [11] 12] all based on the theory proposed by Pawlak [9] Examples of other algorithms and developments in learning and data mining can be found in the edited volumes by Lin and Cecerone [13] Carbonell [14] Michalski et al. 15] and the book by Mitchell [16] Lim et al. [17] presented an extensive survey of learning algorithms. III. EXAMPLES OF RULE EXTRACTION The example presented below illustrates the rules derived with different rule extraction algorithms. A. Example 1 Consider the data set shown in Fig. 1. The rules shown in Fig. 2 are derived form the data ....

....Rule 5. IF (Age at Fontan in [1.6275, 2.25] AND (Wire SNRT = 149) AND (PreFon PVP mean = 6) AND (Age HFP = 0.327) THEN (Inducible IART = Y) 4, 26.67 , 100.00 ] 8, 10, 31, 35] Rule 6. IF (Age HFP in [0.4545, 0.4665] AND (PreFon PVP mean = 6) THEN (Inducible IART = Y) 1, 6. 67 , 100.00 ] [17] B. Test Case 2 Rules Decision: Post Op Arrhy1 = IART Rule 1. IF (Circ Arrest Time = 3) THEN (Post Op Arrhy1 = IART) 1, 50.00 , 100.00 ] 21] Rule 2. IF (Days in ICU = 1) AND (Days before d c in [9, 11] AND (Pump Time = 44) THEN (Post Op Arrhy1 = IART) 1, 50.00 , 100.00 ] 11] ....

[Article contains additional citation context not shown here]

T.-S. Lim, W.-Y. Loh, and Y.-S. Shih, "A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms," Mach. Learn., vol. 40, pp. 203--228, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC