Gastric cancer remains the second leading cause of cancer death worldwide. About half of the incidence of gastric cancer is observed in East Asian countries, which show a higher mortality than other countries. The eff...Gastric cancer remains the second leading cause of cancer death worldwide. About half of the incidence of gastric cancer is observed in East Asian countries, which show a higher mortality than other countries. The effectiveness of 3 new gastric cancer screening techniques, namely, upper gastrointestinal endoscopy, serological testing, and “screen and treat” method were extensively reviewed. Moreover, the phases of development for cancer screening were analyzed on the basis of the biomarker development road map. Several observational studies have reported the effectiveness of endoscopic screening in reducing mortality from gastric cancer. On the other hand, serologic testing has mainly been used for targeting the high-risk group for gastric cancer. To date, the effectiveness of new techniques for gastric cancer screening has remained limited. However, endoscopic screening is presently in the last trial phase of development before their introduction to population-based screening. To effectively introduce new techniques for gastric cancer screening in a community, incidence and mortality reduction from gastric cancer must be initially and thoroughly evaluated by conducting reliable studies. In addition to effectiveness evaluation, the balance of benefits and harms must be carefully assessed before introducing these new techniques for population-based screening.展开更多
In the quotient space theory of granular computing,the universe structure is assumed to be a topology,therefore,its application is still limited.In this study,based on the quotient space model,the universe structure i...In the quotient space theory of granular computing,the universe structure is assumed to be a topology,therefore,its application is still limited.In this study,based on the quotient space model,the universe structure is assumed as an algebra instead of a topology.As to obtain the algebraic quotient operator,the granulation must be uniquely determined by a congruence relation,and all the congruence relations form a complete semi-order lattice,which is the theoretical basis of granularities ' completeness.When the given equivalence relation is not a congruence relation,it defines the concepts of upper quotient and lower quotient,and discusses some of their properties which demonstrate that falsity preserving principle and truth preserving principle are still valid.Finally,it presents the algorithms and example of upper quotient and lower quotient.The work extends the quotient space theory from structure,and provides theoretical basis for the combination of the quotient space theory and the algebra theory.展开更多
Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR...Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR） and Sim- Rank （SR） have emerged as the most popular and influen- tial link-based similarity measures. Recently, a novel link- based similarity measure, penetrating rank （P-Rank）, which enriches SR, was proposed. In practice, PPR, SR and P-Rank scores are calculated by iterative methods. As the number of iterations increases so does the overhead of the calcula- tion. The ideal solution is that computing similarity within the minimum number of iterations is sufficient to guaran- tee a desired accuracy. However, the existing upper bounds are too coarse to be useful in general. Therefore, we focus on designing an accurate and tight upper bounds for PPR, SR, and P-Rank in the paper. Our upper bounds are designed based on the following intuition： the smaller the difference between the two consecutive iteration steps is, the smaller the difference between the theoretical and iterative similar- ity scores becomes. Furthermore, we demonstrate the effec- tiveness of our upper bounds in the scenario of top-k similar nodes queries, where our upper bounds helps accelerate the speed of the query. We also run a comprehensive set of exper- iments on real world data sets to verify the effectiveness and efficiency of our upper bounds.展开更多
基金Supported by Grant-in-Aid for H22-Third Term Comprehensive Control Research for Cancer 022 from the Japanese Ministry of Health,Labour and Welfare
文摘Gastric cancer remains the second leading cause of cancer death worldwide. About half of the incidence of gastric cancer is observed in East Asian countries, which show a higher mortality than other countries. The effectiveness of 3 new gastric cancer screening techniques, namely, upper gastrointestinal endoscopy, serological testing, and “screen and treat” method were extensively reviewed. Moreover, the phases of development for cancer screening were analyzed on the basis of the biomarker development road map. Several observational studies have reported the effectiveness of endoscopic screening in reducing mortality from gastric cancer. On the other hand, serologic testing has mainly been used for targeting the high-risk group for gastric cancer. To date, the effectiveness of new techniques for gastric cancer screening has remained limited. However, endoscopic screening is presently in the last trial phase of development before their introduction to population-based screening. To effectively introduce new techniques for gastric cancer screening in a community, incidence and mortality reduction from gastric cancer must be initially and thoroughly evaluated by conducting reliable studies. In addition to effectiveness evaluation, the balance of benefits and harms must be carefully assessed before introducing these new techniques for population-based screening.
基金Supported by the National Natural Science Foundation of China(No.61173052)the Natural Science Foundation of Hunan Province(No.14JJ4007)
文摘In the quotient space theory of granular computing,the universe structure is assumed to be a topology,therefore,its application is still limited.In this study,based on the quotient space model,the universe structure is assumed as an algebra instead of a topology.As to obtain the algebraic quotient operator,the granulation must be uniquely determined by a congruence relation,and all the congruence relations form a complete semi-order lattice,which is the theoretical basis of granularities ' completeness.When the given equivalence relation is not a congruence relation,it defines the concepts of upper quotient and lower quotient,and discusses some of their properties which demonstrate that falsity preserving principle and truth preserving principle are still valid.Finally,it presents the algorithms and example of upper quotient and lower quotient.The work extends the quotient space theory from structure,and provides theoretical basis for the combination of the quotient space theory and the algebra theory.
文摘Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR） and Sim- Rank （SR） have emerged as the most popular and influen- tial link-based similarity measures. Recently, a novel link- based similarity measure, penetrating rank （P-Rank）, which enriches SR, was proposed. In practice, PPR, SR and P-Rank scores are calculated by iterative methods. As the number of iterations increases so does the overhead of the calcula- tion. The ideal solution is that computing similarity within the minimum number of iterations is sufficient to guaran- tee a desired accuracy. However, the existing upper bounds are too coarse to be useful in general. Therefore, we focus on designing an accurate and tight upper bounds for PPR, SR, and P-Rank in the paper. Our upper bounds are designed based on the following intuition： the smaller the difference between the two consecutive iteration steps is, the smaller the difference between the theoretical and iterative similar- ity scores becomes. Furthermore, we demonstrate the effec- tiveness of our upper bounds in the scenario of top-k similar nodes queries, where our upper bounds helps accelerate the speed of the query. We also run a comprehensive set of exper- iments on real world data sets to verify the effectiveness and efficiency of our upper bounds.
