• Title/Summary/Keyword: Linking Methods

Search Result 348, Processing Time 0.025 seconds

A Study Analyzing Reference Linking Service in Digital Libraries

  • Noh, Younghee;Ladd, Patricia R.;Na, Kyoungsik
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.5 no.1
    • /
    • pp.69-88
    • /
    • 2015
  • This study seeks to present an option for including a variety of information resources in a reference linking service system. Discussion on reference linking service in journals began in 1999 and applied to real systems, but linking to research papers and patent registers has more recently emerged. This study further suggests that system construction include various information resources such as books and dissertations. This paper also presents principles and prerequisites that should be considered essential when building such systems, including expansion of resources and media formats, development of identifiers on every sort of information resource, linking methods to existing DB, publication revolution and managing copyright-holders, use and improvement of OPACs, and building perfect authority DB.

Korean Standard Classification of Functioning, Disability and Health (KCF) Code Linking on Natural Language with Extract Algorithm (자연어 알고리즘을 활용한 한국표준건강분류(KCF) 코드 검색)

  • Nyeon-Sik Choi;Ju-Min Song
    • Journal of the Korean Society of Physical Medicine
    • /
    • v.18 no.1
    • /
    • pp.77-86
    • /
    • 2023
  • PURPOSE: This study developed an experimental algorithm, which is similar or identical to semantic linking for KCF codes, even if it converted existing semantic code linking methods to morphological code extraction methods. The purpose of this study was to verify the applicability of the system. METHODS: An experimental algorithm was developed as a morphological extraction method using code-specific words in the KCF code descriptions. The algorithm was designed in five stages that extracted KCF code using natural language paragraphs. For verification, 80 clinical natural language experimental cases were defined. Data acquisition for the study was conducted with the deliberation and approval of the bioethics committee of the relevant institution. Each case was linked by experts and was extracted through the System. The linking accuracy index model was used to compare the KCF code linking by experts with those extracted from the system. RESULTS: The accuracy was checked using the linking accuracy index model for each case. The analysis was divided into five sections using the accuracy range. The section with less than 25% was compared; the first experimental accuracy was 61.24%. In the second, the accuracy was 42.50%. The accuracy was improved to 30.59% in the section by only a weight adjustment. The accuracy can be improved by adjusting several independent variables applied to the system. CONCLUSION: This paper suggested and verified a way to easily extract and utilize KCF codes even if they are not experts. KCF requires the system for utilization, and additional study will be needed.

Measuring the Positional Accuracy of GIS Polygon Data (GIS 폴리곤 데이터의 위치정확도 측정 방법)

  • Hong, Sung-Eon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.14 no.4 s.38
    • /
    • pp.3-10
    • /
    • 2006
  • This study proposes a method to measure the positional accuracy of the implemented GIS polygon data. Also, it aims to present a possibility to analyze the occurrence types of positional errors by improving the measuring methods of positional accuracy based on the existing individual methods and by linking individual methods. As a result of the actual application of the methodology to the test area, it was possible to measure the positional accuracy in target test areas and to analyze the occurrence causes (types) of positional errors through each index linking (linking methodologies). Also, research results allowed confirming the applicability of the methodology. However, complementary research for each standard numerical value is recommended in order to ensure the validity of methodology.

  • PDF

Tweet Entity Linking Method based on User Similarity for Entity Disambiguation (개체 중의성 해소를 위한 사용자 유사도 기반의 트윗 개체 링킹 기법)

  • Kim, SeoHyun;Seo, YoungDuk;Baik, Doo-Kwon
    • Journal of KIISE
    • /
    • v.43 no.9
    • /
    • pp.1043-1051
    • /
    • 2016
  • Web based entity linking cannot be applied in tweet entity linking because twitter documents are shorter in comparison to web documents. Therefore, tweet entity linking uses the information of users or groups. However, data sparseness problem is occurred due to the users with the inadequate number of twitter experience data; in addition, a negative impact on the accuracy of the linking result for users is possible when using the information of unrelated groups. To solve the data sparseness problem, we consider three features including the meanings from single tweets, the users' own tweet set and the sets of other users' tweets. Furthermore, we improve the performance and the accuracy of the tweet entity linking by assigning a weight to the information of users with a high similarity. Through a comparative experiment using actual twitter data, we verify that the proposed tweet entity linking has higher performance and accuracy than existing methods, and has a correlation with solving the data sparseness problem and improved linking accuracy for use of information of high similarity users.

