Related content

Greedy algorithms, H-colourings and a complexity-theoretic dichotomy

By Puricella A.   Stewart I.A.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1897-1913

Elsevier

Access to resources Recommend Favorite

Average case analysis of greedy algorithms for optimisation problems on set systems

By Blot J.   de la Vega W.F.   Paschos V.T.   Saad R.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 267-298

Elsevier

Access to resources Recommend Favorite

Dimensionality optimization by heuristic greedy learning vs. genetic algorithms in knowledge discovery and data mining

By Fu Z.  

Intelligent Data Analysis, Vol. 3, Iss. 3, 1999-09 ,pp. : 211-225

Elsevier

Access to resources Recommend Favorite

Parallel Formulations of Decision-Tree Classification Algorithms

By Srivastava Anurag   Han Eui-Hong   Kumar Vipin   Singh Vineet  

Data Mining and Knowledge Discovery, Vol. 3, Iss. 3, 1999-09 ,pp. : 237-261

Springer Publishing Company

Access to resources Recommend Favorite

A Microchoice Bound for Continuous-Space Classification Algorithms

By Gat Y.  

Machine Learning, Vol. 53, Iss. 1-2, 2003-10 ,pp. : 5-21

Springer Publishing Company

Access to resources Recommend Favorite