期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于项集分解的快速挖掘最大频繁项集算法 被引量:1
1
作者 余平 汪继文 《佳木斯大学学报(自然科学版)》 CAS 2009年第4期511-513,共3页
对Apriori算法的分析,提出采用分解事务数据库中最长的项集,使用前缀划分的表示方法,从而快速地归纳出事务数据库中的最大频繁项集.
关键词 关联规则 APRIORI算法 项集分解
下载PDF
Equality-constrained minimization of polynomial functions
2
作者 XIAO ShuiJing ZENG GuangXing 《Science China Mathematics》 SCIE CSCD 2015年第10期2181-2204,共24页
This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,...... This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients. 展开更多
关键词 polynomial function equality constraints equality-constrained minimization constrained infimum Wu’s algorithm triangular decompo
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部