<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/macek"><title>BibSonomy bookmarks for /user/macek</title><link>https://www.bibsonomy.org/user/macek</link><description>BibSonomy RSS Feed for /user/macek</description><items><rdf:Seq><rdf:li rdf:resource="http://lab.hakim.se/reveal-js/#/"/><rdf:li rdf:resource="http://brew.sh/"/><rdf:li rdf:resource="https://cwiki.apache.org/confluence/display/Hive/GenericUDAFCaseStudy"/><rdf:li rdf:resource="http://stackoverflow.com/questions/13628658/hive-text-delimiter"/><rdf:li rdf:resource="https://cwiki.apache.org/Hive/languagemanual-udf.html"/><rdf:li rdf:resource="http://de.slideshare.net/nzhang/hive-anatomy"/><rdf:li rdf:resource="http://stackoverflow.com/questions/7567605/how-to-load-data-to-hive-from-hdfs-without-removing-the-source-file"/><rdf:li rdf:resource="http://www.isi.edu/~adibi/Enron/Enron.htm"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Mention_(blogging)"/><rdf:li rdf:resource="http://scikit-learn.org/stable/modules/neighbors.html"/><rdf:li rdf:resource="http://projects.scipy.org/scikits/wiki/AnnWrapper"/><rdf:li rdf:resource="http://sci2s.ugr.es/keel/algorithms.php#sub4"/><rdf:li rdf:resource="http://www.mit.edu/~jtidwell/common_ground.html"/><rdf:li rdf:resource="http://stackoverflow.com/questions/7332732/using-grep-to-filter-out-words-from-a-stopwords-file"/><rdf:li rdf:resource="http://www.linux-schule.com/trans_html/007Awk/awk1_numbering.html"/><rdf:li rdf:resource="http://gibbslda.sourceforge.net/"/><rdf:li rdf:resource="http://www.biomedcentral.com/1471-2105/10/213"/><rdf:li rdf:resource="http://cran.r-project.org/web/packages/e1071/vignettes/svmdoc.pdf"/><rdf:li rdf:resource="http://www.ci.tuwien.ac.at/~meyer/svm/final.pdf"/><rdf:li rdf:resource="http://www.cs.waikato.ac.nz/ml/weka/arff.html"/></rdf:Seq></items></channel><item rdf:about="http://lab.hakim.se/reveal-js/#/"><title>reveal.js - The HTML Presentation Framework</title><description>A framework for easily creating beautiful presentations using HTML</description><link>http://lab.hakim.se/reveal-js/#/</link><dc:creator>macek</dc:creator><dc:date>2014-10-29T13:25:09+01:00</dc:date><dc:subject>html presentation </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;A framework for easily creating beautiful presentations using HTML&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/html"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/presentation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://brew.sh/"><title>Homebrew — MacPorts driving you to drink? Try Homebrew!</title><description></description><link>http://brew.sh/</link><dc:creator>macek</dc:creator><dc:date>2013-09-13T11:18:28+02:00</dc:date><dc:subject>Linux MacOs </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-09-13T11:18:28+02:00&#034; href=&#034;http://brew.sh/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://brew.sh/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Linux"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MacOs"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cwiki.apache.org/confluence/display/Hive/GenericUDAFCaseStudy"><title>GenericUDAFCaseStudy - Apache Hive</title><description></description><link>https://cwiki.apache.org/confluence/display/Hive/GenericUDAFCaseStudy</link><dc:creator>macek</dc:creator><dc:date>2013-09-04T11:08:35+02:00</dc:date><dc:subject>Hive UDAF </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-09-04T11:08:35+02:00&#034; href=&#034;https://cwiki.apache.org/confluence/display/Hive/GenericUDAFCaseStudy&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://cwiki.apache.org/confluence/display/Hive/GenericUDAFCaseStudy&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/UDAF"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stackoverflow.com/questions/13628658/hive-text-delimiter"><title>Hive Input Format</title><description></description><link>http://stackoverflow.com/questions/13628658/hive-text-delimiter</link><dc:creator>macek</dc:creator><dc:date>2013-09-04T10:27:37+02:00</dc:date><dc:subject>Hive InputFormat </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-09-04T10:27:37+02:00&#034; href=&#034;http://stackoverflow.com/questions/13628658/hive-text-delimiter&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://stackoverflow.com/questions/13628658/hive-text-delimiter&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/InputFormat"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cwiki.apache.org/Hive/languagemanual-udf.html"><title>HIVE UDF</title><description></description><link>https://cwiki.apache.org/Hive/languagemanual-udf.html</link><dc:creator>macek</dc:creator><dc:date>2013-09-04T10:20:58+02:00</dc:date><dc:subject>Hive UDF </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-09-04T10:20:58+02:00&#034; href=&#034;https://cwiki.apache.org/Hive/languagemanual-udf.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://cwiki.apache.org/Hive/languagemanual-udf.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/UDF"/></rdf:Bag></taxo:topics></item><item rdf:about="http://de.slideshare.net/nzhang/hive-anatomy"><title>Hive UDF</title><description></description><link>http://de.slideshare.net/nzhang/hive-anatomy</link><dc:creator>macek</dc:creator><dc:date>2013-09-04T10:17:26+02:00</dc:date><dc:subject>Hadoop Hive UDF </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-09-04T10:17:26+02:00&#034; href=&#034;http://de.slideshare.net/nzhang/hive-anatomy&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://de.slideshare.net/nzhang/hive-anatomy&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hadoop"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/UDF"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stackoverflow.com/questions/7567605/how-to-load-data-to-hive-from-hdfs-without-removing-the-source-file"><title>hadoop - How to load data to hive from HDFS without removing the source file? - Stack Overflow</title><description>create external table table_name (
  id int,
  myfields string
)
location &#039;/my/location/in/hdfs&#039;;</description><link>http://stackoverflow.com/questions/7567605/how-to-load-data-to-hive-from-hdfs-without-removing-the-source-file</link><dc:creator>macek</dc:creator><dc:date>2013-09-03T16:19:12+02:00</dc:date><dc:subject>Hadoop Hive </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;create external table table_name (
  id int,
  myfields string
)
location &amp;#039;/my/location/in/hdfs&amp;#039;;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hadoop"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hive"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.isi.edu/~adibi/Enron/Enron.htm"><title>Enron Dataset</title><description></description><link>http://www.isi.edu/~adibi/Enron/Enron.htm</link><dc:creator>macek</dc:creator><dc:date>2013-07-15T10:25:43+02:00</dc:date><dc:subject>DataSet ENRON </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-07-15T10:25:43+02:00&#034; href=&#034;http://www.isi.edu/~adibi/Enron/Enron.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.isi.edu/~adibi/Enron/Enron.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/DataSet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ENRON"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Mention_(blogging)"><title>Mention (blogging) - Wikipedia, the free encyclopedia</title><description> Twitter added support for &#034;@replies&#034; beginning in May 2008,[3] with any combination of @ with a username being turned into a hyperlink to the profile. On March 30, 2009, Twitter updated the feature and renamed it &#034;Mentions&#034; (i.e., to &#034;mention&#034; user &#034;@janedoe&#034;) so as to include non-reply posts directed at individual users.[4]</description><link>http://en.wikipedia.org/wiki/Mention_(blogging)</link><dc:creator>macek</dc:creator><dc:date>2013-06-27T17:41:55+02:00</dc:date><dc:subject>2009 Mention Twitter </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt; Twitter added support for &amp;#034;@replies&amp;#034; beginning in May 2008,[3] with any combination of @ with a username being turned into a hyperlink to the profile. On March 30, 2009, Twitter updated the feature and renamed it &amp;#034;Mentions&amp;#034; (i.e., to &amp;#034;mention&amp;#034; user &amp;#034;@janedoe&amp;#034;) so as to include non-reply posts directed at individual users.[4]&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2009"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Mention"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Twitter"/></rdf:Bag></taxo:topics></item><item rdf:about="http://scikit-learn.org/stable/modules/neighbors.html"><title>Python KNN with KD Trees</title><description>tutorial for python kd trees</description><link>http://scikit-learn.org/stable/modules/neighbors.html</link><dc:creator>macek</dc:creator><dc:date>2013-05-27T11:04:32+02:00</dc:date><dc:subject>Classification DataMining KNN Prediction Tutorial </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;tutorial for python kd trees&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Classification"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/DataMining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/KNN"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Prediction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://projects.scipy.org/scikits/wiki/AnnWrapper"><title>Python KNN with KD Trees</title><description>I think that you should use scikit ann.

