• Title/Summary/Keyword: Similar Search

Search Result 811, Processing Time 0.026 seconds

Content based data search using semantic annotation (시맨틱 주석을 이용한 내용 기반 데이터 검색)

  • Kim, Byung-Gon;Oh, Sung-Kyun
    • Journal of Digital Contents Society
    • /
    • v.12 no.4
    • /
    • pp.429-436
    • /
    • 2011
  • Various documents, images, videos and other materials on the web has been increasing rapidly. Efficient search of those things has become an important topic. From keyword-based search, internet search has been transformed to semantic search which finds the implications and the relations between data elements. Many annotation processing systems manipulating the metadata for semantic search have been proposed. However, annotation data generated by different methods and forms are difficult to process integrated search between those systems. In this study, in order to resolve this problem, we categorized levels of many annotation documents, and we proposed the method to measure the similarity between the annotation documents. Similarity measure between annotation documents can be used for searching similar or related documents, images, and videos regardless of the forms of the source data.

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.

An Effective Early Termination Motion Estimation Method for Multi-view Video Coding (다시점 비디오 부호화를 위한 효과적인 초기 종료 움직임 추정 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.333-341
    • /
    • 2014
  • Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. Multi-view video coding requires high computational complexity. To reduce computational complexity and maintain the image quality, an effective early termination motion estimation method is proposed in this paper. The proposed method exploiting the characteristic of motion vector distribution uses a hierarchical search strategy. This strategy method consists of multi-grid square search pattern, modified diamond search pattern, small diamond search pattern and raster search pattern. Experiment results show that the speedup improvement of the proposed method over TZ search method and FS(Full Search) method JMVC (Joint Multiview Video Coding) can be up to 1.7~4.5 times and 90 times faster respectively while maintaining similar video quality and bit rates.

The Effect of External Knowledge Search on Innovation Speed: Focusing on the Moderation Effect of Export Performance (외부지식탐색이 혁신속도에 미치는 영향: 수출성과의 조절효과를 중심으로)

  • Roh, Taewoo
    • Journal of Digital Convergence
    • /
    • v.16 no.2
    • /
    • pp.93-102
    • /
    • 2018
  • This study suggests external knowledge search as a way of creating knowledge and efforts for reaching out to the innovation and examines the relationship between innovation speed and the breadth and depth of external knowledge search. As a part of efforts to overcome the limitations of the routines of external knowledge search in the domestic market, the efforts of a firm to enter the foreign market have been examined with a moderate effect. Although previous research focused on exploration of external knowledge that is mostly effected in single country or similar industry, this study expands it by introducing the concept of market expansion and empirically inspect the interaction effect. 818 valid samples used in this study are based on the innovation survey published by STEPI and empirical results are as follows. First, the breadth and depth of external knowledge search have a positive impact on innovation speed. Second, export performance as the effect of expanding the market has a moderating effect on the speed of innovation. Third, younger companies prefer various networks while older companies prefer depth networks in order to increase the speed.

Information Search for the Choice of Delivery Care Institution and Its Effects (임산부의 의료기관 정보탐색과 성과)

  • Kwon, Soon-Ho;Han, Dal-Sun
    • Korea Journal of Hospital Management
    • /
    • v.3 no.1
    • /
    • pp.219-237
    • /
    • 1998
  • Economists have identified informed consumer choice as one element of a better-functioning health care market, and thus increased attention is directed to the role of information in the health care system. In this country, however, little work has been done for understanding consumers' search behavior in health care market. Based upon this observation, expectant mothers' information search for the choice of delivery care institution was investigated. In doing so, two hypotheses were proposed: 1) Those women who were more active in the search for information would make choice of a delivery care institution with more confidence and would feel greater subsequent satisfaction. 2) The activeness of expectant mothers in information search would depend upon their various personal characteristics, such as socio-economic status, obstetric conditions, and knowledge and attitudes in relation to delivery and health care. The data used for the analysis were collected through face-to-face interviews with those women who had childbirth during the period from January 1, 1996 to the date of interview in February 1998. The survey was conducted using prepared structured questionnaire in Seoul. The sample was drawn from each of arbitrarily defined four regions of Seoul, Northeast, Northwest, Southeast and Southwest, in proportion to the number of births reported in 1996 in each of them. The distribution of the interviewed women by educational level was made similar to that of mothers of new babies reported in 1996. The sample size was planned to be about 300, but ended up with 319. The results of analysis were generally consistent with the proposed hypotheses. Apparently, information increased expectant mothers' confidence in selecting a delivery care institution and subsequent satisfaction with the institution. Indication is that policy efforts should be strengthened to produce and disseminate relevant, comprehensible and credible information that can aid patient decision making. Also, attention should be directed to motivate patients to actively engage in information search from adequate sources.

  • PDF

