Partially monotone networks applied to breast cancer detection on mammograms

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In many prediction problems it is known that the response variable depends monotonically on most of the explanatory variables but not on all. Often such partially monotone problems cannot be accurately solved by unconstrained methods such as standard neural networks. In this paper we propose so-called MIN-MAX networks that are partially monotone by construction. We prove that this type of networks have the uniform approximation property, which is a generalization of the result by Sill on totally monotone networks. In a case study on breast cancer detection on mammograms we show that enforcing partial monotonicity constraints in MIN-MAX networks leads to models that not only comply with the domain knowledge but also outperform in terms of accuracy standard neural networks especially if the data set is relative small. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Velikova, M., Daniels, H., & Samulski, M. (2008). Partially monotone networks applied to breast cancer detection on mammograms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5163 LNCS, pp. 917–926). https://doi.org/10.1007/978-3-540-87536-9_94

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free