• Title/Summary/Keyword: 색인 모델

Search Result 486, Processing Time 0.025 seconds

Retrieval-based Chat Model using Index-Term Normalization and Answer Filtering (색인어 정규화 및 응답 필터링을 이용한 검색기반 채팅 모델)

  • Lee, Hyeon-gu;Kim, Minkyoung;Kim, Jintae;Kim, Harksoo;Lee, Yeonsoo;Choi, Maengsik
    • 한국어정보학회:학술대회논문집
    • /
    • 2017.10a
    • /
    • pp.197-200
    • /
    • 2017
  • 채팅 모델은 인간과 컴퓨터가 신변잡기 대화를 나눌 수 있게 해주는 시스템으로 빠른 속도로 발전하는 인공지능 음성언어 비서 시스템에 필수적으로 사용되는 기술이다. 본 논문에서는 검색기반 채팅 모델에서 발생하는 검색 효율 문제와 정확하지 못한 답변을 출력하는 문제를 해결하기 위해 색인어 정규화와 응답 필터링이 적용된 검색기반 채팅 모델을 제안한다. 색인어 정규화를 통해 99.3%의 색인 커버리지를 확보하였으며 필터링 모델을 통해 기존 검색 모델에서보다 향상된 사용자 만족도를 얻었다.

  • PDF

A study on the XML Indexing model for Efficient Retrieval (XML의 RDB로의 맵핑과 효율적인 검색을 위한 색인 모델)

  • 김태희;김선경
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2004.06a
    • /
    • pp.55-60
    • /
    • 2004
  • XML 문서의 관계형 데이터베이스로의 맵핑과. 데이터베이스의 성능을 향상시키기 위한 방안으로 내용질의와 함께 XML 문서의 특성을 활용한 구조 검색 질의를 하기 위한 효율적인 색인 모델을 제안한다. 내용 색인과 구조 색인, 애트리뷰트 색인을 각각 구성하여 내용과 구조가 혼합된 효율적인 검색이 가능하도록 하였다. 검색의 효율성을 위해 노드 간의 위치 정보와 함께 독립적인 ID를 부여하여 경로테이블을 생성하여 질의의 효율을 높인다.

  • PDF

Chromatic adaptation model for the variations of the luminance of the same chromaticity illuminants (동일 색도 광원의 휘도 변화에 따른 색 순응 모델)

  • Kim Eun-Su;Jang Soo-Wook;Lee Sung-Hak;Sohng Kyu-lk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.31-38
    • /
    • 2005
  • In this paper, we propose the chromatic adaptation models (CAM) for the variations of the luminance levels. A chromatic adaptation model, CAM$\Delta$Y , is proposed according to the change of luminance level under the same illuminants. The proposed model is obtained by the transform the test colors of the high luminance into the corresponding colors of the low luminance. In the proposed model, the optimal coefficients are obtained from the corresponding colors data of the Breneman's experiments. In the experimental results, we confined that the chromaticity errors, $\Delta$u'v', between the predicted colors by the proposed model and the corresponding colors of the Breneman's experiments are 0.004 in u'v' chromaticity coordinates. The prediction performance of the proposed model is excellent because this error is the threshold value that two adjacent color patches can be distinguished. Additionally, we also propose equal-whiteness CCT curves (EWCs) by CAM$\Delta$Y according to the luminance levels of the surround viewing conditions. And the proposed EWCs can be used as the theoretical standard which determines the reference white of the color display devices.

Cost Model of Index Structures for Moving Objects Databases (이동체 데이터베이스를 위한 색인 구조의 비용모델)

  • Jun, Bong-Gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.3
    • /
    • pp.523-531
    • /
    • 2007
  • In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree.

Design of a QA System based on Information Retrieval (정보검색기반 질의응답 시스템 설계)

  • Kim, MinKyoung;Ahn, HyeokJu;Kim, Harksoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.816-818
    • /
    • 2015
  • 본 논문에서는 질의유형을 통한 검색기반 질의응답 시스템을 구현하기 위한 설계방법을 제안한다. 이를 위해 위키피디아 문서의 링크 데이터를 이용하여 색인 대상문서와 데이터베이스를 구축하는 색인 모델과 2-포아송 모델을 이용하여 얻은 문서들을 색인 데이터베이스를 통해 필터링하여 정답 후보문장을 추출하는 검색모델, 키워드 패턴 매칭 기반 질의유형 분류 모델을 설계하였다.

Indexing Method for Constraint Moving Objects Using Road Connectivity (도로의 연결성을 이용한 제약적 이동 객체에 대한 색인 기법)

  • Bok, Kyoung-Soo;Yoon, Ho-Won;Seo, Dong-Min;Rho, Jin-Seok;Cho, Ki-Hyung;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.7
    • /
    • pp.1-10
    • /
    • 2007
  • In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

