• Title/Summary/Keyword: 유사도 질의

Search Result 1,858, Processing Time 0.028 seconds

Research Directions for Efficient Query Processing over Sensor Data Streams (센서 데이터 스트림 환경에서 효율적인 질의처리 연구방향)

  • An, Dong-Chan
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.199-204
    • /
    • 2006
  • The sensor network is a wireless network of the sensor nodes which sensing, computation and communication ability. Each sensor nodes create the data items by sensor nodes above one. Like this feature, the sensor network is similar to distributed data base system. The sensor node of the sensor network is restricted from the power and the memory resources is the biggest weak point and is becoming the important research object. In this paper, We try to see efficient sensor data stream management method and efficient query processing method under the restricted sensor network environment.

  • PDF

Optimal Construction of Multiple Indexes for Time-Series Subsequence Matching (시계열 서브시퀀스 매칭을 위한 최적의 다중 인덱스 구성 방안)

  • Lim Seung-Hwan;Park Hee-Jin;Kim Sang-Wook
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.193-195
    • /
    • 2005
  • 서브시퀀스 매칭은 주어진 질의 시퀀스와 변화의 추세가 유사한 서브시퀀스들을 시계열 데이터베이스로부터 검색하는 연산이다. 본 논문에서는 크기 효과로 인한 서브시퀀스 매칭의 심각한 성능 저하 현상을 정량적으로 관찰하여, 하나의 윈도우 크기를 대상으로 만든 단 하나의 인덱스만을 이용하는 것은 실제 응용에서 만족할만한 성능을 제공할 수 없다는 것을 규명하였다. 또한, 이러한 문제로 인해 다양한 윈도우 크기를 기반으로 다수의 인덱스들을 구성하여 서브시퀀스 매칭을 수행하는 인덱스 보간법의 응용이 필요함을 보였다. 인덱스 보간법을 응용하여 서비시퀀스 매칭을 수행하기 위해서는 먼저 다수의 인덱스들을 위한 윈도우 크기들을 결정해야 한다. 본 연구에서는 물리적 데이터베이스 설계방식을 이용하여 이러한 최적의 다수의 윈도우 크기들을 선정하는 문제를 해결하였다. 이를 위하여 시계열 데이터베이스에서 수행될 예정인 질의 시퀀스들의 집합과 인덱스 구성의 기반이 되는 윈도우들의 크기의 집합이 주어질 때, 전체 서브시퀀스 매칭들을 수행하는 데에 소요되는 비용을 예측할 수 있는 공식을 산출하였다. 또한, 이 비용 공식을 이용하여 전체 서브시퀀스 매칭들의 성능을 극대화 할 수 있는 최적의 윈도우 크기들을 결정하는 알고리즘을 제안하였으며, 이 알고리즘의 최적성과 효율성을 이론적으로 규명하였다. 끝으로, 실험에 의한 성능 평가를 제안된 기법의 우수성을 제시하였다.

  • PDF

Visualization Tool for Scaling-Invariant Boundary Image Matching (스케일링-불변 윤곽선 이미지 매칭의 시각화 도구)

  • Moon, Seongwoo;Lee, Sanghun;Kim, Bum-Soo;Moon, Yang-Sae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.683-686
    • /
    • 2015
  • 본 논문에서는 스케일링-불변 윤곽선 이미지 매칭의 시각화 도구를 제안한다. 윤곽선 이미지를 시계열로 나타낼 경우, 시계열 매칭 기술을 활용하여 대용량 윤곽선 이미지 매칭을 보다 빠르게 수행할 수 있다. 이러한 윤곽선 이미지 매칭에서, 스케일링 불변의 지원은 스케일된 유사 이미지를 검색하기 위한 중요한 요소이다. 본 논문에서는 스케일링-불변 윤곽선 이미지 매칭 시스템을 클라이언트-서버 모델을 기반으로 구현한다. 먼저, 클라이언트는 질의 이미지를 시계열로 변환하고, 스케일링 팩터 구간 및 허용치와 함께 서버에 전달하고, 매칭 결과로 반환된 이미지를 차트 형태로 시각화한다. 다음으로 서버는 다차원 인덱스를 활용하여 대용량 윤곽선 시계열 데이터에 대한 빠른 시계열 매칭을 수행한다. 구현 결과, 제안하는 윤곽선 이미지 매칭 시각화 도구는 질의 이미지와 스케일링-불변 결과 이미지를 세 가지의 차트를 통해 직관적으로 비교 및 분석 가능하게 하였다.

Improving Performance of Web Search using The User Preference in Query Word Senses (질의어 의미별 사용자 선호도를 이용한 웹 검색의 성능 향상)

  • 김형일;김준태
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.8
    • /
    • pp.1101-1112
    • /
    • 2004
  • In this paper, we propose a Web page weighting scheme using the user preference in each sense of query word to improve the performance of Web search. Generally search engines assign weights to a web page by using relevancy only, which is obtained by comparing the query word and the words in a web page. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy In this paper we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to senses, so that more accurate search is possible. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

