Ｇａｌｏｉｓ格用于知识发现具有许多优点，并在实际应用中显示了一定的价值。现提出一种在已剪枝的Ｇａｌｏｉｓ格上直接计算规则的算法，其主要依据格结点的直接泛化来产生规则集合。该算法在一定条件下更为有效，并且所产生的规则集合是无冗余的。文中所述方法已用于数据库知识发现工具ＨＵＴＫＤＤ中。 Galois lattice has many advantages for knowledge discovery and shows some value in practical application. An algorithm for calculating rules directly on pruned Galois lattices is proposed. The rule sets are generated based on the direct generalization of grid nodes. The algorithm is more efficient under certain conditions and the resulting set of rules is non-redundant. The method described in this article has been used in the database knowledge discovery tool HUTKDD.