Skip to content

Commit 95178e1

Browse files
committed
Pushing the docs to dev/ for branch: master, commit 9d535ad42ca9ff423e518ce9272246b0f42b94d7
1 parent d2acd9b commit 95178e1

File tree

877 files changed

+2554
-2554
lines changed

Some content is hidden

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

877 files changed

+2554
-2554
lines changed
30 Bytes
Binary file not shown.
30 Bytes
Binary file not shown.

dev/_downloads/topics_extraction_with_nmf_lda.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
},
1616
{
1717
"source": [
18-
"\n# Topic extraction with Non-negative Matrix Factorization and Latent Dirichlet Allocation\n\n\nThis is an example of applying Non-negative Matrix Factorization\nand Latent Dirichlet Allocation on a corpus of documents and\nextract additive models of the topic structure of the corpus.\nThe output is a list of topics, each represented as a list of terms\n(weights are not shown).\n\nThe default parameters (n_samples / n_features / n_topics) should make\nthe example runnable in a couple of tens of seconds. You can try to\nincrease the dimensions of the problem, but be aware that the time\ncomplexity is polynomial in NMF. In LDA, the time complexity is\nproportional to (n_samples * iterations).\n\n"
18+
"\n# Topic extraction with Non-negative Matrix Factorization and Latent Dirichlet Allocation\n\n\nThis is an example of applying :class:`sklearn.decomposition.NMF`\nand :class:`sklearn.decomposition.LatentDirichletAllocation` on a corpus of documents and\nextract additive models of the topic structure of the corpus.\nThe output is a list of topics, each represented as a list of terms\n(weights are not shown).\n\nThe default parameters (n_samples / n_features / n_topics) should make\nthe example runnable in a couple of tens of seconds. You can try to\nincrease the dimensions of the problem, but be aware that the time\ncomplexity is polynomial in NMF. In LDA, the time complexity is\nproportional to (n_samples * iterations).\n\n"
1919
],
2020
"cell_type": "markdown",
2121
"metadata": {}

dev/_downloads/topics_extraction_with_nmf_lda.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,8 +3,8 @@
33
Topic extraction with Non-negative Matrix Factorization and Latent Dirichlet Allocation
44
=======================================================================================
55
6-
This is an example of applying Non-negative Matrix Factorization
7-
and Latent Dirichlet Allocation on a corpus of documents and
6+
This is an example of applying :class:`sklearn.decomposition.NMF`
7+
and :class:`sklearn.decomposition.LatentDirichletAllocation` on a corpus of documents and
88
extract additive models of the topic structure of the corpus.
99
The output is a list of topics, each represented as a list of terms
1010
(weights are not shown).

0 commit comments

Comments
 (0)