Fast and Efficient Search Algorithm of Block Motion Estimation

  • Kim, Sang-Gyoo;Lee, Tae-Ho;Jung, Tae-Yeon;Kim, Duk-Gyoo
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.885-888
    • /
    • 2000
  • Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity

  • PDF

Electronic Commerce Using on Case & Rule Based Reasoning Agent (전자상거래를 위한 규칙 및 사례기반 추론 에이전트)

  • 박진희;허철회;정환묵
    • The Journal of Society for e-Business Studies
    • /
    • v.8 no.1
    • /
    • pp.55-70
    • /
    • 2003
  • With the gradual growth of the electronic commerce various forms of shopping malls are constructed, and their searching methods and function are studied many ways. However, the recent outcome is still inadequate to search for goods for the tastes and demands of customers. To construct the shopping mall on the electronic commerce and help customers with purchasing goods, the efficient interface for the customers to contact the shopping malls should be founded and the customers should be able to search the goods they want. Therefore, in this paper, we designed the Intelligent Integration Agent System (IIAS) using the multi-agent formed by the integration agent which integrates the case based reasoning(CBR) and the rule based reasoning(RBR) and the user agent which manages users' profiles. IIAS performs the rule based reasoning on the subject issue first, then provides the unsatisfying search results from the rule-base reasoning to the customers through the user agent, which enables the search of the goods most similar to the ones that meet the tastes and demands of the customers. That is, the accuracy and the speed has been improved by reasoning with the similarity adjustable integration agent which can pick out the goods of customers wants by modifying the weights of properties according to those of the customers.

  • PDF

An Al Approach with Tabu Search to solve Multi-level Knapsack Problems:Using Cycle Detection, Short-term and Long-term Memory

  • Ko, Il-Sang
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.37-58
    • /
    • 1997
  • An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

  • PDF

A Study on Changes of the Intellectual Structure in Web Information Using the Co-links Analysis (동시링크분석을 이용한 웹정보원의 지적구조 변화에 관한 연구)

  • Lee, Sung-Sook
    • Journal of the Korean Society for information Management
    • /
    • v.22 no.2 s.56
    • /
    • pp.205-228
    • /
    • 2005
  • This research analyzed changes of the intellectual structure of web information by examining time changes and search engines using the co-links analysis. According to the results, the co-links web information clusters on the two maps appeared to contain changes in the intellectual structure over the two time periods. The intellectual structure that appeared in the information map for AltaVista and MSN Search engines was relatively similar. However. there were also cases where the clusters of some web information was different. The results of the research revealed that the cocitation analysis could be applied simultaneously to diachronous analysis in the web information.

Music Search Algorithm for Automotive Infotainment System (자동차 환경의 인포테인먼트 시스템을 위한 음악 검색 알고리즘)

  • Kim, Hyoung-Gook;Kim, Jae-Man
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.1
    • /
    • pp.81-87
    • /
    • 2013
  • In this paper, we propose a music search algorithm for automotive infotainment system. The proposed method extracts fingerprints using the high peaks based on log-spectrum of the music signal, and the extracted music fingerprints store in cloud server applying a hash value. In the cloud server, the most similar music is retrieved by comparing the user's query music with the fingerprints stored in hash table of cloud server. To evaluate the performance of the proposed music search algorithm, we measure an accuracy of the retrieved results according to various length of the query music and measure a retrieval time according to the number of stored music database in hash table.