Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Paul Helman"'
We present new Bayesian methodology for consumer sales forecasting. With a focus on multi-step ahead forecasting of daily sales of many supermarket items, we adapt dynamic count mixture models to forecast individual customer transactions, and introdu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8fddcb02437ddca0ef0b188b15d35d3
http://arxiv.org/abs/1808.04698
http://arxiv.org/abs/1808.04698
Publikováno v:
Structural and Multidisciplinary Optimization. 43:107-119
Many engineering design problems can be formulated as constrained optimization problems which often consist of many mixed equality and inequality constraints. In this article, a hybrid coevolutionary method is developed to solve constrained optimizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8cb6d5f3fe88b23f828ebcfefb4398f
https://doi.org/10.1007/s00158-010-0543-5
https://doi.org/10.1007/s00158-010-0543-5
Publikováno v:
International Journal of Information Security. 8:331-345
In a negative representation, a set of elements (the positive representation) is depicted by its complement set. That is, the elements in the positive representation are not explicitly stored, and those in the negative representation are. The concept
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ea7e13127f53b73f73a33feca6f7a70
https://doi.org/10.1007/s10207-009-0078-1
https://doi.org/10.1007/s10207-009-0078-1
Autor:
Julie A. Hutt, Robert Veroff, Frank L. Gilfeather, Vikas Hamine, Paul Helman, Terry A. Loring, C. Rick Lyons
Publikováno v:
Computers in Biology and Medicine. 37:1539-1552
Ideally biosignatures can be detected at the early infection phase and used both for developing diagnostic patterns and for prognostic triage. Such biosignatures are important for vaccine validation and to provide risk stratification to a population
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46c04b75550640c40e68c6f23e764e32
https://doi.org/10.1016/j.compbiomed.2007.02.005
https://doi.org/10.1016/j.compbiomed.2007.02.005
Publikováno v:
International Journal of Information Security. 6:403-415
A set DB of data elements can be represented in terms of its complement set, known as a negative database. That is, all of the elements not in DB are represented, and DB itself is not explicitly stored. This method of representing data has certain pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3adca7f6e5b7d716d3287662d0c9042
https://doi.org/10.1007/s10207-007-0030-1
https://doi.org/10.1007/s10207-007-0030-1
Publikováno v:
Journal of Computational Biology. 11:581-615
We present new techniques for the application of a Bayesian network learning framework to the problem of classifying gene expression data. The focus on classification permits us to develop techniques that address in several ways the complexities of l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::492561c51f490c370208eb4ce7cd7ba7
https://doi.org/10.1089/cmb.2004.11.581
https://doi.org/10.1089/cmb.2004.11.581
Publikováno v:
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics). 34:357-373
In anomaly detection, the normal behavior of a process is characterized by a model, and deviations from the model are called anomalies. In behavior-based approaches to anomaly detection, the model of normal behavior is constructed from an observed sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5699d5416c11b8c3469959470e1c5e6
https://doi.org/10.1109/tsmcb.2003.817026
https://doi.org/10.1109/tsmcb.2003.817026
Autor:
Paul Helman, Robert Veroff
Publikováno v:
Applied Mathematics and Computation. 120:175-194
Many formalisms have been proposed over the years to capture combinatorial optimization algorithms such as dynamic programming, branch and bound, and greedy. In 1989 Helman [9] presented a common formalism that captures dynamic programming and branch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::019365237bb8a48b31a7eab78ec8d697
https://doi.org/10.1016/s0096-3003(99)00249-0
https://doi.org/10.1016/s0096-3003(99)00249-0
Autor:
Rebecca Gore, Paul Helman
Publikováno v:
Journal of Intelligent Information Systems. 11:99-138
We consider the problem of prioritizing a collection of discrete pieces of information, or transactions. The goal is to rank the transactions in such a way that the user can best pursue a subset of the transactions in hopes of discovering those which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c16c6709feb63843e599f30f58b11f2
https://doi.org/10.1023/a:1008628802726
https://doi.org/10.1023/a:1008628802726
Autor:
J. Bhangoo, Paul Helman
Publikováno v:
IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans. 27:449-466
This paper examines the problem of prioritizing actions under uncertainty. Our motivating applications come from the domain of data mining. Data mining problems present the user with a huge collection of individual items (e.g., abstracts, medical his
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3acbc3f039a5dc905eeae788516d17cd
https://doi.org/10.1109/3468.594912
https://doi.org/10.1109/3468.594912