• 제목/요약/키워드: Index search

검색결과 751건 처리시간 0.028초

실루엣을 적용한 그룹탐색 최적화 데이터클러스터링 (Group Search Optimization Data Clustering Using Silhouette)

  • 김성수;백준영;강범수
    • 한국경영과학회지
    • /
    • 제42권3호
    • /
    • pp.25-34
    • /
    • 2017
  • K-means is a popular and efficient data clustering method that only uses intra-cluster distance to establish a valid index with a previously fixed number of clusters. K-means is useless without a suitable number of clusters for unsupervised data. This paper aimsto propose the Group Search Optimization (GSO) using Silhouette to find the optimal data clustering solution with a number of clusters for unsupervised data. Silhouette can be used as valid index to decide the number of clusters and optimal solution by simultaneously considering intra- and inter-cluster distances. The performance of GSO using Silhouette is validated through several experiment and analysis of data sets.

이동 P2P 환경에서 효율적인 데이터 전송을 이용한 피어 색인 기법 (Peer Indexing Scheme using Efficient Data Dissemination in Mobile P2P Environment)

  • 곽동원;복경수;박용훈;정근수;최길성;유재수
    • 한국콘텐츠학회논문지
    • /
    • 제10권9호
    • /
    • pp.26-35
    • /
    • 2010
  • 본 논문에서는 이동 P2P 환경에서 피어의 콘텐츠와 이동성을 고려한 데이터 전송을 이용한 피어 색인 기법을 제안한다. 제안하는 기법은 콘텐츠 검색을 위한 데이터 전송 비용 및 검색 정확성과 탐색 비용을 보장하기 위해 인덱스 테이블, 버디 테이블, 라우팅 테이블로 구성한다. 제안하는 기법에서 이동 피어는 수신 신호 변화 함수를 통해 이웃 피어를 인식하고 타임스탬프 메시지를 통해 데이터 전송 비용을 감소시킨다. 전송된 데이터는 시간과 관심항목 가중치를 고려한 피어 색인 구조에 저장되어 검색 정확도를 향상 시키고 탐색 비용을 감소시킨다.

최적 설계를 위한 3점 탐색 알고리즘의 제안 (A Proposal of 3 Point Search Algorithm for Optimal Design)

  • 김주홍;공휘식
    • 한국통신학회논문지
    • /
    • 제16권7호
    • /
    • pp.640-650
    • /
    • 1991
  • 最適 設計를 위한 최적치 탐색 알고리즘으로 직접 탐색법의 일종인 3점 탐색 알고리즘을 제안하였다. 본 알고리즘은 N차원 탐색 범위 내에 있는 수공간의 3N 점에서 함수의 최소차를 탐색하고 점차로 탐색 범위를 축소하여 동일한 타색과정을 반복수행하는 방법이다. 그러므로, 1회 탐색시에 성능 지표의 계산횟수는 3N이다. 도한 3N점 탐색법을 대산히나 3N점에 대한 탐색법으로 단순 3N탐색법을 기술하였으나, 이것은 서로 다른 매개 변수가 乘서항을 갖는 성능지표의 경우에는 불확실함이 발견되었다. 제안된 알고리즘은 2차 형식이나 선형함수로 구성되는 성능 지표에 적용이 가능하며, 안정하고 신회도가 높은 특성을 갖고 있음이 확인되었다.

  • PDF

Improving Elasticsearch for Chinese, Japanese, and Korean Text Search through Language Detector

  • Kim, Ki-Ju;Cho, Young-Bok
    • Journal of information and communication convergence engineering
    • /
    • 제18권1호
    • /
    • pp.33-38
    • /
    • 2020
  • Elasticsearch is an open source search and analytics engine that can search petabytes of data in near real time. It is designed as a distributed system horizontally scalable and highly available. It provides RESTful APIs, thereby making it programming-language agnostic. Full text search of multilingual text requires language-specific analyzers and field mappings appropriate for indexing and searching multilingual text. Additionally, a language detector can be used in conjunction with the analyzers to improve the multilingual text search. Elasticsearch provides more than 40 language analysis plugins that can process text and extract language-specific tokens and language detector plugins that can determine the language of the given text. This study investigates three different approaches to index and search Chinese, Japanese, and Korean (CJK) text (single analyzer, multi-fields, and language detector-based), and identifies the advantages of the language detector-based approach compared to the other two.

Fuzzy Keyword Search Method over Ciphertexts supporting Access Control

  • Mei, Zhuolin;Wu, Bin;Tian, Shengli;Ruan, Yonghui;Cui, Zongmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5671-5693
    • /
    • 2017
  • With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

