Index Catalog // ScholarsArchive@OSU

Creator:: Dietterich, Thomas G.
Abstract:: Exploratory research contributes to the continued vitality of every discipline. The aim of exploratory research is to identify new tasks-tasks that cannot be solved by existing methods. Once a new task has been found, exploratory research seeks to develop a precise definition of the task and to understand the factors...
Resource Type:: Technical Report
Full Text:: ), Schlimmer & Fisher (1986), Utgoff (1988) , Quinlan (1988) , Mingers (1989) , Mooney, Shavlik, Towell

Creator:: Dietterich, Thomas G. and Bakiri, Ghulum
Abstract:: Multiclass learning problems involve finding a definition for an unknown function f(x) whose range is a discrete set containing k > 2 values (i.e., k "classes") . The definition is acquired by studying large collections of training examples of the form (xi, f(xi)) . Existing approaches to this problem include...
Resource Type:: Technical Report
Full Text:: can be implemented by the n output units of a single network. With decision trees, D n n l

Creator:: Dietterich, Thomas G., Hild, Hermann, and Bakiri, Ghulum
Abstract:: The performance of the error backpropagation (BP) and ID3 learning algorithms was compared on the task of mapping English text to phonemes and stresses. Under the distributed output code developed by Sejnowski and Rosenberg, it is shown that BP consistently out-performs 1D3 on this task by several percentage points. Three...
Resource Type:: Technical Report
Full Text:: /stress pair. We used the following dis- tance measure: d(x,y) = I:; Ix; - y;I. This reduces to the

Creator:: Dietterich, Thomas G., Hild, Hermann, and Bakiri, Ghulum
Abstract:: The performance of the error backpropagation (BP) and 1D3 learning algorithms was com- pared on the task of mapping English text to phonemes and stresses. Under the distributed output code developed by Sejnowski and Rosenberg, it is shown that BP consistently out- performs ID3 on this task by several percentage...
Resource Type:: Technical Report
Full Text:: nearest legal phoneme/stress pair. We used the following distance measure: d(x, y) = Li lxi - Yil• This

Creator:: Hild, Hermann
Resource Type:: Technical Report
Full Text:: represented as a string of phonemes an,d stresses, which caµ be pronounced by a hardware device, such as the

Creator:: Hild, Hermann
Abstract:: Summary of results. After implementing the plain ID3 algorithm, I experimented with various modifi cations. Two improvements of the process of finding a legal phoneme/stress could be made by using statistical information about the letter to phoneme/stress-mapping in the training set. Adding the CHI-SQUARE test to the ID3 algorithm was...
Resource Type:: Capstone Project
Full Text:: ". Let A = f A B C D E F G H I J K L M N O P Q R S T U V W X Y Z _ - .g P = f a b c d e f g h i k l m n o

Creator:: Wettschereck, Dietrich
Abstract:: Distance-based algorithms are machine learning algorithms that classify queries by computing distances between these queries and a number of internally stored exemplars. Exemplars that are closest to the query have the largest in uence on the classi cation assigned to the query. Two speci c distance-based algorithms, the nearest neighbor...
Resource Type:: Dissertation
Full Text:: classification, and w the weight of the exemplar. Given a query q R and a distance function d, the DBA output

ScholarsArchive@OSU