<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>xiaopei的博客 - </title><link>category/405560.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Tue, 03 Jun 2008 22:14:20 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>xiaopei</dc:creator><title>[数据挖掘概念与技术]产生关联规则和提高apriori性能的方法</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508959.aspx</link><pubDate>Tue, 03 Jun 2008 22:14:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508959.aspx</guid><wfw:comment>comments/2508959.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508959.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2508959.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2508959</trackback:ping><description>产生关联规则和提高apriori性能的方法&lt;img src ="aggbug/2508959.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>[数据挖掘概念与技术]产生关联规则和提高apriori性能的方法</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508963.aspx</link><pubDate>Tue, 03 Jun 2008 22:14:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508963.aspx</guid><wfw:comment>comments/2508963.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508963.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2508963.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2508963</trackback:ping><description>产生关联规则和提高apriori性能的方法&lt;img src ="aggbug/2508963.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>[数据挖掘概念核技术]5.2.1 Apriori</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508800.aspx</link><pubDate>Tue, 03 Jun 2008 21:17:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508800.aspx</guid><wfw:comment>comments/2508800.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/06/03/2508800.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2508800.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2508800</trackback:ping><description>apriori :finding frequent itemsets using candidate generation&lt;img src ="aggbug/2508800.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>