https://www.bibsonomy.org/concept/user/jil/machineBibSonomy RSS Feed for /concept/user/jil/machine$ find `pwd` -maxdepth 3 -type d -name 'node_modules' | xargs -n 1 tmutil addexclusionhttps://superuser.com/questions/1161038/exclude-folders-by-regex-from-time-machine-backupjil2025-07-31T10:50:16+02:00backup exclude exclusion find machine macos time <span itemprop="description">$ find `pwd` -maxdepth 3 -type d -name &#039;node_modules&#039; | xargs -n 1 tmutil addexclusion</span>A very common workflow is to index some data based on its embeddings and then given a new query embedding retrieve the most similar examples with k-Nearest Neighbor search. For example, you can imagine embedding a large collection of papers by their abstracts and then given a new paper of interest retrieve the most similar papers to it. TLDR in my experience it ~always works better to use an SVM instead of kNN, if you can afford the slight computational hithttps://github.com/karpathy/randomfun/blob/master/knn_vs_svm.ipynbjil2023-11-15T16:18:31+01:00knn most qa ranking similar svm vector <span itemprop="description">A very common workflow is to index some data based on its embeddings and then given a new query embedding retrieve the most similar examples with k-Nearest Neighbor search. For example, you can imagine embedding a large collection of papers by their abstracts and then given a new paper of interest retrieve the most similar papers to it. TLDR in my experience it ~always works better to use an SVM instead of kNN, if you can afford the slight computational hit</span>http://scikit-learn.org/jil2015-12-12T21:13:49+01:00classifier clustering learning library machine python regression <a itemprop="url" data-versiondate="2015-12-12T21:13:49+01:00" href="http://scikit-learn.org/" rel="nofollow" class="description-link">http://scikit-learn.org/</a>http://cseweb.ucsd.edu/~dkauchak/mt-tutorial/jil2015-02-27T19:20:22+01:00machine mt translation tutorial <a itemprop="url" data-versiondate="2015-02-27T19:20:22+01:00" href="http://cseweb.ucsd.edu/~dkauchak/mt-tutorial/" rel="nofollow" class="description-link">http://cseweb.ucsd.edu/~dkauchak/mt-tutorial/</a>http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/jil2014-05-06T13:49:05+02:00informatik learning machine pattern preis <a itemprop="url" data-versiondate="2014-05-06T13:49:05+02:00" href="http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/" rel="nofollow" class="description-link">http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/</a>http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svmjil2012-11-22T01:21:29+01:00disadvantages feature features ignores ignoring kernel sparse support svm vector <a itemprop="url" data-versiondate="2012-11-22T01:21:29+01:00" href="http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svm" rel="nofollow" class="description-link">http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svm</a>http://www.no-free-lunch.org/jil2012-10-29T17:49:59+01:00bias free function learning lunch machine no one other theorems worse <a itemprop="url" data-versiondate="2012-10-29T17:49:59+01:00" href="http://www.no-free-lunch.org/" rel="nofollow" class="description-link">http://www.no-free-lunch.org/</a>http://svmlight.joachims.org/jil2012-05-04T23:04:32+02:00joachims light software svm <a itemprop="url" data-versiondate="2012-05-04T23:04:32+02:00" href="http://svmlight.joachims.org/" rel="nofollow" class="description-link">http://svmlight.joachims.org/</a>http://www.ims.uni-stuttgart.de/projekte/tt-in-mt/pub.html.dejil2012-03-24T23:50:54+01:00machine mt stuttgart transducer translation tree uni <a itemprop="url" data-versiondate="2012-03-24T23:50:54+01:00" href="http://www.ims.uni-stuttgart.de/projekte/tt-in-mt/pub.html.de" rel="nofollow" class="description-link">http://www.ims.uni-stuttgart.de/projekte/tt-in-mt/pub.html.de</a>http://www.ims.uni-stuttgart.de/projekte/gramotron/SOFTWARE/SFST.htmljil2011-09-20T23:11:24+02:00finite german machine morphology sfst smor state <a itemprop="url" data-versiondate="2011-09-20T23:11:24+02:00" href="http://www.ims.uni-stuttgart.de/projekte/gramotron/SOFTWARE/SFST.html" rel="nofollow" class="description-link">http://www.ims.uni-stuttgart.de/projekte/gramotron/SOFTWARE/SFST.html</a>http://en.wikipedia.org/wiki/Support_vector_machinejil2011-05-22T21:19:30+02:00formula lagrange maximization minimization svm wikipedia wrong <a itemprop="url" data-versiondate="2011-05-22T21:19:30+02:00" href="http://en.wikipedia.org/wiki/Support_vector_machine" rel="nofollow" class="description-link">http://en.wikipedia.org/wiki/Support_vector_machine</a>http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdfjil2011-05-22T21:13:22+02:00book buch diplomarbeit linear literature optimierung optimization programming quadratic svm <a itemprop="url" data-versiondate="2011-05-22T21:13:22+02:00" href="http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdf" rel="nofollow" class="description-link">http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdf</a>http://www.tristanfletcher.co.uk/SVM%20Explained.pdfjil2011-05-22T20:49:46+02:00derivation dual explained explanation good lagrange optimization pdf problem svm tutorial <a itemprop="url" data-versiondate="2011-05-22T20:49:46+02:00" href="http://www.tristanfletcher.co.uk/SVM%20Explained.pdf" rel="nofollow" class="description-link">http://www.tristanfletcher.co.uk/SVM%20Explained.pdf</a>Debianhttp://wiki.apertium.org/wiki/Fomajil2010-11-24T23:24:26+01:00automata expression finite foma fsa machine regex regular state tool <span itemprop="description">Debian</span>http://code.google.com/p/cleartk/jil2010-11-23T00:42:51+01:00cleartk code google java lib nlp svm uima <a itemprop="url" data-versiondate="2010-11-23T00:42:51+01:00" href="http://code.google.com/p/cleartk/" rel="nofollow" class="description-link">http://code.google.com/p/cleartk/</a>http://www.csie.ntu.edu.tw/~cjlin/libsvm/jil2008-04-23T03:29:20+02:00classification lib libsvm svm <a itemprop="url" data-versiondate="2008-04-23T03:29:20+02:00" href="http://www.csie.ntu.edu.tw/~cjlin/libsvm/" rel="nofollow" class="description-link">http://www.csie.ntu.edu.tw/~cjlin/libsvm/</a>http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.htmljil2008-02-19T19:22:57+01:00begriff buch definition effectiveness efficiency evaluation ir klassifikation learning machine online performance <a itemprop="url" data-versiondate="2008-02-19T19:22:57+01:00" href="http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.html" rel="nofollow" class="description-link">http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.html</a>http://alban.galland.free.fr/serendipity/index.php?/archives/2-Symbolic-Learning.htmljil2008-02-15T20:58:10+01:00abduktion induktion klassifikation learning lernen machine <a itemprop="url" data-versiondate="2008-02-15T20:58:10+01:00" href="http://alban.galland.free.fr/serendipity/index.php?/archives/2-Symbolic-Learning.html" rel="nofollow" class="description-link">http://alban.galland.free.fr/serendipity/index.php?/archives/2-Symbolic-Learning.html</a>http://lmb.informatik.uni-freiburg.de/lectures/svm_seminar/svm-multiclass.pdfjil2007-12-19T16:36:57+01:00against all multiclass one svm <a itemprop="url" data-versiondate="2007-12-19T16:36:57+01:00" href="http://lmb.informatik.uni-freiburg.de/lectures/svm_seminar/svm-multiclass.pdf" rel="nofollow" class="description-link">http://lmb.informatik.uni-freiburg.de/lectures/svm_seminar/svm-multiclass.pdf</a>http://hunch.net/?p=29jil2007-11-27T02:35:42+01:00crossvalidation learning machine problem varianz <a itemprop="url" data-versiondate="2007-11-27T02:35:42+01:00" href="http://hunch.net/?p=29" rel="nofollow" class="description-link">http://hunch.net/?p=29</a>