<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/bibtex/1385fb6f60e7dc2ef5b2c634eb6fec067"><title>BibSonomy publications for /bibtex/1385fb6f60e7dc2ef5b2c634eb6fec067</title><link>BibSonomyburst/bibtex/1385fb6f60e7dc2ef5b2c634eb6fec067</link><description>BibSonomy RSS feed for /bibtex/1385fb6f60e7dc2ef5b2c634eb6fec067</description><dc:date>2012-02-17T09:31:32+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cc25ca325d5b376a57531900617f90cc/apriorialgo"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25f6d19d68470ef773b6165398de58ce3/sonntag"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/mboley"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/steff83"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/huiyangsfsu"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20f2b5fa350ecbd7426547e9768f910dd/arath"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20f4bcd1aad4b5d4d161e5d97aa9b5b11/pirot"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2cc25ca325d5b376a57531900617f90cc/apriorialgo"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/2cc25ca325d5b376a57531900617f90cc/apriorialgo</link><dc:creator>apriorialgo</dc:creator><dc:date>2011-06-07T10:30:18+02:00</dc:date><dc:subject>AWM2011 AprioriAlgorithmKohlerKorbeLoibner </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/AWM2011"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/AprioriAlgorithmKohlerKorbeLoibner"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2cc25ca325d5b376a57531900617f90cc/apriorialgo"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2cc25ca325d5b376a57531900617f90cc/apriorialgo"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://rakesh.agrawal-family.com/papers/vldb94apriori.pdf"/><swrc:date>Tue Jun 07 10:30:18 CEST 2011</swrc:date><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>AWM2011 AprioriAlgorithmKohlerKorbeLoibner </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/25f6d19d68470ef773b6165398de58ce3/sonntag"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/25f6d19d68470ef773b6165398de58ce3/sonntag</link><dc:creator>sonntag</dc:creator><dc:date>2009-11-25T18:41:14+01:00</dc:date><dc:subject>QABook imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of 20th International Conference on Very Large Data Bases,
	VLDB, &lt;/em&gt;&lt;em&gt;page 487--499. &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;(&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/QABook"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25f6d19d68470ef773b6165398de58ce3/sonntag"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25f6d19d68470ef773b6165398de58ce3/sonntag"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="/brokenurl#citeseer.ist.psu.edu/agrawal94fast.html"/><swrc:date>Wed Nov 25 18:41:14 CET 2009</swrc:date><swrc:booktitle>Proceedings of 20th International Conference on Very Large Data Bases,
	{VLDB}</swrc:booktitle><swrc:pages>487--499</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann"/></swrc:publisher><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>QABook imported </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2009.11.25" swrc:key="timestamp"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-55860-153-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="sonntag" swrc:key="owner"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jorge B. Bocca"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Matthias Jarke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Carlo Zaniolo"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>Daniel Sonntag all references</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/mboley"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/mboley</link><dc:creator>mboley</dc:creator><dc:date>2009-08-14T12:38:30+02:00</dc:date><dc:subject>associationRules frequentSetMining patternMining </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. 20th Int. Conf. Very Large Data Bases, VLDB, &lt;/em&gt;&lt;em&gt;page 487--499. &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;(&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/associationRules"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/frequentSetMining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/patternMining"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/mboley"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/224d24f79aeaefa77af9a1833e8eb7428/mboley"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Fri Aug 14 12:38:30 CEST 2009</swrc:date><swrc:booktitle>Proc. 20th Int. Conf. Very Large Data Bases, VLDB</swrc:booktitle><swrc:pages>487--499</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann"/></swrc:publisher><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>associationRules frequentSetMining patternMining </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication><description>article introducing (?) apriori</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/steff83"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/steff83</link><dc:creator>steff83</dc:creator><dc:date>2009-02-01T20:49:29+01:00</dc:date><dc:subject>algorithm apriori association master_thesis rules </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;R. Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;R. Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;20th VLDB Conf., &lt;/em&gt;(&lt;em&gt;September 1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/apriori"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/association"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/master_thesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rules"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/steff83"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a852ed1dbca949646bdb05469e867669/steff83"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Sun Feb 01 20:49:29 CET 2009</swrc:date><swrc:booktitle>20th VLDB Conf.</swrc:booktitle><swrc:month>Sep</swrc:month><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>algorithm apriori association master_thesis rules </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="R. Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="R. Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/huiyangsfsu"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/huiyangsfsu</link><dc:creator>huiyangsfsu</dc:creator><dc:date>2009-01-16T05:54:11+01:00</dc:date><dc:subject>association rules </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;R. Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;R. Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;20th VLDB Conf., &lt;/em&gt;(&lt;em&gt;September 1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/association"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rules"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a852ed1dbca949646bdb05469e867669/huiyangsfsu"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a852ed1dbca949646bdb05469e867669/huiyangsfsu"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Fri Jan 16 05:54:11 CET 2009</swrc:date><swrc:booktitle>20th VLDB Conf.</swrc:booktitle><swrc:month>Sep</swrc:month><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>association rules </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="R. Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="R. Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:35:11+01:00</dc:date><dc:subject>conceptual_graphs </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. 20th Int. Conf. Very Large Data Bases, VLDB, &lt;/em&gt;(&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conceptual_graphs"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Fri Dec 14 02:35:11 CET 2007</swrc:date><swrc:booktitle>Proc. 20th Int. Conf. Very Large Data Bases, VLDB</swrc:booktitle><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>conceptual_graphs </swrc:keywords><swrc:abstract>We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Experiments with synthetic as well as real-life data show that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed ...</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20f2b5fa350ecbd7426547e9768f910dd/arath"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/20f2b5fa350ecbd7426547e9768f910dd/arath</link><dc:creator>arath</dc:creator><dc:date>2007-07-14T10:58:22+02:00</dc:date><dc:subject>Association Mining Rules </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. 20th Int. Conf. Very Large Data Bases, VLDB, &lt;/em&gt;&lt;em&gt;page 487--499. &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;(&lt;em&gt;December 1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Association"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Rules"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20f2b5fa350ecbd7426547e9768f910dd/arath"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20f2b5fa350ecbd7426547e9768f910dd/arath"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="/brokenurl#citeseer.ist.psu.edu/agrawal94fast.html"/><swrc:date>Sat Jul 14 10:58:22 CEST 2007</swrc:date><swrc:booktitle>Proc. 20th Int. Conf. Very Large Data Bases, {VLDB}</swrc:booktitle><swrc:month>12--15~</swrc:month><swrc:pages>487--499</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann"/></swrc:publisher><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>Association Mining Rules </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1-55860-153-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jorge B. Bocca"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Matthias Jarke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Carlo Zaniolo"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20f4bcd1aad4b5d4d161e5d97aa9b5b11/pirot"><title>Fast Algorithms for Mining Association Rules</title><link>http://www.bibsonomy.org/bibtex/20f4bcd1aad4b5d4d161e5d97aa9b5b11/pirot</link><dc:creator>pirot</dc:creator><dc:date>2006-03-07T21:19:39+01:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Agrawal&#034;&gt;Rakesh Agrawal&lt;/a&gt;,  and &lt;a href=&#034;/author/Srikant&#034;&gt;Ramakrishnan Srikant&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 20th International Conference on Very Large Databases VLDB&amp;#039;94, &lt;/em&gt;&lt;em&gt;page 487--499. &lt;/em&gt;(&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20f4bcd1aad4b5d4d161e5d97aa9b5b11/pirot"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20f4bcd1aad4b5d4d161e5d97aa9b5b11/pirot"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Tue Mar 07 21:19:39 CET 2006</swrc:date><swrc:booktitle>Proceedings of the 20th International Conference on Very Large Databases (VLDB&#039;94)</swrc:booktitle><swrc:pages>487--499</swrc:pages><swrc:title>Fast Algorithms for Mining Association Rules</swrc:title><swrc:year>1994</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rakesh Agrawal"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ramakrishnan Srikant"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>