There is a good tutorial about the nearest neightbour here.</description><link>http://projects.scipy.org/scikits/wiki/AnnWrapper</link><dc:creator>macek</dc:creator><dc:date>2013-05-24T15:33:33+02:00</dc:date><dc:subject>classification knn </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;I think that you should use scikit ann.

There is a good tutorial about the nearest neightbour here.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/classification"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/knn"/></rdf:Bag></taxo:topics></item><item rdf:about="http://sci2s.ugr.es/keel/algorithms.php#sub4"><title>Original Papers for Data Mining algorithmns</title><description>KEEL contains classical knowledge extraction algorithms, preprocessing techniques, Computational Intelligence based learning algorithms, evolutionary rule learning algorithms, genetic fuzzy systems, evolutionary neural networks, etc.</description><link>http://sci2s.ugr.es/keel/algorithms.php#sub4</link><dc:creator>macek</dc:creator><dc:date>2013-05-23T17:27:27+02:00</dc:date><dc:subject>DataMining Original Papers </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;KEEL contains classical knowledge extraction algorithms, preprocessing techniques, Computational Intelligence based learning algorithms, evolutionary rule learning algorithms, genetic fuzzy systems, evolutionary neural networks, etc.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/DataMining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Original"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Papers"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mit.edu/~jtidwell/common_ground.html"><title>HCI Patterns</title><description>Status Display (data proc)
Short Description (explanation awareness)</description><link>http://www.mit.edu/~jtidwell/common_ground.html</link><dc:creator>macek</dc:creator><dc:date>2013-05-22T09:36:34+02:00</dc:date><dc:subject>hci pattern </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Status Display (data proc)
Short Description (explanation awareness)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hci"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pattern"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stackoverflow.com/questions/7332732/using-grep-to-filter-out-words-from-a-stopwords-file"><title>Custom Stopwordsfilter</title><description></description><link>http://stackoverflow.com/questions/7332732/using-grep-to-filter-out-words-from-a-stopwords-file</link><dc:creator>macek</dc:creator><dc:date>2013-05-17T16:34:03+02:00</dc:date><dc:subject>Filter Linux SED StopWords </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-05-17T16:34:03+02:00&#034; href=&#034;http://stackoverflow.com/questions/7332732/using-grep-to-filter-out-words-from-a-stopwords-file&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://stackoverflow.com/questions/7332732/using-grep-to-filter-out-words-from-a-stopwords-file&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Filter"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Linux"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/SED"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/StopWords"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.linux-schule.com/trans_html/007Awk/awk1_numbering.html"><title>Durchnummerieren einer Datei</title><description>erzeugt zeilenweisen index mit einzeiler </description><link>http://www.linux-schule.com/trans_html/007Awk/awk1_numbering.html</link><dc:creator>macek</dc:creator><dc:date>2013-05-16T13:40:18+02:00</dc:date><dc:subject>data sed </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;erzeugt zeilenweisen index mit einzeiler &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sed"/></rdf:Bag></taxo:topics></item><item rdf:about="http://gibbslda.sourceforge.net/"><title>GibbsLDA++: A C/C++ Implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling for Parameter Estimation and Inference</title><description>GibbsLDA++ software tool</description><link>http://gibbslda.sourceforge.net/</link><dc:creator>macek</dc:creator><dc:date>2013-05-10T14:24:02+02:00</dc:date><dc:subject>LDA Topic </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;GibbsLDA++ software tool&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/LDA"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Topic"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.biomedcentral.com/1471-2105/10/213"><title>Mean Decrease Gini</title><description>With pk=n_k/n being the fraction of the n_k samples from class k = {0,1} out of the total of n samples at node τ, the Gini impurity i(τ) is calculated as 1-p_0^2-p_1^2. The more discriminativ or clean a node is the lower is the value. A split will happen, if the decrease (delta_i) of the value is great for a given node. The gini decrease is the sum over all nodes in all trees of their delta_i&#039;s.




