<?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/gromgull/machine-learning"><title>BibSonomy bookmarks for /user/gromgull/machine-learning</title><link>https://www.bibsonomy.org/user/gromgull/machine-learning</link><description>BibSonomy RSS Feed for /user/gromgull/machine-learning</description><items><rdf:Seq><rdf:li rdf:resource="http://www.cip.ifi.lmu.de/~nickel/iswc2012-learning-on-linked-data-with-tensors/"/><rdf:li rdf:resource="http://massivedatasets.wordpress.com/"/><rdf:li rdf:resource="http://factorie.cs.umass.edu/"/><rdf:li rdf:resource="http://www.clips.ua.ac.be/pages/pattern"/><rdf:li rdf:resource="http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/"/><rdf:li rdf:resource="http://priorknowledge.com/"/><rdf:li rdf:resource="http://blog.bigml.com/2012/05/04/machine-learning-in-python-has-never-been-easier/"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~ukang/HEIGEN/"/><rdf:li rdf:resource="http://ssc.io/why-apache-giraph-is-more-than-a-graph-processing-system/"/><rdf:li rdf:resource="http://graphlab.org/"/><rdf:li rdf:resource="http://www.azintablog.com/2010/10/16/gpu-large-scale-data-mining/"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~pegasus/"/><rdf:li rdf:resource="http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=19728"/><rdf:li rdf:resource="http://ailab.wsu.edu/subdue/"/><rdf:li rdf:resource="https://github.com/mrhichem/RNNLIB"/><rdf:li rdf:resource="http://www.slideshare.net/GaelVaroquaux/python-for-brain-mining-neuroscience-with-state-of-the-art-machine-learning-and-data-visualization"/><rdf:li rdf:resource="http://zyxo.wordpress.com/2010/09/17/why-decision-trees-is-the-best-data-mining-algorithm/"/><rdf:li rdf:resource="http://mloss.org/software/view/128/"/><rdf:li rdf:resource="http://research.cs.wisc.edu/hazy/tuffy/"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Local_Outlier_Factor"/></rdf:Seq></items></channel><item rdf:about="http://www.cip.ifi.lmu.de/~nickel/iswc2012-learning-on-linked-data-with-tensors/"><title>ISWC 2012 Tutorial - Machine Learning on Linked Data: Tensors and their Applications in Graph-Structured Domains</title><description>This tutorial will provide an introduction to tensor factorizations and their applications for machine learning on graphs.</description><link>http://www.cip.ifi.lmu.de/~nickel/iswc2012-learning-on-linked-data-with-tensors/</link><dc:creator>gromgull</dc:creator><dc:date>2012-12-03T11:32:01+01:00</dc:date><dc:subject>semantic-web machine-learning linked-open-data </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This tutorial will provide an introduction to tensor factorizations and their applications for machine learning on graphs.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/semantic-web"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linked-open-data"/></rdf:Bag></taxo:topics></item><item rdf:about="http://massivedatasets.wordpress.com/"><title>Algorithms for Massive Data Sets</title><description>Homepage for Algorithms for Massive Data Sets at DTU Informatics</description><link>http://massivedatasets.wordpress.com/</link><dc:creator>gromgull</dc:creator><dc:date>2012-11-28T16:21:47+01:00</dc:date><dc:subject>teaching courseware courese machine-learning </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Homepage for Algorithms for Massive Data Sets at DTU Informatics&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/teaching"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/courseware"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/courese"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/></rdf:Bag></taxo:topics></item><item rdf:about="http://factorie.cs.umass.edu/"><title>Factorie</title><description>FACTORIE is a toolkit for deployable probabilistic modeling, implemented as a software library in Scala. It provides its users with a succinct language for creating relational factor graphs, estimating parameters and performing inference.</description><link>http://factorie.cs.umass.edu/</link><dc:creator>gromgull</dc:creator><dc:date>2012-10-31T10:45:00+01:00</dc:date><dc:subject>mccallum scala machine-learning graphical-models </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;FACTORIE is a toolkit for deployable probabilistic modeling, implemented as a software library in Scala. It provides its users with a succinct language for creating relational factor graphs, estimating parameters and performing inference.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mccallum"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scala"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphical-models"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.clips.ua.ac.be/pages/pattern"><title>Pattern | CLiPS</title><description>Pattern is a web mining module for the Python programming language.