Study on the quality of instruction of two beginning mathematics teachers: Toward the above criteria (두 초임 수학교사의 수업의 질에 대한 연구)

  • Park, Mimi;Kim, Yeon
    • The Mathematical Education
    • /
    • v.61 no.1
    • /
    • pp.179-198
    • /
    • 2022
  • Teaching is delicate, complicated, and demanding work, and especially beginning teachers set forth their difficulties in preparing and implementing mathematics instruction. It is important to ensure the quality of beginning mathematics teachers' instruction above a consistent level because such affirmation justifies the national policy on teacher education as well as the individual efforts of preservice teachers in South Korea. The current study collected mathematics lessons of the two beginning teachers who graduated from the same teacher training institute and worked at the same high school. The findings reported what features their lessons have with regard to the learning environment, engaging students in learning, deepening student learning, and using representations of the edTPA in order to identify what can or cannot be expected in their mathematics instruction. The instruction of the one teacher was assessed middle or more than middle scores throughout the rubrics, but the other one had lower scores. Based on these findings, this study suggested the implications for teacher education in ways of improving the quality of instruction of beginning mathematics teachers.

GC-Tree: A Hierarchical Index Structure for Image Databases (GC-트리 : 이미지 데이타베이스를 위한 계층 색인 구조)

  • 차광호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

Influence of Perceived Similarity on Fashion Brand Extension -Exploring the Moderating Effect of Brand Relationship Quality- (지각된 유사성이 패션 브랜드 확장효과에 미치는 영향력에 있어서 소비자-브랜드 관계 질의 조절효과)

  • Kim, Joo-Hyun;Lee, Yu-Ri
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.35 no.7
    • /
    • pp.721-735
    • /
    • 2011
  • This study: 1) identifies differences in consumers' perceived similarity of extended products to their parent product in terms of brand attributes, 2) identifies the influence of the perceived similarity on consumer's attitude toward and purchase intention of extended products (i.e., brand extension effect), and 3) examines the moderating effect of Brand Relationship Quality (BRQ) on brand extension effects. A survey questionnaire was distributed to a convenience sample of individuals aged 20-39. A total of 576 valid responses were used for the final analysis. The results showed that: 1) the consumers perceived more similarity in the extended products when the extended products maintain more consistent attributes with their parent product, 2) the higher the perceived similarity was then the higher the brand extension effect, and 3) brand relationship quality moderated the influence of perceived similarity on attitude and purchase intention. When consumers build a high relationship quality with a brand, then the brand extension effect is likely to be high regardless of the perceived similarity of the extended products. This study consequently has its own contribution in that it empirically examined the brand extension effect in the fashion field and evidenced the role of BRQ in brand extension.

An Efficient Video Clip Matching Algorithm Using the Cauchy Function (커쉬함수를 이용한 효율적인 비디오 클립 정합 알고리즘)

  • Kim Sang-Hyul
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.4
    • /
    • pp.294-300
    • /
    • 2004
  • According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

  • PDF

Development of a Regulatory Q&A System for KAERI Utilizing Document Search Algorithms and Large Language Model (거대언어모델과 문서검색 알고리즘을 활용한 한국원자력연구원 규정 질의응답 시스템 개발)

  • Hongbi Kim;Yonggyun Yu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.28 no.5
    • /
    • pp.31-39
    • /
    • 2023
  • The evolution of Natural Language Processing (NLP) and the rise of large language models (LLM) like ChatGPT have paved the way for specialized question-answering (QA) systems tailored to specific domains. This study outlines a system harnessing the power of LLM in conjunction with document search algorithms to interpret and address user inquiries using documents from the Korea Atomic Energy Research Institute (KAERI). Initially, the system refines multiple documents for optimized search and analysis, breaking the content into managable paragraphs suitable for the language model's processing. Each paragraph's content is converted into a vector via an embedding model and archived in a database. Upon receiving a user query, the system matches the extracted vectors from the question with the stored vectors, pinpointing the most pertinent content. The chosen paragraphs, combined with the user's query, are then processed by the language generation model to formulate a response. Tests encompassing a spectrum of questions verified the system's proficiency in discerning question intent, understanding diverse documents, and delivering rapid and precise answers.

A Study on Development of Patent Information Retrieval Using Textmining (텍스트 마이닝을 이용한 특허정보검색 개발에 관한 연구)

  • Go, Gwang-Su;Jung, Won-Kyo;Shin, Young-Geun;Park, Sang-Sung;Jang, Dong-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3677-3688
    • /
    • 2011
  • The patent information retrieval system can serve a variety of purposes. In general, the patent information is retrieved using limited key words. To identify earlier technology and priority rights repeated effort is needed. This study proposes a method of content-based retrieval using text mining. Using the proposed algorithm, each of the documents is invested with characteristic value. The characteristic values are used to compare similarities between query documents and database documents. Text analysis is composed of 3 steps: stop-word, keyword analysis and weighted value calculation. In the test results, the general retrieval and the proposed algorithm were compared by using accuracy measurements. As the study arranges the result documents as similarities of the query documents, the surfer can improve the efficiency by reviewing the similar documents first. Also because of being able to input the full-text of patent documents, the users unacquainted with surfing can use it easily and quickly. It can reduce the amount of displayed missing data through the use of content based retrieval instead of keyword based retrieval for extending the scope of the search.