</description><link>http://www.biomedcentral.com/1471-2105/10/213</link><dc:creator>macek</dc:creator><dc:date>2013-04-01T10:43:20+02:00</dc:date><dc:subject>importance randomforest </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;With pk=n_k/n being the fraction of the n_k samples from class k = {0,1} out of the total of n samples at node τ, the Gini impurity i(τ) is calculated as 1-p_0^2-p_1^2. The more discriminativ or clean a node is the lower is the value. A split will happen, if the decrease (delta_i) of the value is great for a given node. The gini decrease is the sum over all nodes in all trees of their delta_i&amp;#039;s.




&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/importance"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/randomforest"/></rdf:Bag></taxo:topics></item><item rdf:about="http://cran.r-project.org/web/packages/e1071/vignettes/svmdoc.pdf"><title>SVM Tutorial for e1701</title><description></description><link>http://cran.r-project.org/web/packages/e1071/vignettes/svmdoc.pdf</link><dc:creator>macek</dc:creator><dc:date>2013-03-18T15:43:32+01:00</dc:date><dc:subject>SVM Tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-03-18T15:43:32+01:00&#034; href=&#034;http://cran.r-project.org/web/packages/e1071/vignettes/svmdoc.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://cran.r-project.org/web/packages/e1071/vignettes/svmdoc.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/SVM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ci.tuwien.ac.at/~meyer/svm/final.pdf"><title>Tune SVMs in R with e1701</title><description></description><link>http://www.ci.tuwien.ac.at/~meyer/svm/final.pdf</link><dc:creator>macek</dc:creator><dc:date>2013-03-18T15:28:57+01:00</dc:date><dc:subject>SVM tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-03-18T15:28:57+01:00&#034; href=&#034;http://www.ci.tuwien.ac.at/~meyer/svm/final.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.ci.tuwien.ac.at/~meyer/svm/final.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/SVM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.waikato.ac.nz/ml/weka/arff.html"><title>Attribute-Relation File Format (ARFF)</title><description></description><link>http://www.cs.waikato.ac.nz/ml/weka/arff.html</link><dc:creator>macek</dc:creator><dc:date>2013-03-04T11:04:13+01:00</dc:date><dc:subject>data format </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-03-04T11:04:13+01:00&#034; href=&#034;http://www.cs.waikato.ac.nz/ml/weka/arff.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.waikato.ac.nz/ml/weka/arff.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/format"/></rdf:Bag></taxo:topics></item></rdf:RDF>