100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
ISYE 6501 Midterm 1 Glossary $7.99   Add to cart

Exam (elaborations)

ISYE 6501 Midterm 1 Glossary

 1 view  0 purchase
  • Course
  • Institution

ISYE 6501 Midterm 1 Glossary

Preview 2 out of 9  pages

  • June 15, 2024
  • 9
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers
avatar-seller
ISYE 6501 Midterm 1 Glossary

Descriptive Analytics - ANS-What happened

Predictive Analytics - ANS-What will happen

Prescriptive Analytics - ANS-What action(s) would be best

algorithm - ANS-Step-by-step procedure designed to carry out a task.

change detection - ANS-Identifying when a significant change has taken place in a
process.

classification - ANS-The separation of data into two or more categories, or (a point's
classification) the category a data point is put into.

classifier - ANS-A boundary that separates the data into two or more categories. Also
(more generally) an algorithm that performs classification.

cluster - ANS-A group of points identified as near/similar to each other.

cluster center - ANS-In some clustering algorithms (like 𝑘-means clustering), the central
point (often the centroid) of a cluster of data points.

clustering - ANS-Separation of data points into groups ("clusters") based on
nearness/similarity to each other. A common form of unsupervised learning.

cusum - ANS-Change detection method that compares observed distribution mean with
a threshold level of change. Short for "cumulative sum".

deep learning - ANS-Neural network-type model with many hidden layers.

dimension - ANS-A feature of the data points (for example, height or credit score). (Note
that there is also a mathematical definition for this word.)

EM algorithm - ANS-Expectation-maximization algorithm.

, General description of an algorithm with two steps (often iterated), one that finds the
function for the expected likelihood of getting the response given current parameters,
and one that finds new parameter values to maximize that probability.

heuristic - ANS-Algorithm that is not guaranteed to find the absolute best (optimal)
solution.

k-means algorithm - ANS-Clustering algorithm that defines 𝑘 clusters of data points,
each corresponding to one of 𝑘 cluster centers selected by the algorithm.

K-Nearest Neighbor (KNN) - ANS-Classification algorithm that defines a data point's
category as a function of the nearest 𝑘𝑘 data points to it.

kernel - ANS-A type of function that computes the similarity between two inputs; thanks
to what's (really!) sometimes known as the "kernel trick", nonlinear classifiers can be
found almost as easily as linear ones.

learning - ANS-Finding/discovering patterns (or rules) in data, often that can be applied
to new data.

margin - ANS-For a single point, the distance between the point and the classification
boundary; for a set of points, the minimum distance between a point in the set and the
classification boundary. Also called the separation.

machine learning - ANS-Use of computer algorithms to learn and discover patterns or
structure in data, without being programmed specifically for them

misclassified - ANS-Put into the wrong category by a classifier.

neural network - ANS-A machine learning model that itself is modeled after the workings
of neurons in the brain

supervised learning - ANS-Machine learning where the "correct" answer is known for
each data point in the training set.

support vector - ANS-In SVM models, the closest point to the classifier, among those in
a category. (Note that there is a more-technical mathematical definition too.)

support vector machine (svm) - ANS-Classification algorithm that uses a boundary to
separate the data into two or more categories ("classes").

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller modockochieng06. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $7.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

74735 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$7.99
  • (0)
  Add to cart