J-tree : 사용자의 검색패턴을 이용한 대용량 데이타를 위한 효율적인 색인 (J-Tree: An Efficient Index using User Searching Patterns for Large Scale Data)

  • 장수민;서광석;유재수
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제36권1호
    • /
    • pp.44-49
    • /
    • 2009
  • 최근에 휴대용 단말기들의 발전으로, 대용량 데이타에 대한 다양한 검색 서비스들이 휴대용 단말기에 제공되고 있다. 정보 검색을 위한 대부분 응용프로그램들은 대용량 데이타를 검색하기 위하여 B-tree나 R-tree와 같은 색인을 사용한다. 그러나 전체 데이타의 매우 적은 부분이 사용자에 의하여 접근된다. 또한, 각 데이타에 대한 접근 빈도수들은 다양하다. 그러나 B-tree나 R-tree와 같은 색인들은 편향적 접근 패턴의 특성을 고려하지 않는다. 그리고 캐쉬는 빠른 접근을 위해서 반복적으로 접근되는 데이타를 메모리에 저장한다. 그러나 캐쉬에서 사용하는 메모리의 크기는 제한적이다. 본 논문에서는 사용자의 검색패턴들을 고려한 디스크 기반의 새로운 색인구조, J-tree를 제안한다. 제안된 색인은 모든 데이터에 대한 일정한 검색속도를 보장하는 균형트리이다. 그리고 자주 접근된 데이타에 대해서는 빠른 검색속도를 제공한다. 성능평가는 다양한 실험환경에서 제안된 색인의 효율성을 보여준다.

피더부하 균등화지수를 이용한 배전계통의 긴급정전복구 및 부하균등화 (Emergency Service Restoration and Load Balancing in Distribution Networks Using Feeder Loadings Balance Index)

  • 최상열;정호성;신명철
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제51권5호
    • /
    • pp.217-224
    • /
    • 2002
  • This paper presents an algorithm to obtain an approximate optimal solution for the service restoration and load balancing of large scale radial distribution system in a real-time operation environment. Since the problem is formulated as a combinatorial optimization problem, it is difficult to solve a large-scale combinatorial optimization problem accurately within the reasonable computation time. Therefore, in order to find an approximate optimal solution quickly, the authors proposed an algorithm which combines optimization technique called cyclic best-first search with heuristic based feeder loadings balance index for computational efficiency and robust performance. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the KEPCO's 108 bus distribution system.

CONTINUOUS QUERY PROCESSING IN A DATA STREAM ENVIRONMENT

  • Lee, Dong-Gyu;Lee, Bong-Jae;Ryu, Keun-Ho
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
    • /
    • pp.3-5
    • /
    • 2007
  • Many continuous queries are important to be process efficiently in a data stream environment. It is applied a query index technique that takes linear performance irrespective of the number and width of intervals for processing many continuous queries. Previous researches are not able to support the dynamic insertion and deletion to arrange intervals for constructing an index previously. It shows that the insertion and search performance is slowed by the number and width of interval inserted. Many intervals have to be inserted and searched linearly in a data stream environment. Therefore, we propose Hashed Multiple Lists in order to process continuous queries linearly. Proposed technique shows fast linear search performance. It can be utilized the systems applying a sensor network, and preprocessing technique of spatiotemporal data mining.

  • PDF

A Study on Developing and Refining a Large Citation Service System

  • Kim, Kwang-Young;Kim, Hwan-Min
    • International Journal of Knowledge Content Development & Technology
    • /
    • 제3권1호
    • /
    • pp.65-80
    • /
    • 2013
  • Today, citation index information is used as an outcome scale of spreading technology and encouraging research. Article citation information is an important factor to determine the authority of the relevant author. Google Scholar uses the article citation information to organize academic article search results with a rank algorithm. For an accurate analysis of such important citation index information, large amounts of bibliographic data are required. Therefore, this study aims to build a fast and efficient system for large amounts of bibliographic data, and to design and develop a system for quickly analyzing cited information for that data. This study also aims to use and analyze citation data to be a basic element for providing various advanced services to the academic article search system.

유전 알고리즘을 이용한 Mn4+ 활성 적색 형광체 탐색 (Search for Mn4+-Activated Red Phosphor by Genetic Algorithm)

  • 김민석;박운배
    • 한국재료학회지
    • /
    • 제27권6호
    • /
    • pp.312-317
    • /
    • 2017
  • In the construction of a white LED, the region of the red emission is a very important factor. Red light emitting materials play an important role in improving the color rendering index of commercial lighting. These materials also increase the color gamut of display products. Therefore, the development of novel phosphors with red emission and the study of color tuning are actively underway to improve product quality. In the present study, heuristic algorithms were used to search for phosphors capable of increasing the color rendering index and color gamut. Using a heuristic algorithm, the phosphors that were identified were $SrGe_4O_9:Mn^{4+}$ and $BaGe_4O_9:Mn^{4+}$. Emission spectra study confirmed that these phosphors emit light in the deep red wavelength region, which can fulfill the requirement for the improvement in color rendering index and color gamut for a white LED.