Article ID: | iaor2007330 |
Country: | United States |
Volume: | 17 |
Issue: | 4 |
Start Page Number: | 462 |
End Page Number: | 474 |
Publication Date: | Sep 2005 |
Journal: | INFORMS Journal On Computing |
Authors: | Chandrasekaran R., Jacob Varghese S., Ryu Young U., Hong Sungchul |
Keywords: | programming: linear |
Data classification and prediction problems are prevalent in many domains. The need to predict to which class a particular data point belongs has been seen in areas such as medical diagnosis, credit rating, Web filtering, prediction, and stock rating. This has led to strong interest in developing systems that can accurately classify data and predict outcome. The classification is typically based on the feature values of objects being classified. Often, a form of ordering relation, defined by feature values, on the objects to be classified is known. For instance, the objects belonging to one class have larger (or smaller) feature values than do those in the other class. Exploiting this characteristic of isotonicity, we propose a data-classification method called isotonic separation based on linear programming, especially network programming. The paper also addresses an extension of the isotonic-separation method for continuous outcome prediction. Applications of the isotonic separation for discrete outcome prediction and its extension for continuous outcome prediction are shown to illustrate its applicability.