资 源 简 介
Introduction
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. Frequent means that an itemset occurs in no less than N, where N is a user given threshold usually called minimum support. Closed means the maximal itemsets among each equivalent class that consists of all frequent patterns with the same occurence sets in a set of itemsets. LCM uses prefix-preserving closure extension for the efficient enumeration.
Author
Yasuo Tabei,
Department of Computational Biology, Graduate School of Frontier Sciences, The University of Tokyo
Download
LCM is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License.
LCM is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See GNU General Publi
