description: group of samples that have been tagged with one or more labels
generative artificial intelligence
83 results
by Jiawei Han, Micheline Kamber and Jian Pei · 21 Jun 2011
. Cluster Analysis Unlike classification and regression, which analyze class-labeled (training) data sets, clustering analyzes data objects without consulting class labels. In many cases, class-labeled data may simply not exist at the beginning. Clustering can be used to generate class labels for a group of data. The objects are clustered or
…
) and that the rule covers the tuple. A rule R can be assessed by its coverage and accuracy. Given a tuple, X, from a class-labeled data set, D, let be the number of tuples covered by R; be the number of tuples correctly classified by R; and be the number of
…
on the accuracy measure can be deceiving when the main class of interest is in the minority. ■ Construction and evaluation of a classifier require partitioning labeled data into a training set and a test set. Holdout, random sampling, cross-validation, and bootstrapping are typical methods used for such partitioning. ■ Significance tests and
…
distance, the more likely that errors will be corrected. 9.7.2. Semi-Supervised Classification Semi-supervised classification uses labeled data and unlabeled data to build a classifier. Let be the set of labeled data and be the set of unlabeled data. Here we describe a few examples of this approach for learning. Self
…
-training is the simplest form of semi-supervised classification. It first builds a classifier using the labeled data. The classifier then tries to label the unlabeled data. The tuple with the most confident label prediction is added to the set of
…
labeled data, and the process repeats (Figure 9.17). Although the method is easy to understand, a disadvantage is that it may reinforce errors. Figure 9.17
…
data, Xu. Each classifier then teaches the other in that the tuple having the most confident prediction from f1 is added to the set of labeled data for f2 (along with its label). Similarly, the tuple having the most confident prediction from f2 is added to the set of
…
labeled data for f1. The method is summarized in Figure 9.17. Cotraining is less sensitive to errors than self-training. A difficulty is that the assumptions
…
learned from the training data under certain conditions. Clustering-based outlier detection methods have the following advantages. First, they can detect outliers without requiring any labeled data, that is, in an unsupervised way. They work for many data types. Clusters can be regarded as summaries of the data. Once the clusters are
by Anthony T. Holdener · 25 Jan 2008 · 982pp · 221,145 words
in the first place. Example 11-9 shows the JavaScript necessary to perform such an action. Example 11-9. Switching out the label data /* Example 11-9. Switching out the label data. */ /** * This function, reloadForm, takes the XMLHttpRequest JSON server response * /xhrResponse/ from the server and sets it equal to the global <label> element
by James Pustejovsky and Amber Stubbs · 14 Oct 2012 · 502pp · 107,510 words
tries to find structure from an input set of unlabeled data. Semi-supervised learning Any technique that generates a function mapping from inputs of both labeled data and unlabeled data; a combination of both supervised and unsupervised learning. Table 1-4 shows a general overview of ML algorithms and some of the
…
. For example, in order to distinguish spam from not-spam in your email inbox, an algorithm called a classifier is trained on a set of labeled data, where individual emails have been assigned the label [+spam] or [-spam]. It is the presence of certain (known) words or phrases in an email that
…
later chapter, when we discuss the impact of the initial model on the subsequent performance of the algorithms you are trying to train over your labeled data. Warning In later chapters, we will see that there are actually several models that might be appropriate for describing a phenomenon, each providing a different
…
tries to find structure from an input set of unlabeled data. Semi-supervised learning Any technique that generates a function mapping from inputs of both labeled data and unlabeled data; a combination of both supervised and unsupervised learning. Because our focus is on how annotated data can improve a system’s performance
…
methods, and these are called, not surprisingly, probabilistic clustering approaches. Semi-Supervised Learning Semi-supervised learning (SSL) is a method of learning that employs both labeled data as well as unlabeled data. It is an attractive idea for language-based tasks in particular, because of two reasons: there is an enormous amount
…
labeled training data can bring about a degradation in performance rather than an improvement. However, for many tasks, SSL can actually perform better than using labeled data alone (Singh et al. 2008), depending on the nature of the domain to be explored, as well as the type of labeling task involved. A
…
may not be the ones that you have in mind for your task. Semi-supervised learning techniques allow you to use a small amount of labeled data to generate labels for larger sets of data, and are an effective way to deal with very large datasets. If you aren’t sure where
by Foster Provost and Tom Fawcett · 30 Jun 2013 · 660pp · 141,595 words
. The input data for the induction algorithm, used for inducing the model, are called the training data. As mentioned in Chapter 2, they are called labeled data because the value for the target variable (the label) is known. Let’s return to our example churn problem. Based on what we learned in
…
training and 1/k used for testing. Figure 5-9. An illustration of cross-validation. The purpose of cross-validation is to use the original labeled data efficiently to estimate the performance of a modeling procedure. Here we show five-fold cross-validation: the original dataset is split randomly into five equal
…
different based on different collections of evidence E—in our example, different sets of websites visited. As mentioned above, we would like to use some labeled data, such as the data from our randomly targeted campaign, to associate different collections of evidence E with different probabilities. Unfortunately, this introduces a key problem
…
training data. Sometimes we can specify the target variable precisely, but we find we do not have any labeled data. In certain cases, we can use micro-outsourcing systems such as Mechanical Turk to label data. For example, advertisers would like to keep their advertisements off of objectionable web pages, like those that contain
…
for attribute. Class (label) One of a small, mutually exclusive set of labels used as possible values for the target variable in a classification problem. Labeled data has one class label assigned to each example. For example, in a dollar bill classification problem the classes could be legitimate and counterfeit. In a
…
Concepts of Data Science Kosinski, Michal, Example: Evidence Lifts from Facebook “Likes”–Example: Evidence Lifts from Facebook “Likes” L L2 norm (equation), * Other Distance Functions labeled data, Models, Induction, and Prediction labels, Supervised Versus Unsupervised Methods Ladyburn single malt scotch, Understanding the Results of Clustering Laphroaig single malt scotch, Understanding the Results
by Femi Anthony · 21 Jun 2015 · 589pp · 69,193 words
.washington.edu/~pedrod/papers/cacm12.pdf Supervised versus unsupervised learning For supervised learning problems, the input to a learning problem is a dataset consisting of labeled data. By this we mean that we have outputs whose values are known. The learning program is fed input samples and their corresponding outputs and its
…
goal is to decipher the relationship between them. Such input is known as labeled data. Supervised learning problems include the following: Classification: The learned attribute is categorical (nominal) or discrete Regression: The learned attribute is numeric/continuous In unsupervised learning
by Charles Petzold · 28 Sep 1999 · 566pp · 122,184 words
that indicate what the automated adder is supposed to do with the corresponding address in the original RAM array. These two RAM arrays can be labeled Data (the original RAM array) and Code (the new one): We've already established that our new automated adder needs to be able to write sums
…
into the original RAM array (labeled Data). But the new RAM array (labeled Code) will be written to solely through the control panel. We need four codes for the four actions we
by Trevor Hastie, Robert Tibshirani and Jerome Friedman · 25 Aug 2009 · 764pp · 261,694 words
as generalizations allowing for different variable types and more general distance measures, are given in Chapter 14. To use K-means clustering for classification of labeled data, the steps are: • apply K-means clustering to the training data in each class separately, using R prototypes per class; • assign a class label to
by Joel Grus · 13 Apr 2015 · 579pp · 76,657 words
to make a binary judgment. Is this email spam? Should we hire this candidate? Is this air traveler secretly a terrorist? Given a set of labeled data and such a predictive model, every data point lies in one of four categories: True positive: “This message is spam, and we correctly predicted spam
…
this chapter, we’ll focus on classification trees, and we’ll work through the ID3 algorithm for learning a decision tree from a set of labeled data, which should help us understand how decision trees actually work. To make things simple, we’ll restrict ourselves to problems with binary outputs like “should
…
are: def class_probabilities(labels): total_count = len(labels) return [count / total_count for count in Counter(labels).values()] def data_entropy(labeled_data): labels = [label for _, label in labeled_data] probabilities = class_probabilities(labels) return entropy(probabilities) The Entropy of a Partition What we’ve done so far is compute the entropy (think
…
“uncertainty”) of a single set of labeled data. Now, each stage of a decision tree involves asking a question whose answer partitions data into one or (hopefully) more subsets. For instance, our “does
…
we can implement as: def partition_entropy(subsets): """find the entropy from this partition of data into subsets subsets is a list of lists of labeled data""" total_count = sum(len(subset) for subset in subsets) return sum( data_entropy(subset) * len(subset) / total_count for subset in subsets ) Note One problem
…
a prediction). We will build it using the relatively simple ID3 algorithm, which operates in the following manner. Let’s say we’re given some labeled data, and a list of attributes to consider branching on. If the data all have the same label, then create a leaf node that predicts that
…
mad Robert Herrick Most of the algorithms in this book are what’s known as supervised learning, in that they start with a set of labeled data and use that as the basis for making predictions about new, unlabeled data. Clustering, however, is an example of unsupervised learning, in which we work
by Zdravko Markov and Daniel T. Larose · 5 Apr 2007
. Using the mixture model, we can define three problems: a finite mixture problem, a classification problem, and a clustering problem. Finite Mixture Problem Given a labeled data set (i.e., we know the class for each attribute value) the problem is to find the mean, standard deviation, and the probability of sampling
…
, 0, 0, 0, 0.976, 0.254)) = Clustering Problem So far we have discussed two tasks associated with our probabilistic setting: learning (creating models given labeled data) and classification (predicting labels using models). Recall, however, that the cluster labels were created automatically by k-means clustering. So a natural question is whether
…
-clusters accuracies (or errors) of the splits based on their values. Note, however, that this is a supervised method for attribute evaluation because it uses labeled data. Interestingly, the two best attributes selected by error-based evaluation are the same as those preferred by the unsupervised MDL evaluation approach. This is an
…
clustering: error-based and information gain attribute evaluation. In fact, these two schemes are used mostly in classification but can also work in clustering when labeled data are available. Hereafter we formally define information gain, describe a similarity-based approach, and illustrate the effect of feature selection with the performance of the
…
–84 Bayes rule, 76 classification problem, 76–78 clustering problem, 78–84 expectation maximization (EM) algorithm, 79 finite mixture problem, 74–75 independence assumption, 77 labeled data set, 74 log-likelihood criterion function, 80 mean, class, 75 naive Bayes, 77 optimization, 79 probability density function, 76 probability of sampling, 75 standard deviation
by Aurélien Géron · 13 Mar 2017 · 1,331pp · 163,200 words
to each other. Semisupervised learning Some algorithms can deal with partially labeled training data, usually a lot of unlabeled data and a little bit of labeled data. This is called semisupervised learning (Figure 1-11). Some photo-hosting services, such as Google Photos, are good examples of this. Once you upload all
…
stacked autoencoder using all the data, then reuse the lower layers to create a neural network for your actual task, and train it using the labeled data. For example, Figure 15-8 shows how to use a stacked autoencoder to perform unsupervised pretraining for a classification neural network. The stacked autoencoder itself
…
its lower half for the classifier (i.e., reuse the layers up to the codings layer, included) and train the classifier using the labeled data. If you have little labeled data, you probably want to freeze the reused layers when training the classifier. The fact that an autoencoder perfectly reconstructs its inputs does not
by Dan Bouk · 22 Aug 2022 · 424pp · 123,180 words
by Melanie Mitchell · 14 Oct 2019 · 350pp · 98,077 words
by David Allen · 31 Dec 2002 · 300pp · 79,315 words
by Paul Raines and Jeff Tranter · 25 Mar 1999 · 1,064pp · 114,771 words
by Ivan Idris · 23 Jun 2015 · 681pp · 64,159 words
by Valliappa Lakshmanan, Sara Robinson and Michael Munn · 31 Oct 2020
by Eric Posner and E. Weyl · 14 May 2018 · 463pp · 105,197 words
by Pedro Domingos · 21 Sep 2015 · 396pp · 117,149 words
by Dipanjan Sarkar · 1 Dec 2016
by Karl Fogel · 13 Oct 2005
by Fabio Nelli · 27 Sep 2018 · 688pp · 107,867 words
by Martin Ford · 13 Sep 2021 · 288pp · 86,995 words
by Mehmed Kantardzić · 2 Jan 2003 · 721pp · 197,134 words
by Martin Ford · 16 Nov 2018 · 586pp · 186,548 words
by Yves Hilpisch · 8 Dec 2020 · 1,082pp · 87,792 words
by Paul Scharre · 18 Jan 2023
by Andrew McAfee · 14 Nov 2023 · 381pp · 113,173 words
by John Brockman · 5 Oct 2015 · 481pp · 125,946 words
by Gary Marcus and Jeremy Freeman · 1 Nov 2014 · 336pp · 93,672 words
by Kai-Fu Lee · 14 Sep 2018 · 307pp · 88,180 words
by Trent Hauck · 3 Nov 2014
by Gavin Hackeling · 31 Oct 2014
by Jure Leskovec, Anand Rajaraman and Jeffrey David Ullman · 13 Nov 2014
by Cory Doctorow · 22 Jun 2026 · 175pp · 51,295 words
by Parmy Olson · 284pp · 96,087 words
by Ash Fontana · 4 May 2021 · 296pp · 66,815 words
by Stuart Russell and Peter Norvig · 14 Jul 2019 · 2,466pp · 668,761 words
by Jacqueline Kazil · 4 Feb 2016
by Ivan Idris · 30 Sep 2012 · 197pp · 35,256 words
by Terrence J. Sejnowski · 27 Sep 2018
by Hod Lipson and Melba Kurman · 22 Sep 2016
by Raúl Garreta and Guillermo Moncecchi · 14 Sep 2013 · 122pp · 29,286 words
by Eric Topol · 1 Jan 2019 · 424pp · 114,905 words
by Aurelien Geron · 14 Aug 2019
by Marc Stickdorn, Markus Edgar Hormess, Adam Lawrence and Jakob Schneider · 12 Jan 2018 · 704pp · 182,312 words
by Cathy O'Neil and Rachel Schutt · 8 Oct 2013 · 523pp · 112,185 words
by Kashmir Hill · 19 Sep 2023 · 487pp · 124,008 words
by Kai-Fu Lee and Qiufan Chen · 13 Sep 2021
by Karen Hao · 19 May 2025 · 660pp · 179,531 words
by John MacCormick and Chris Bishop · 27 Dec 2011 · 250pp · 73,574 words
by Tracy Kidder · 1 Jan 1981 · 299pp · 99,080 words
by Marcus Du Sautoy · 7 Mar 2019 · 337pp · 103,522 words
by Jacob Ward · 25 Jan 2022 · 292pp · 94,660 words
by Rob Reich, Mehran Sahami and Jeremy M. Weinstein · 6 Sep 2021
by Maximilian Kasy · 15 Jan 2025 · 209pp · 63,332 words
by Madhumita Murgia · 20 Mar 2024 · 336pp · 91,806 words
by Anil Ananthaswamy · 15 Jul 2024 · 416pp · 118,522 words
by Erik J. Larson · 5 Apr 2021
by Tarleton Gillespie · 25 Jun 2018 · 390pp · 109,519 words
by Amy Webb · 5 Mar 2019 · 340pp · 97,723 words
by Orly Lobel · 17 Oct 2022 · 370pp · 112,809 words
by Sebastian Mallaby; · 30 Mar 2026 · 607pp · 161,998 words
by Kevin Roose · 9 Mar 2021 · 208pp · 57,602 words
by Mariya Yao, Adelyn Zhou and Marlene Jia · 1 Jun 2018 · 161pp · 39,526 words
by Kenneth Payne · 16 Jun 2021 · 339pp · 92,785 words
by Ethan Mollick · 2 Apr 2024 · 189pp · 58,076 words
by Daniel Drescher · 16 Mar 2017 · 430pp · 68,225 words
by Tom Chivers · 6 May 2024 · 283pp · 102,484 words
by Jonathan Gray, Lucy Chambers and Liliana Bounegru · 9 May 2012
by Jane McGonigal · 20 Jan 2011 · 470pp · 128,328 words
by Brett Scott · 4 Jul 2022 · 308pp · 85,850 words
by Paul R. Daugherty and H. James Wilson · 15 Jan 2018 · 523pp · 61,179 words
by Mustafa Suleyman · 4 Sep 2023 · 444pp · 117,770 words
by Veljko Krunic · 29 Mar 2020
by Nick Polson and James Scott · 14 May 2018 · 301pp · 85,126 words
by James Vlahos · 1 Mar 2019 · 392pp · 108,745 words
by Jill Lepore · 14 Sep 2020 · 467pp · 149,632 words
by Robert Skidelsky Nan Craig · 15 Mar 2020
by Carissa Véliz · 21 Apr 2026 · 503pp · 129,255 words
by Daron Acemoglu and Simon Johnson · 15 May 2023 · 619pp · 177,548 words
by David Aronson · 1 Nov 2006
by Guy Standing · 13 Jul 2016 · 443pp · 98,113 words
by Azeem Azhar · 6 Sep 2021 · 447pp · 111,991 words