Lihua Li

Hebei University of Science and Technology, Ch’in-huang-tao, Hebei, China

Are you Lihua Li?

Claim your profile

Publications (9)11.15 Total impact

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Gene/protein recognition and normalization is an important preliminary step for many biological text mining tasks. In this paper, we present a multistage gene normalization system which consists of four major subtasks: pre-processing, dictionary matching, ambiguity resolution and filtering. For the first subtask, we apply the gene mention tagger developed in our earlier work, which achieves an F-score of 88.42% on the BioCreative II GM testing set. In the stage of dictionary matching, the exact matching and approximate matching between gene names and the EntrezGene lexicon have been combined. For the ambiguity resolution subtask, we propose a semantic similarity disambiguation method based on Munkres' Assignment Algorithm. At the last step, a filter based on Wikipedia has been built to remove the false positives. Experimental results show that the presented system can achieve an F-score of 90.1%, outperforming most of the state-of-the-art systems.
    PLoS ONE 01/2013; 8(12):e81956. · 3.53 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we discuss three modified Halpern iterations as follows: x n+1 =α n u+(1-α n )((1-δ)x n +δTx n ),(I) x n+1 =α n ((1-δ)u+δx n )+(1-α n )Tx n ,( II ) x n+1 =α n u+β n x n +y n Tx n ,n≥0,( III ) and obtained strong convergence results for the iterations (I)–(III) for a k-strictly pseudocontractive mapping, where {α n } satisfies the conditions: (C1) lim n→∞ α n =0 and (C2) ∑ n=1 ∞ α n =+∞, respectively. The results presented in this work improve the corresponding ones by many other authors.
    Journal of Inequalities and Applications 01/2013; 2013. · 0.82 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we introduce iterative schemes based on the extragradient method for finding a common element of the set of solutions of a generalized mixed equilibrium problem and the set of fixed points of a nonexpansive mapping, and the set of solutions of a variational inequality problem for inverse strongly monotone mapping. We obtain some strong convergence theorems for the sequences generated by these processes in Hilbert spaces. The results in this paper generalize, extend and unify some well-known convergence theorems in literature.
    Fixed Point Theory and Applications 01/2013; 2013. · 1.87 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, under the framework of real reflexive Banach space which admits a weakly sequentially continuous duality mapping from E to E∗, we study the strong convergence of an implicit and an explicit composite viscosity approximation algorithm (I) and (II), respectively for a pseudocontractive mapping T by using the weakly contractive mapping f as follows: (I)xt,s=tf(xt,s)+(1−t)yt,syt,s=sxt,s+(1−s)Txt,s and (II)xn+1=αnf(xn)+(1−αn)yn,yn=βnxn+(1−βn)Txn,n≥0. Our results unify, improve and complement several recent ones existing in the current literature.
    Nonlinear Analysis 01/2011; 74(4):1031-1039. · 1.64 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In real reflexive separable Banach space which admits a weakly sequentially continuous duality mapping, the sufficient and necessary conditions that nonexpansive random self-mapping has a random fixed point are obtained. By introducing a random iteration process with weak contraction random operator, we obtain a convergence theorem of the random iteration process to a random fixed point for nonexpansive random self-mappings.
    Journal of Inequalities and Applications 11/2010; 2012(1). · 0.82 Impact Factor
  • Suhong Li, Lihua Li, Yongfu Su
    [Show abstract] [Hide abstract]
    ABSTRACT: Let H be a Hilbert space and f a fixed contractive mapping with coefficient 0<α<1, A a strongly positive linear bounded operator with coefficient . Consider two iterative methods that generate the sequences {xn},{yn} by the algorithm, respectively. (I)(II) where {αn} and {tn} are two sequences satisfying certain conditions, and ℑ={T(s):s≥0} is a one-parameter nonexpansive semigroup on H. It is proved that the sequences {xn},{yn} generated by the iterative method (I) and (II), respectively, converge strongly to a common fixed point x∗∈F(ℑ) which solves the variational inequality
    Nonlinear Analysis 01/2009; · 1.64 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: According to the characteristics of transliterated names in Chinese texts, a method of automatic recognition of Chinese transliterated names combining support vector machines (SVMs) with rules is proposed. The attributes of feature vectors based on characters are extracted. A training set is established and the machine learning models of automatic identification of transliterated names are obtained by testing polynomial Kernel functions; the knowledge cannot be acquired completely if we only use the machine learning model, which will affect the recall. Through careful error analysis, the base of recognition-rules is constructed as post-processing steps to overcome the shortcoming of machine learning model. The results show that the method is efficient for identifying transliterated names from Chinese texts
    Neural Networks and Brain, 2005. ICNN&B '05. International Conference on; 11/2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a method of processing Chinese syntactic category ambiguity with support vector machines (SVMs): extracting the word itself, candidate part-of-speech (POS) tags, the pair of candidate POS tags and their probability and context information as the features of the word vector. A training set is established. The machine learning models of disambiguation based on support vector machines are obtained using polynomial kernel functions. The testing results show that this method is efficient. The paper also gives the results obtained with neural networks for comparison.
    Advances in Neural Networks - ISNN 2005, Second International Symposium on Neural Networks, Chongqing, China, May 30 - June 1, 2005, Proceedings, Part II; 01/2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we introduce both explicit and implicit schemes for finding a common element in the common fixed point set of a one-parameter nonexpansive semigroup {T(s)|0 ≤ s < ∞} and in the solution set of an equilibrium problems which is a solution of a certain optimization problem related to a strongly positive bounded linear operator. Strong convergence theorems are established in the framework of Hilbert spaces. As an application, we consider the optimization problem of a k-strict pseudocontraction mapping. The results presented improve and extend the corresponding results of many others. 2000 AMS Subject Classification: 47H09; 47J05; 47J20; 47J25.
    Journal of Inequalities and Applications 2012(1). · 0.82 Impact Factor