• 디지털콘텐츠학회 논문지
• /
• 제13권3호
• /
• pp.451-457
• /
• 2012

최근, ITS(Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 실시간 교통 정보를 이용하는 수요가 급증하면서, 경로탐색의 중요성이 더욱 가속화되고 있다. 그러나 기존의 경로탐색 알고리즘의 대부분은 최단경로 탐색을 위한 알고리즘으로, 정적인 거리 및 운행 시간정보를 사용하여 최적 경로를 계산하여 운전자에게 제공하기 때문에 교통량에 따라 동적으로 변하는 현 시점에서의 최적의 경로를 제공하지 못하는 문제가 있다. 따라서 본 논문에서는 이를 해결하기 위해 감속률과 거리에 기반한 동적 경로 선정을 위한 의미적 최단거리 알고리즘(Semantic Shortest Path algorithm with Reduction ratio & Distance, SSP_RD)과 감속률과 거리에 기반한 이동 경로 예측 모형화 및 동적 이동 경로 링크 맵을 제안한다.

• 지능정보연구
• /
• 제19권1호
• /
• pp.111-123
• /
• 2013

개념간의 의미적 유사도 및 관계도(Semantic Similarity/Relatedness)를 구하는 연구는 고전적인 연구에서는 데이터 베이스 통합이나 시스템 통합, 그리고 현대의 연구에 있어서는 태그 및 키워드 추출, 연관 단어 추천 등에 걸쳐 다양한 분야에서 활용되어 온 연구이다. 그 연구는 역사가 오래되었을 뿐만 아니라, 경영정보와 컴퓨터 공학, 계산 언어학에 걸쳐 여러 분야에서도 많은 관심을 가져왔던 연구 분야라고 할 수 있다. 그러나, 지금까지의 개념간의 관계도 계산 방식은 미리 만들어진 사전이나 참조할 수 있는 다른 시맨틱 네트워크(Semantic Network)를 이용하여 계산하는 방법이 주를 이루었다. 이러한 접근 방법의 경우, 개념간의 의미적 관계가 변화에 대한 가능성을 고려하지 않는 것이 일반적이다. 하지만, 정보 기술의 발달과 빠른 사회변화는 개념간의 의미관계 등에 변화를 가져오고 있는 것이 현실이다. 사회적으로 일어나는 사건이나, 문화적 변화 등이 개념간의 의미관계를 변화시키는 것을 물론이며, 이러한 변화가 정보 통신 기술의 도움으로 빠르게 공유되고 있다. 이렇게 개념간의 의미 관계가 시간이나 맥락에 따라 빠르게 변화할 수 있는 가능성이 있음에도 불구하고, 기존의 개념간 의미적 유사도 및 관계도에 대한 연구들은 이러한 '의미관계의 변화'에 대한 새로운 문제에 대해 해답을 제시하지 못한 것이 사실이다. 따라서, 본 연구에서는 개념간의 유사도 연구에 있어 지금까지 있어왔던 '정적인 의미간 관계도 패러다임'에서 '동적인 의미간 관계도 패러다임'으로의 전환의 필요성과 그 당위성을 인지 의미론적(Cognitive Semantics)의 관점에서 역설하고자 한다. 인간이 인지하는 개념간의 의미관계가 변화할 수 있는 이론적 근거를 인지 의미론에서 찾아봄으로써, 패러다임 변화의 방향을 구체적으로 제시하였다. 또한 이러한 패러다임의 변화에 맞추어 개념간의 의미적 유사도 및 관계도에 대한 연구가 어떠한 방향으로 나아가야 할지 구체적인 연구 방향을 제시함으로써 관련 연구자들에게 새로운 연구의 가이드라인을 제시하였다.

• 한국CDE학회논문집
• /
• 제14권3호
• /
• pp.159-167
• /
• 2009

For the robust exchange of parametric CAD model data, it is very important to perform mapping rightly and accurately between different CAD models. However, data model mapping is usually performed on a case-by-case basis. This results in the problem that mapping quality fluctuates very widely depending on the abilities of developers. In order to solve this problem, the concept of symantic distance is adapted and applied to the translation of parametric CAD model data in order to measure the difference between different CAD models quantitatively in a computer-interpretable form and systematize the mapping process.

• 가정과삶의질연구
• /
• 제11권1호
• /
• pp.159-175
• /
• 1993

The purpose of this study was to find out the psychological distance through semantic app-roach perceived by adolescent child in the subtypes of 'Extrem Family' dysfunctional families by classification of Olson and his associates ' Circrumplex Model. The subjects of this research were 1072 abolescents living in Seoul. Korea The survey methods were questionnaires including FACES II and The Psychological Distance Scale. Data were analyzed by means of the statistics of frequency percentage arithematic mean standard devia-tion crosstabs and one way-anova. The major findings are as follows: 1) The levels of family cohesion family adaptibility and the psychologival distances with father mother and siblings perceived by adolescent were high. 2) The most of subject's families belonged to 'Balanced Family' in the types of family system ' Extreme Family' type showed the lowest frequency and the main subtypes of it that had the highest frequency were 'Enmeshed Chaotic Family' ' Disengaged Rigid Family' 3) While adolescents of 'Enmeshed Chaotic Family' perceived most closely with other family members. those of 'Disengated Rigid Family' most distantly totally and in evaluation potency and activity three subfactors in psychological distance. 4) There were differences of unit points in subfactors of psychological distances with other family members perceived by adolescents according to the types of family system. While the points of 'Enmeshed Chaotic Family' were the highest those of 'Disengaged Rigid Family' were the lowest. 5) While 'Enmeshed Chaotic Family' were located most closely 'Disengaged Rigid Family' were located most distantly in the mutual distances and direct distances among family concepts on semantic space.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제1권1호
• /
• pp.31-42
• /
• 2012

