A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial partic...A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial particles was designed to ensure the reasonable initial fitness, and then, the dynamically dimensionality cutting of dataset was built to decrease the search space. Based on four high-dimensional datasets, BPSO-HD was compared with Apriori to test its reliability, and was compared with the ordinary BPSO and quantum swarm evolutionary(QSE) to prove its advantages. The experiments show that the results given by BPSO-HD is reliable and better than the results generated by BPSO and QSE.展开更多
The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk...The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk. It is shown that Uf is a compact, polynomially convex subset of the complex plane C unless f is the identity function. In particular, the interior of Uf is simply connected. This fact enables us to apply various versions of the X-lemma for the holomorphic family z（f（z）/z）c of injections parametrized over the interior of Uf. The necessary or sufficient conditions for Uf to contain 0 or 1 as an interior point are also given.展开更多
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.展开更多
文摘A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial particles was designed to ensure the reasonable initial fitness, and then, the dynamically dimensionality cutting of dataset was built to decrease the search space. Based on four high-dimensional datasets, BPSO-HD was compared with Apriori to test its reliability, and was compared with the ordinary BPSO and quantum swarm evolutionary(QSE) to prove its advantages. The experiments show that the results given by BPSO-HD is reliable and better than the results generated by BPSO and QSE.
基金Project supported by Yeungnam University(2011)(No.211A380226)the JSPS Grant-in-Aid forScientific Research(B)(No.22340025)
文摘The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk. It is shown that Uf is a compact, polynomially convex subset of the complex plane C unless f is the identity function. In particular, the interior of Uf is simply connected. This fact enables us to apply various versions of the X-lemma for the holomorphic family z（f（z）/z）c of injections parametrized over the interior of Uf. The necessary or sufficient conditions for Uf to contain 0 or 1 as an interior point are also given.
基金supported by National Natural Science Foundation of China(Grant No.11161034)
文摘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.
