This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information ...This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.展开更多
This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorizati...This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorization by total variation constraint and graph regularization.The main contributions of our work are the following.First,total variation is incorporated into NMF to control the diffusion speed.The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information.Second,we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power.Third,the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given.Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.展开更多
Since requirement dependency extraction is a cognitively challenging and error-prone task,this paper proposes an automatic requirement dependency extraction method based on integrated active learning strategies.In thi...Since requirement dependency extraction is a cognitively challenging and error-prone task,this paper proposes an automatic requirement dependency extraction method based on integrated active learning strategies.In this paper,the coefficient of variation method was used to determine the corresponding weight of the impact factors from three different angles:uncertainty probability,text similarity difference degree and active learning variant prediction divergence degree.By combining the three factors with the proposed calculation formula to measure the information value of dependency pairs,the top K dependency pairs with the highest comprehensive evaluation value are selected as the optimal samples.As the optimal samples are continuously added into the initial training set,the performance of the active learning model using different dependency features for requirement dependency extraction is rapidly improved.Therefore,compared with other active learning strategies,a higher evaluation measure of requirement dependency extraction can be achieved by using the same number of samples.Finally,the proposed method using the PV-DM dependency feature improves the weight-F1 by 2.71%,the weight-recall by 2.45%,and the weight-precision by 2.64%in comparison with other strategies,saving approximately 46%of the labelled data compared with the machine learning approach.展开更多
基金supported by the National Natural Science Foundation of China(61702251,61363049,11571011)the State Scholarship Fund of China Scholarship Council(CSC)(201708360040)+3 种基金the Natural Science Foundation of Jiangxi Province(20161BAB212033)the Natural Science Basic Research Plan in Shaanxi Province of China(2018JM6030)the Doctor Scientific Research Starting Foundation of Northwest University(338050050)Youth Academic Talent Support Program of Northwest University
文摘This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.
基金supported by the National Natural Science Foundation of China(61702251,41971424,61701191,U1605254)the Natural Science Basic Research Plan in Shaanxi Province of China(2018JM6030)+4 种基金the Key Technical Project of Fujian Province(2017H6015)the Science and Technology Project of Xiamen(3502Z20183032)the Doctor Scientific Research Starting Foundation of Northwest University(338050050)Youth Academic Talent Support Program of Northwest University(360051900151)the Natural Sciences and Engineering Research Council of Canada,Canada。
文摘This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorization by total variation constraint and graph regularization.The main contributions of our work are the following.First,total variation is incorporated into NMF to control the diffusion speed.The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information.Second,we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power.Third,the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given.Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.
基金supported by the Scientific Research Funding Project of Education Department of Liaoning Province 2021,China(No.LJKZ0434).
文摘Since requirement dependency extraction is a cognitively challenging and error-prone task,this paper proposes an automatic requirement dependency extraction method based on integrated active learning strategies.In this paper,the coefficient of variation method was used to determine the corresponding weight of the impact factors from three different angles:uncertainty probability,text similarity difference degree and active learning variant prediction divergence degree.By combining the three factors with the proposed calculation formula to measure the information value of dependency pairs,the top K dependency pairs with the highest comprehensive evaluation value are selected as the optimal samples.As the optimal samples are continuously added into the initial training set,the performance of the active learning model using different dependency features for requirement dependency extraction is rapidly improved.Therefore,compared with other active learning strategies,a higher evaluation measure of requirement dependency extraction can be achieved by using the same number of samples.Finally,the proposed method using the PV-DM dependency feature improves the weight-F1 by 2.71%,the weight-recall by 2.45%,and the weight-precision by 2.64%in comparison with other strategies,saving approximately 46%of the labelled data compared with the machine learning approach.
