Machine learning

Vishnu Nath, Stephen E. Levinson

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Whenever a problem seems extremely open ended with a large variety of random variables that have an effect on the process, it is impossible for a human programmer to be able to account for every single case. The number of cases increases dramatically with an additional parameter. In such scenarios, probabilistic algorithms have the greatest applicability. In such scenarios, the algorithms need to be given a couple of examples of scenarios it might come across and the algorithm would be able to handle a new scenario with reasonable accuracy. The key word in the previous statement is ‘reasonable’. There is no probabilistic algorithm that will always return the optimum result with a probability of 1. That would make it a deterministic algorithm which, as has just been discussed, cannot handle every potential case. In this chapter, we discuss the algorithms that were employed to successfully complete the experiment.

Original languageEnglish (US)
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages39-44
Number of pages6
Edition9783319056050
DOIs
StatePublished - Jan 1 2014

Publication series

NameSpringerBriefs in Computer Science
Number9783319056050
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Fingerprint

Learning systems
Random variables
Experiments

Keywords

  • High Reward
  • Label Data
  • Reinforcement Learning Algorithm
  • Unlabeled Data
  • Unsupervised Learning

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Nath, V., & Levinson, S. E. (2014). Machine learning. In SpringerBriefs in Computer Science (9783319056050 ed., pp. 39-44). (SpringerBriefs in Computer Science; No. 9783319056050). Springer. https://doi.org/10.1007/978-3-319-05606-7_6

Machine learning. / Nath, Vishnu; Levinson, Stephen E.

SpringerBriefs in Computer Science. 9783319056050. ed. Springer, 2014. p. 39-44 (SpringerBriefs in Computer Science; No. 9783319056050).

Research output: Chapter in Book/Report/Conference proceedingChapter

Nath, V & Levinson, SE 2014, Machine learning. in SpringerBriefs in Computer Science. 9783319056050 edn, SpringerBriefs in Computer Science, no. 9783319056050, Springer, pp. 39-44. https://doi.org/10.1007/978-3-319-05606-7_6
Nath V, Levinson SE. Machine learning. In SpringerBriefs in Computer Science. 9783319056050 ed. Springer. 2014. p. 39-44. (SpringerBriefs in Computer Science; 9783319056050). https://doi.org/10.1007/978-3-319-05606-7_6
Nath, Vishnu ; Levinson, Stephen E. / Machine learning. SpringerBriefs in Computer Science. 9783319056050. ed. Springer, 2014. pp. 39-44 (SpringerBriefs in Computer Science; 9783319056050).
@inbook{d419373a4abd4e80ab161562e51bc928,
title = "Machine learning",
abstract = "Whenever a problem seems extremely open ended with a large variety of random variables that have an effect on the process, it is impossible for a human programmer to be able to account for every single case. The number of cases increases dramatically with an additional parameter. In such scenarios, probabilistic algorithms have the greatest applicability. In such scenarios, the algorithms need to be given a couple of examples of scenarios it might come across and the algorithm would be able to handle a new scenario with reasonable accuracy. The key word in the previous statement is ‘reasonable’. There is no probabilistic algorithm that will always return the optimum result with a probability of 1. That would make it a deterministic algorithm which, as has just been discussed, cannot handle every potential case. In this chapter, we discuss the algorithms that were employed to successfully complete the experiment.",
keywords = "High Reward, Label Data, Reinforcement Learning Algorithm, Unlabeled Data, Unsupervised Learning",
author = "Vishnu Nath and Levinson, {Stephen E.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-05606-7_6",
language = "English (US)",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319056050",
pages = "39--44",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319056050",

}

TY - CHAP

T1 - Machine learning

AU - Nath, Vishnu

AU - Levinson, Stephen E.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Whenever a problem seems extremely open ended with a large variety of random variables that have an effect on the process, it is impossible for a human programmer to be able to account for every single case. The number of cases increases dramatically with an additional parameter. In such scenarios, probabilistic algorithms have the greatest applicability. In such scenarios, the algorithms need to be given a couple of examples of scenarios it might come across and the algorithm would be able to handle a new scenario with reasonable accuracy. The key word in the previous statement is ‘reasonable’. There is no probabilistic algorithm that will always return the optimum result with a probability of 1. That would make it a deterministic algorithm which, as has just been discussed, cannot handle every potential case. In this chapter, we discuss the algorithms that were employed to successfully complete the experiment.

AB - Whenever a problem seems extremely open ended with a large variety of random variables that have an effect on the process, it is impossible for a human programmer to be able to account for every single case. The number of cases increases dramatically with an additional parameter. In such scenarios, probabilistic algorithms have the greatest applicability. In such scenarios, the algorithms need to be given a couple of examples of scenarios it might come across and the algorithm would be able to handle a new scenario with reasonable accuracy. The key word in the previous statement is ‘reasonable’. There is no probabilistic algorithm that will always return the optimum result with a probability of 1. That would make it a deterministic algorithm which, as has just been discussed, cannot handle every potential case. In this chapter, we discuss the algorithms that were employed to successfully complete the experiment.

KW - High Reward

KW - Label Data

KW - Reinforcement Learning Algorithm

KW - Unlabeled Data

KW - Unsupervised Learning

UR - http://www.scopus.com/inward/record.url?scp=85045644955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045644955&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-05606-7_6

DO - 10.1007/978-3-319-05606-7_6

M3 - Chapter

AN - SCOPUS:85045644955

T3 - SpringerBriefs in Computer Science

SP - 39

EP - 44

BT - SpringerBriefs in Computer Science

PB - Springer

ER -