Skip to content

Commit b3681fd

Browse files
committed
Pushing the docs to dev/ for branch: master, commit 0c2da0cb488b7cdc0c5b6bcf4aacef374bae309b
1 parent 7146429 commit b3681fd

File tree

1,207 files changed

+4051
-4073
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

1,207 files changed

+4051
-4073
lines changed
Binary file not shown.

dev/_downloads/5612f9c55259a4294f34843655f9c6af/plot_gpr_on_structured_data.ipynb

+1-1
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
"cell_type": "markdown",
1616
"metadata": {},
1717
"source": [
18-
"\n# Gaussian processes on discrete data structures\n\n\nThis example illustrates the use of Gaussian processes for regression and\nclassification tasks on data that are not in fixed-length feature vector form.\nThis is achieved through the use of kernel functions that operates directly\non discrete structures such as variable-length sequences, trees, and graphs.\n\nSpecifically, here the input variables are some gene sequences stored as\nvariable-length strings consisting of letters 'A', 'T', 'C', and 'G',\nwhile the output variables are floating point numbers and True/False labels\nin the regression and classification tasks, respectively.\n\nA kernel between the gene sequences is defined using R-convolution [1]_ by\nintegrating a binary letter-wise kernel over all pairs of letters among a pair\nof strings.\n\nThis example will generate three figures.\n\nIn the first figure, we visualize the value of the kernel, i.e. the similarity\nof the sequences, using a colormap. Brighter color here indicates higher\nsimilarity.\n\nIn the second figure, we show some regression result on a dataset of 6\nsequences. Here we use the 1st, 2nd, 4th, and 5th sequences as the training set\nto make predictions on the 3rd and 6th sequences.\n\nIn the third figure, we demonstrate a classification model by training on 6\nsequences and make predictions on another 5 sequences. The ground truth here is\nsimply whether there is at least one 'A' in the sequence. Here the model makes\nfour correct classifications and fails on one.\n\n.. [1] Haussler, D. (1999). Convolution kernels on discrete structures\n(Vol. 646). Technical report, Department of Computer Science, University of\nCalifornia at Santa Cruz.\n"
18+
"\n# Gaussian processes on discrete data structures\n\n\nThis example illustrates the use of Gaussian processes for regression and\nclassification tasks on data that are not in fixed-length feature vector form.\nThis is achieved through the use of kernel functions that operates directly\non discrete structures such as variable-length sequences, trees, and graphs.\n\nSpecifically, here the input variables are some gene sequences stored as\nvariable-length strings consisting of letters 'A', 'T', 'C', and 'G',\nwhile the output variables are floating point numbers and True/False labels\nin the regression and classification tasks, respectively.\n\nA kernel between the gene sequences is defined using R-convolution [1]_ by\nintegrating a binary letter-wise kernel over all pairs of letters among a pair\nof strings.\n\nThis example will generate three figures.\n\nIn the first figure, we visualize the value of the kernel, i.e. the similarity\nof the sequences, using a colormap. Brighter color here indicates higher\nsimilarity.\n\nIn the second figure, we show some regression result on a dataset of 6\nsequences. Here we use the 1st, 2nd, 4th, and 5th sequences as the training set\nto make predictions on the 3rd and 6th sequences.\n\nIn the third figure, we demonstrate a classification model by training on 6\nsequences and make predictions on another 5 sequences. The ground truth here is\nsimply whether there is at least one 'A' in the sequence. Here the model makes\nfour correct classifications and fails on one.\n\n.. [1] Haussler, D. (1999). Convolution kernels on discrete structures\n (Vol. 646). Technical report, Department of Computer Science, University\n of California at Santa Cruz.\n"
1919
]
2020
},
2121
{

dev/_downloads/d2c3d354a93eca3b78b2436d5a8e7164/plot_gpr_on_structured_data.py

+2-2
Original file line numberDiff line numberDiff line change
@@ -33,8 +33,8 @@
3333
four correct classifications and fails on one.
3434
3535
.. [1] Haussler, D. (1999). Convolution kernels on discrete structures
36-
(Vol. 646). Technical report, Department of Computer Science, University of
37-
California at Santa Cruz.
36+
(Vol. 646). Technical report, Department of Computer Science, University
37+
of California at Santa Cruz.
3838
"""
3939
print(__doc__)
4040

Binary file not shown.

dev/_downloads/scikit-learn-docs.pdf

-11.8 KB
Binary file not shown.

dev/_images/iris.png

0 Bytes
-484 Bytes
278 Bytes
-1.38 KB
182 Bytes
-79 Bytes
-79 Bytes
12 Bytes
-336 Bytes
-336 Bytes
270 Bytes
-266 Bytes
-2.64 KB
-2.64 KB
-615 Bytes
-313 Bytes
-313 Bytes
193 Bytes
193 Bytes
-74 Bytes
-74 Bytes
-263 Bytes
-263 Bytes
46 Bytes
46 Bytes
-272 Bytes
-272 Bytes
-171 Bytes
40 Bytes
-64 Bytes
-64 Bytes
55 Bytes
25 Bytes
-185 Bytes
-60 Bytes
-119 Bytes
55 Bytes
55 Bytes
-2 Bytes
-13 Bytes

dev/_sources/auto_examples/applications/plot_face_recognition.rst.txt

+4-4

dev/_sources/auto_examples/applications/plot_model_complexity_influence.rst.txt

+14-14

dev/_sources/auto_examples/applications/plot_out_of_core_classification.rst.txt

+30-30

dev/_sources/auto_examples/applications/plot_outlier_detection_housing.rst.txt

+1-1

dev/_sources/auto_examples/applications/plot_prediction_latency.rst.txt

+2-2

dev/_sources/auto_examples/applications/plot_species_distribution_modeling.rst.txt

+3-3

dev/_sources/auto_examples/applications/plot_stock_market.rst.txt

+2-2

dev/_sources/auto_examples/applications/plot_tomography_l1_reconstruction.rst.txt

+2-2

0 commit comments

Comments
 (0)