It bundles tools for data retrieval (Google + Twitter + Wikipedia API, web spider, HTML DOM parser), text analysis (rule-based shallow parser, WordNet interface, syntactical + semantical n-gram search algorithm, tf-idf + cosine similarity + LSA metrics), clustering and classification (k-means, KNN, SVM), and data visualization (graph networks).</description><link>http://www.clips.ua.ac.be/pages/pattern</link><dc:creator>gromgull</dc:creator><dc:date>2012-07-15T09:30:58+02:00</dc:date><dc:subject>machine-learning web-mining nlp python library </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Pattern is a web mining module for the Python programming language.

It bundles tools for data retrieval (Google + Twitter + Wikipedia API, web spider, HTML DOM parser), text analysis (rule-based shallow parser, WordNet interface, syntactical + semantical n-gram search algorithm, tf-idf + cosine similarity + LSA metrics), clustering and classification (k-means, KNN, SVM), and data visualization (graph networks).&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web-mining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nlp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/library"/></rdf:Bag></taxo:topics></item><item rdf:about="http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/"><title>Probabilistic Data Structures for Web Analytics and Data Mining  « Highly Scalable Blog</title><description></description><link>http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/</link><dc:creator>gromgull</dc:creator><dc:date>2012-05-29T12:08:16+02:00</dc:date><dc:subject>big-data machine-learning approximation heuristics data-structures online-learning </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2012-05-29T12:08:16+02:00&#034; href=&#034;http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/big-data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/approximation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/heuristics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data-structures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/online-learning"/></rdf:Bag></taxo:topics></item><item rdf:about="http://priorknowledge.com/"><title>Prior Knowledge Home |</title><description>Another cloud computing service for prediction. This time based on a massive joint-prob model across all variables.</description><link>http://priorknowledge.com/</link><dc:creator>gromgull</dc:creator><dc:date>2012-05-04T08:22:18+02:00</dc:date><dc:subject>machine-learning web-service cloud-computing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Another cloud computing service for prediction. This time based on a massive joint-prob model across all variables.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web-service"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cloud-computing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blog.bigml.com/2012/05/04/machine-learning-in-python-has-never-been-easier/"><title>Machine Learning in Python Has Never Been Easier!</title><description>BigML is a web-service for running distributed ML. 64gb free upload, API in python. </description><link>http://blog.bigml.com/2012/05/04/machine-learning-in-python-has-never-been-easier/</link><dc:creator>gromgull</dc:creator><dc:date>2012-05-04T08:06:36+02:00</dc:date><dc:subject>machine-learning python api cloud-computing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;BigML is a web-service for running distributed ML. 64gb free upload, API in python. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/api"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cloud-computing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~ukang/HEIGEN/"><title>HEigen</title><description>HEigen is a spectral analysis tool which computes top k eigenvalues and corresponding eigenvectors of extremely large(~billions of nodes and edges) graphs. HEigen runs on top of Hadoop platform. </description><link>http://www.cs.cmu.edu/~ukang/HEIGEN/</link><dc:creator>gromgull</dc:creator><dc:date>2012-02-22T17:20:55+01:00</dc:date><dc:subject>graph-processing machine-learning eigen hadoop </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;HEigen is a spectral analysis tool which computes top k eigenvalues and corresponding eigenvectors of extremely large(~billions of nodes and edges) graphs. HEigen runs on top of Hadoop platform. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph-processing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/eigen"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hadoop"/></rdf:Bag></taxo:topics></item><item rdf:about="http://ssc.io/why-apache-giraph-is-more-than-a-graph-processing-system/"><title>Why Apache Giraph is more than a graph processing system | “I for one welcome our new computer overlords”</title><description>The Apache Giraph project is a fault-tolerant in-memory distributed graph processing system which runs on top of a standard Hadoop installation.</description><link>http://ssc.io/why-apache-giraph-is-more-than-a-graph-processing-system/</link><dc:creator>gromgull</dc:creator><dc:date>2012-02-22T17:11:51+01:00</dc:date><dc:subject>machine-learning map-reduce cluster-computing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The Apache Giraph project is a fault-tolerant in-memory distributed graph processing system which runs on top of a standard Hadoop installation.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/map-reduce"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cluster-computing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://graphlab.org/"><title>GraphLab: A New Parallel Framework for Machine Learning</title><description>GraphLab: A Parallel Framework for Machine Learning</description><link>http://graphlab.org/</link><dc:creator>gromgull</dc:creator><dc:date>2012-02-22T17:10:08+01:00</dc:date><dc:subject>parallel-computing GraphLab machine-learning graph graph-processing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;GraphLab: A Parallel Framework for Machine Learning&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parallel-computing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/GraphLab"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph-processing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.azintablog.com/2010/10/16/gpu-large-scale-data-mining/"><title>GPU and Large Scale Data Mining «  Azinta Systems Blog</title><description></description><link>http://www.azintablog.com/2010/10/16/gpu-large-scale-data-mining/</link><dc:creator>gromgull</dc:creator><dc:date>2012-02-22T17:06:14+01:00</dc:date><dc:subject>machine-learning gpu cuda </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2012-02-22T17:06:14+01:00&#034; href=&#034;http://www.azintablog.com/2010/10/16/gpu-large-scale-data-mining/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.azintablog.com/2010/10/16/gpu-large-scale-data-mining/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gpu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cuda"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~pegasus/"><title>PEGASUS: Peta-Scale Graph Mining System</title><description>Pegasus An award-winning, open-source, graph-mining system with massive scalability. Analyze petabytes of graph data with ease. </description><link>http://www.cs.cmu.edu/~pegasus/</link><dc:creator>gromgull</dc:creator><dc:date>2012-02-13T11:17:10+01:00</dc:date><dc:subject>machine-learning graph-mining </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Pegasus An award-winning, open-source, graph-mining system with massive scalability. Analyze petabytes of graph data with ease. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph-mining"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=19728"><title>DMA 2012 : Workshop on Data Mining in Agriculture</title><description>DMA 2012 : Workshop on Data Mining in Agriculture</description><link>http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=19728</link><dc:creator>gromgull</dc:creator><dc:date>2011-11-21T14:28:55+01:00</dc:date><dc:subject>workshop data-mining machine-learning igreen agriculture </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;DMA 2012 : Workshop on Data Mining in Agriculture&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/workshop"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data-mining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/igreen"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/agriculture"/></rdf:Bag></taxo:topics></item><item rdf:about="http://ailab.wsu.edu/subdue/"><title>SUBDUE - Graph Based Knowledge Discovery</title><description>SUBDUE is a graph-based knowledge discovery system that finds structural, relational patterns in data representing entities and relationships. SUBDUE represents data using a labeled, directed graph in which entities are represented by labeled vertices or subgraphs, and relationships are represented by labeled edges between the entities.  SUBDUE uses the minimum description length (MDL) principle to identify patterns that minimize the number of bits needed to describe the input graph after being compressed by the pattern. SUBDUE can perform several learning tasks, including unsupervised learning, supervised learning, clustering and graph grammar learning. </description><link>http://ailab.wsu.edu/subdue/</link><dc:creator>gromgull</dc:creator><dc:date>2011-10-17T13:56:41+02:00</dc:date><dc:subject>machine-learning data-mining graphs </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;SUBDUE is a graph-based knowledge discovery system that finds structural, relational patterns in data representing entities and relationships. SUBDUE represents data using a labeled, directed graph in which entities are represented by labeled vertices or subgraphs, and relationships are represented by labeled edges between the entities.  SUBDUE uses the minimum description length (MDL) principle to identify patterns that minimize the number of bits needed to describe the input graph after being compressed by the pattern. SUBDUE can perform several learning tasks, including unsupervised learning, supervised learning, clustering and graph grammar learning. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data-mining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphs"/></rdf:Bag></taxo:topics></item><item rdf:about="https://github.com/mrhichem/RNNLIB"><title>mrhichem/RNNLIB - GitHub</title><description>RNNLIB - A recurrent neural network library for sequence learning problems.

