The algorithm LCM (Linear time Closed itemset Miner), designed by Uno et al.(1)(2)(3), enumerates frequent closed itemsets from a set of itemsets

fcicq のブックマーク 2012/06/04 23:24

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/26953389/comment/fcicq" data-user-id="fcicq" data-entry-url="https://b.hatena.ne.jp/entry/s/code.google.com/archive/p/lcmplusplus" data-original-href="https://code.google.com/archive/p/lcmplusplus" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fcode.google.com%2Farchive%2Fp%2Flcmplusplus" data-user-icon="/users/fcicq/profile.png">Google Code Archive - Long-term storage for Google Code Project Hosting.</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/toread">toread</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/datamining">datamining</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/tools">tools</a>]</li></ul><br><p style="clear: left">The algorithm LCM (Linear time Closed itemset Miner), designed by Uno et al.(1)(2)(3), enumerates frequent closed itemsets from a set of itemsets</p><a class="datetime" href="https://b.hatena.ne.jp/fcicq/20120604#bookmark-26953389"><span class="datetime-body">2012/06/04 23:24</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！