현재까지 대부분의 한국어처리시스템에서는 가급적 많은 접미파생명사를 사전에 등재하여 처리하였다. 그러나 접미사는 생산성이 높기 때문에 모든 접미파생명사를 사전에 등재하는 것은 한계가 있다. 따라서 접미파생명사의 의미 분석을 통해서 미등재 접미파생명사를 분석할 필요가 있다. 본 논문에서는 접미파생명사의 의미 분석의 일환으로 한국어 어휘의미망(U-WIN)을 이용한 동형이의어 접미사의 중의성 해소 방법을 제시한다. 형태 의미 주석 세종 말뭉치에서 동형이의어 접미사를 포함한 33,104개의 접미파생명사를 대상으로 실험하였다. 실험을 위해 먼저 동형이의어 접미사를 의미 태깅하였으며, 접미사 앞의 어근을 추출하여 U-WIN의 노드에 매핑시켰다. 또한 동형이의어 접미사와 결합되는 U-WIN 상의 노드들에 대해 거리 가중치를 부여하여 이를 동형이의어 접미사 중의성 해소에 사용하였다. 동형이의어 접미사 49종 중 세종말뭉치에 나타난 35개의 동형이의어 접미사를 대상으로 실험한 결과 91.01%의 정확률을 보였다.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3399-3409
• /
• 1999

Information filtering for internet search, in which new information retrieval environment is given, is different from traditional methods such as bibliography information filtering, news-group and E-mail filtering. Therefore, we cannot expect high performance from the traditional information filtering models when they are applied to the new environment. To solve this problem, we inspect the characteristics of the new filtering environment, and propose a semantic-based filtering model which includes a new filtering method using WordNet. For extracting keywords from documents, this model uses the SDCC(Semantic Distance for Common Category) algorithm instead of the TF/IDF method usually used by traditional methods. The world sense ambiguation problem, which is one of causes dropping efficiency of internet search, is solved by this method. The semantic-based filtering model can filter web pages selectively with considering a user level and we show in this paper that it is more convenient for users to search information in internet by the proposed method than by traditional filtering methods.

• Asia pacific journal of information systems
• /
• 제18권1호
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• Journal of Information Processing Systems
• /
• 제16권1호
• /
• pp.184-200
• /
• 2020

Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.

• 대한건축학회논문집:계획계
• /
• 제35권7호
• /
• pp.101-108
• /
• 2019

In this research, I conducted a semantic network analysis centering on media articles on purchasing, revitalizing, and utilizing the former Busan branch of Hansung Bank, a modern architectural heritage. We sought the most efficient analysis elements for the analysis of the social arguments about preservation and utilization embedded in media articles. For this reason, Degree Centrality measures how many connections the word described in the media article has, and Betweenness Centrality measures the influence that controls the flow of information through correlation I examined. In addition, keyword that express the theme well examined the aggregation structure in each sub-network. In this research, in theoretical terms, it makes sense in that the social discussion embedded in the article of the mass media is grasped empirically through semantic network analysis of words. Methodological aspect is best when it includes nouns and adjectives and the distance between words is more than four words in the analysis of the cohesive structure of the semantic network to determine whether the influence of social discussions is best assessed through the connection between words to media articles.

• 정보처리학회논문지B
• /
• 제12B권7호
• /
• pp.829-840
• /
• 2005

단어 의미 중의성 해소는 자연언어처리 분야에 매우 중요한 부분이다. 본 논문에서는 사전 뜻풀이 특성을 이용해 기존의 의미정보를 정제하고 유용한 정보인 확률정보, 거리정보 및 격정보 등을 추가한 WSD 모델을 제안하였으며, 사전을 기반으로 구축된 "울산대학교 어휘 지능망(UOU-Word Intelligent Network: U-WIN)" 상의 단어 계층적 구조(시소러스)를 이용하여 의미정보의 자료 부족 문제를 해소하는 모델을 제시하였"다. "21세기 세종 계획"에서 제공하는 150만 어절 규모의 의미 태그 말뭉치를 대상으로 한 실험에서 최다 빈도 의미 결정(Maximum Frequence Class, MFC, 정확률 베이스라인)에 비해 $18.97\%$(명사 $21.73\%$, 동사 $17.11\%$) 정확률 향상을 보였으며, 기존의 확률 가중치와 어절 거리 가중치를 이용한 모델에 비해서는 $10.49\%$(명사 $8.84\%$, 동사 $11.51\%$)의 정확률 향상되었다. 또한 시소러스를 사용하지 않고 확률정보, 거리정보, 격정보 만을 이용한 모델에 비해 $6.12\%$(명사 $5.29\%$, 동사 $6.64\%$) 높은 정확률을 보였다.