As published by Marcus Liwicki</description><link>https://github.com/mrhichem/RNNLIB</link><dc:creator>gromgull</dc:creator><dc:date>2011-08-12T10:24:52+02:00</dc:date><dc:subject>neural-networks recurrent-neural-networks machine-learning hand-writing-recognition </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;RNNLIB - A recurrent neural network library for sequence learning problems.

As published by Marcus Liwicki&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/neural-networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recurrent-neural-networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hand-writing-recognition"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.slideshare.net/GaelVaroquaux/python-for-brain-mining-neuroscience-with-state-of-the-art-machine-learning-and-data-visualization"><title>Python for brain mining: (neuro)science with state of the art machi...</title><description></description><link>http://www.slideshare.net/GaelVaroquaux/python-for-brain-mining-neuroscience-with-state-of-the-art-machine-learning-and-data-visualization</link><dc:creator>gromgull</dc:creator><dc:date>2011-07-15T15:50:41+02:00</dc:date><dc:subject>toread python machine-learning </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-15T15:50:41+02:00&#034; href=&#034;http://www.slideshare.net/GaelVaroquaux/python-for-brain-mining-neuroscience-with-state-of-the-art-machine-learning-and-data-visualization&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.slideshare.net/GaelVaroquaux/python-for-brain-mining-neuroscience-with-state-of-the-art-machine-learning-and-data-visualization&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/></rdf:Bag></taxo:topics></item><item rdf:about="http://zyxo.wordpress.com/2010/09/17/why-decision-trees-is-the-best-data-mining-algorithm/"><title>Why decision trees is the best data mining algorithm « Mixotricha</title><description></description><link>http://zyxo.wordpress.com/2010/09/17/why-decision-trees-is-the-best-data-mining-algorithm/</link><dc:creator>gromgull</dc:creator><dc:date>2011-06-14T16:18:58+02:00</dc:date><dc:subject>machine-learning decision-trees </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-06-14T16:18:58+02:00&#034; href=&#034;http://zyxo.wordpress.com/2010/09/17/why-decision-trees-is-the-best-data-mining-algorithm/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://zyxo.wordpress.com/2010/09/17/why-decision-trees-is-the-best-data-mining-algorithm/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/decision-trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mloss.org/software/view/128/"><title>mloss | Project details:Torch 5</title><description>Mloss is a community effort at
		producing reproducible research
		via open source software, open
		access to data and results, and
		open standards for interchange.</description><link>http://mloss.org/software/view/128/</link><dc:creator>gromgull</dc:creator><dc:date>2011-05-17T16:36:39+02:00</dc:date><dc:subject>machine-learning open-source tools </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Mloss is a community effort at
		producing reproducible research
		via open source software, open
		access to data and results, and
		open standards for interchange.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/open-source"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics></item><item rdf:about="http://research.cs.wisc.edu/hazy/tuffy/"><title>Tuffy | A Scalable MLN Inference Engine</title><description>Markov Logic Networks (MLNs) is a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including information extraction, entity resolution, text mining, and natural language processing. Based on principled data management techniques, Tuffy is an MLN inference engine that achieves scalability and orders of magnitude speedup compared to prior art implementations. It is written in Java and relies on PostgreSQL. For a brief introduction to MLNs and the technical details of Tuffy, please see our technical report. </description><link>http://research.cs.wisc.edu/hazy/tuffy/</link><dc:creator>gromgull</dc:creator><dc:date>2011-04-21T11:45:53+02:00</dc:date><dc:subject>machine-learning markov-logic-networks java postgresql </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Markov Logic Networks (MLNs) is a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including information extraction, entity resolution, text mining, and natural language processing. Based on principled data management techniques, Tuffy is an MLN inference engine that achieves scalability and orders of magnitude speedup compared to prior art implementations. It is written in Java and relies on PostgreSQL. For a brief introduction to MLNs and the technical details of Tuffy, please see our technical report. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/markov-logic-networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/postgresql"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Local_Outlier_Factor"><title>Local Outlier Factor - Wikipedia, the free encyclopedia</title><description>Local Outlier Factor (LOF) is an anomaly detection algorithm presented as &#034;LOF: Identifying Density-based Local Outliers&#034; by Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng and Jörg Sander[1]. The key idea of LOF is comparing the local density of a point&#039;s neighborhood with the local density of its neighbors.</description><link>http://en.wikipedia.org/wiki/Local_Outlier_Factor</link><dc:creator>gromgull</dc:creator><dc:date>2011-04-19T11:20:06+02:00</dc:date><dc:subject>machine-learning anomaly-detection </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Local Outlier Factor (LOF) is an anomaly detection algorithm presented as &amp;#034;LOF: Identifying Density-based Local Outliers&amp;#034; by Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng and Jörg Sander[1]. The key idea of LOF is comparing the local density of a point&amp;#039;s neighborhood with the local density of its neighbors.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/anomaly-detection"/></rdf:Bag></taxo:topics></item></rdf:RDF>