Efficient 3D Model Retrieval using Discriminant Analysis (판별분석을 이용한 효율적인 3차원 모델 검색)

  • Song, Ju-Whan;Choi, Seong-Hee;Gwun, Ou-Bong
    • 전자공학회논문지 IE
    • /
    • v.45 no.2
    • /
    • pp.34-39
    • /
    • 2008
  • This study established the efficient system that retrieves the 3D model by using a statistical technique called the function of discriminant analysis. This method was suggested to search index, which was formed by the statistics of 128 feature vectors including those scope, minimum value, average, standard deviation, skewness and scale. All of these were sampled with Osada's D2 method and the statistics as a factor effecting a change turned the value of discriminant analytic function into that of index. Through the primary retrieval on the model of query, the class above the top 2% was drawn out by comparing the query with the index of previously saved class from the group of same models. This method was proved an efficient retrieval technique that saved its procedural time. It shortened the retrieval time for 3D model by 57% faster than the existing Osada's method, and the precision that similar models were found in the first place was recorded 0.362, which revealed it more efficient by 44.8%.

Neutral point model of HVS for the Illuminant-adaptive White Balance Control of Displays (조명 적응 디스플레이 화이트 밸런스 조정을 위한 시각의 순응 화이트 모델)

  • Chae, Seok-Min;Lee, Sung-Hak;Lee, Myoung-Hwa;Sohng, Kyu-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.674-683
    • /
    • 2010
  • For the purpose of color reproduction under standard viewing conditions, recently, color display devices have developed for the colorimetric color reproduction. However the real viewing condition of color display devices is quite different from that. Therefore, it is very important for reproduced colors viewed under real conditions to match the color appearance under standard situations. There are various models that can be used to reproduce corresponding colors considering the chromatic adaptation of the human visual system. However neutral point or chromatic adaptation for the luminance level is not enough. In this paper, we propose a model that find adapting white points for the variations of the luminance levels under the same illuminant. This model is modeled by the proportion of Euclidian distance for luminance level. It is the adapting white function of the sigmoid type for surround luminance level. In the model, the optimal coefficients are obtained from the Hunt's experimental result. It is applied in the chromatic adaptation model using the neutral point of the various viewing conditions. And the neutral point can be used as the theoretical standard which determines the reference white of the color display devices.

A Cyclic Sliced Partitioning Method for Packing High-dimensional Data (고차원 데이타 패킹을 위한 주기적 편중 분할 방법)

  • 김태완;이기준
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.122-131
    • /
    • 2004
  • Traditional works on indexing have been suggested for low dimensional data under dynamic environments. But recent database applications require efficient processing of huge sire of high dimensional data under static environments. Thus many indexing strategies suggested especially in partitioning ones do not adapt to these new environments. In our study, we point out these facts and propose a new partitioning strategy, which complies with new applications' requirements and is derived from analysis. As a preliminary step to propose our method, we apply a packing technique on the one hand and exploit observations on the Minkowski-sum cost model on the other, under uniform data distribution. Observations predict that unbalanced partitioning strategy may be more query-efficient than balanced partitioning strategy for high dimensional data. Thus we propose our method, called CSP (Cyclic Spliced Partitioning method). Analysis on this method explicitly suggests metrics on how to partition high dimensional data. By the cost model, simulations, and experiments, we show excellent performance of our method over balanced strategy. By experimental studies on other indices and packing methods, we also show the superiority of our method.

Retrieval System Using Term Reweighting (용어 가중치 재 산정을 이용한 검색 시스템)

  • 황선욱;김혜정;손기준;이상조
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.160-162
    • /
    • 2003
  • 색인 파일은 정보 검색 시스템에서 중요한 구성 요소 중에 하나이다. 스테밍을 하여 색인 파일을 구성하게 되면 파일의 크기를 줄일 수 있고 재현율을 높이는데 효과적이다. 하지만, 과도한 스테밍으로 구성이론. 색인 파일은 원형에 대한 데이터 손실을 가지고 오기 때문에 너무 많은 문서가 검색되어 사용자가 문서를 찾는데 많은 시간이 소요되고 정확률도 떨어진다. 본 논문에서는 정보 검색 시스템에서 검색의 효율성을 높이기 위해 사용하는 색인 파일을 스테밍 한 것과 스테밍 하지 않은 파일로 구성하였다. 스테밍 한 색인 파일은 질의어와 문서 사이의 유사도를 계산하기 위하여 이용되며, 스테밍 하지 않은 파일은 스테밍 했을 때 검색된 문서들 중에서 데이터 손실로 인한 잘 못된 문서 순서를 재조정해 주기 위하여 이용된다. 본 논문에서는 높은 검색 효과를 제공하는 기존의 벡터 공간 모델을 검색 성능 평가 척도 중의 하나인 R-정확률을 이용하여 비교 평가하였다. 본 논문에서 제안하는 시스템이 문서 상위 100위까지에 대하여 일반 벡터 모델 보다 최고 21%의 좋은 성능을 보였다.

  • PDF