Ashokkumar Patel

Constructing computer programs that automatically improve with experience is the main task of machine learning. The key algorithms in the area are presented. Learning concepts as decision trees, artificial neural networks and Bayesian approach are discussed. The standard iterative dichotomizer (ID3) is presented, the issues of overfitting, attribute selection and handling missing data are discussed. Neural nets are discussed in detail, examples of supervised and unsupervised learning are presented. Instance-based learning, i.e. k-nearest neighbor learning, case-based reasoning are introduced. Genetic algorithms are discussed on introductory level.

The relational, hierarchical, and network approaches to database systems, including relational algebra and calculus, data dependencies, normal forms, data semantics, query optimization, and concurrency control on distributed database systems.

Prerequisites: Completion of three core courses.   Development of a detailed, significant project in computer science under the close supervision of a faculty member, perhaps as one member of a student team. This project may be a software implementation, a design effort, or a theoretical or practical written analysis. Project report with optional oral presentation must be evaluated by three faculty members including the project supervisor.