A Method to Solve the Entity Linking Ambiguity and NIL Entity Recognition for efficient Entity Linking based on Wikipedia (위키피디아 기반의 효과적인 개체 링킹을 위한 NIL 개체 인식과 개체 연결 중의성 해소 방법)

  • Lee, Hokyung;An, Jaehyun;Yoon, Jeongmin;Bae, Kyoungman;Ko, Youngjoong
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.813-821
    • /
    • 2017
  • Entity Linking find the meaning of an entity mention, which indicate the entity using different expressions, in a user's query by linking the entity mention and the entity in the knowledge base. This task has four challenges, including the difficult knowledge base construction problem, multiple presentation of the entity mention, ambiguity of entity linking, and NIL entity recognition. In this paper, we first construct the entity name dictionary based on Wikipedia to build a knowledge base and solve the multiple presentation problem. We then propose various methods for NIL entity recognition and solve the ambiguity of entity linking by training the support vector machine based on several features, including the similarity of the context, semantic relevance, clue word score, named entity type similarity of the mansion, entity name matching score, and object popularity score. We sequentially use the proposed two methods based on the constructed knowledge base, to obtain the good performance in the entity linking. In the result of the experiment, our system achieved 83.66% and 90.81% F1 score, which is the performance of the NIL entity recognition to solve the ambiguity of the entity linking.

Role of linking parameters in Pulse-Coupled Neural Network for face detection

  • Lim, Young-Wan;Na, Jin-Hee;Choi, Jin-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1048-1052
    • /
    • 2004
  • In this work, we have investigated a role of linking parameter in Pulse-Coupled Neural Network(PCNN) which is suggested to explain the synchronous activities among neurons in the cat cortex. Then we have found a method to determine the linking parameter for a satisfactory face detection performance in a given color image. Face detection algorithm which uses the color information is independent on pose, size and obstruction of a face. But the use of color information encounters some problems arising from skin-tone color in the background, intensity variation within faces, and presence of random noise and so on. Depending on these conditions, PCNN's linking parameters should be selected an appropriate values. First we obtained the mean and variance of the skin-tone colors by experiments. Then, we introduced a preprocess that the pixel with a mean value of skin-tone colors has the highest level value (255) and the other pixels have values between 0 and 255 according to normal distribution with a variance. This preprocessing leads to an easy decision of the linking parameter of the Pulse-Coupled Neural Network. Through experiments, it is verified that the proposed method can improve the face detection performance compared to the existing methods.

  • PDF

Seasonal Adjustment on Chain-Linking (연쇄가중법 도입에 따른 계절변동조정)

  • Jeon, Gyeong-Bae
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.1
    • /
    • pp.41-50
    • /
    • 2009
  • Chain-linking is a method for aggregating volume measures which would improve the quality of estimates of economic growth over the present fixed base in Korea. There is a risk that choice of chain-linking techniques such annual overlap, one-quarter overlap or over-the-year overlap may create an artificial seasonality to the volume series. The empirical results on Korean GDP suggest that the use of the annual overlap is recommended. And conducting seasonal adjustment after chain-linking to produce the chain-linked seasonally adjusted GDP is more appropriated in Korea.

A Linked Analysis Method between Commercial district Information and Survey Information (상권정보와 설문정보의 연계 분석 방법)

  • Lee, Won-Cheol;Kang, Man-Su;Kim, Jinho
    • The Journal of Bigdata
    • /
    • v.5 no.2
    • /
    • pp.29-42
    • /
    • 2020
  • In Korea, micro-enterprises are in charge of an important part of the common people's economy, but face difficulties such as excessive competition, deteriorating profitability, and concentration of life-oriented industries. In order to solve this problem, the government is providing commercial district analysis services for micro-enterprises. However, the data provided by various organizations is not standardized, and there is a limit to the composition of the service with limited data. In this paper, we propose a method of solving the data consistency problem and linking and analyzing between questionnaire information and commercial district information to expand the data analysis service. The proposed linking methods are three methods: linking the commercial area information and questionnaire information in the same area based on the type of business and area, linking the survey information centered on individual micro-enterprise, and linking a small area of questionnaire information with a large area of commercial district information. The linked commercial district information and questionnaire information can be used in various ways or expanded analysis services. This proposed a method to overcome the limitations of existing commercial district analysis services with questionnaire information and lay the foundation for expanding the commercial district analysis services necessary for micro-enterprises.

EXISTENCE OF SOLUTIONS FOR GRADIENT TYPE ELLIPTIC SYSTEMS WITH LINKING METHODS

  • Jin, Yinghua;Choi, Q-Heung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.1
    • /
    • pp.65-70
    • /
    • 2007
  • We study the existence of nontrivial solutions of the Gradient type Dirichlet boundary value problem for elliptic systems of the form $-{\Delta}U(x)={\nabla}F(x,U(x)),x{\in}{\Omega}$, where ${\Omega}{\subset}R^N(N{\geq}1)$ is a bounded regular domain and U = (u, v) : ${\Omega}{\rightarrow}R^2$. To study the system we use the liking theorem on product space.

  • PDF