• Title/Summary/Keyword: Database Algorithm

Search Result 1,648, Processing Time 0.026 seconds

A Study on the Optimization of PD Pattern Recognition using Genetic Algorithm (유전알고리즘을 이용한 부분방전 패턴인식 최적화 연구)

  • Kim, Seong-Il;Lee, Sang-Hwa;Koo, Ja-Yoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.1
    • /
    • pp.126-131
    • /
    • 2009
  • This study was carried out for the reliability of PD(Partial Discharge) pattern recognition. For the pattern recognition, the database for PD was established by use of self-designed insulation defects which occur and were mostly critical in GIS(Gas Insulated Switchgear). The acquired database was analyzed to distinguish patterns by means of PRPD(Phase Resolved Partial Discharge) method and stored to the form with to unite the average amplitude of PD pulse and the number of PD pulse as the input data of neural network. In order to prove the performance of genetic algorithm combined with neural network, the neural networks with trial-and-error method and the neural network with genetic algorithm were trained by same training data and compared to the results of their pattern recognition rate. As a result, the recognition success rate of defects was 93.2% and the neural network train process by use of trial-and-error method was very time consuming. The recognition success rate of defects, on the other hand, was 100% by applying the genetic algorithm at neural network and it took a relatively short time to find the best solution of parameters for optimization. Especially, it could be possible that the scrupulous parameters were obtained by genetic algorithm.

A Study on Duplicate Detection Algorithm in Union Catalog (종합목록의 중복레코드 검증을 위한 알고리즘 연구)

  • Cho, Sun-Yeong
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.37 no.4
    • /
    • pp.69-88
    • /
    • 2003
  • This study intends to develop a new duplicate detection algorithm to improve database quality. The new algorithm is developed to analyze by variables of language and bibliographic type, and it checks elements in bibliographic data not just MARC fields. The algorithm computes the degree of similarity and the weight values to avoid possible elimination of records by simple input error. The study was peformed on the 7,649 newly uploaded records during the last one year against the 210,000 sample master database. The findings show that the new algorithm has improved the duplicates recall rate by 36.2%.

The privacy protection algorithm of ciphertext nearest neighbor query based on the single Hilbert curve

  • Tan, Delin;Wang, Huajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3087-3103
    • /
    • 2022
  • Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.

A Query Processing Model based on the XML View in Relational Databases (관계형 데이터베이스에서 XML 뷰 기반의 질의 처리 모델)

  • Jung, Chai-Young;Choi, Kyu-Won;Kim, Young-Ok;Kim, Young-Kyun;Kang, Hyun-Syug;Bae, Jong-Min
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.221-232
    • /
    • 2003
  • This paper addresses the query processing component of a wrapper system for a relational database model based on the XML view in integrating databases. The schema of a relational database is represented as XML Schema that is proposed by W3C. Users submit a query using the XML query language XQuery over the XML Schema. The wrapper system to be developed supports an user-defined XML view. XQuery is also used as the view definition language. In this environment, this paper suggests a new XML query processing model. We propose the composition algorithm of an XML view with an user query, the translation algorithm of XQuery into SQL, and the XML template construction algorithm for generating XML documents.

A Study on the Effective Database Marketing using Data Mining Technique(CHAID) (데이터마이닝 기법(CHAID)을 이용한 효과적인 데이터베이스 마케팅에 관한 연구)

  • 김신곤
    • The Journal of Information Technology and Database
    • /
    • v.6 no.1
    • /
    • pp.89-101
    • /
    • 1999
  • Increasing number of companies recognize that the understanding of customers and their markets is indispensable for their survival and business success. The companies are rapidly increasing the amount of investments to develop customer databases which is the basis for the database marketing activities. Database marketing is closely related to data mining. Data mining is the non-trivial extraction of implicit, previously unknown and potentially useful knowledge or patterns from large data. Data mining applied to database marketing can make a great contribution to reinforce the company's competitiveness and sustainable competitive advantages. This paper develops the classification model to select the most responsible customers from the customer databases for telemarketing system and evaluates the performance of the developed model using LIFT measure. The model employs the decision tree algorithm, i.e., CHAID which is one of the well-known data mining techniques. This paper also represents the effective database marketing strategy by applying the data mining technique to a credit card company's telemarketing system.

  • PDF

'Hanmal' Korean Language Diphone Database for Speech Synthesis

  • Chung, Hyun-Song
    • Speech Sciences
    • /
    • v.12 no.1
    • /
    • pp.55-63
    • /
    • 2005
  • This paper introduces a 'Hanmal' Korean language diphone database for speech synthesis, which has been publicly available since 1999 in the MBROLA web site and never been properly published in a journal. The diphone database is compatible with the MBROLA programme of high-quality multilingual speech synthesis systems. The usefulness of the diphone database is introduced in the paper. The paper also describes the phonetic and phonological structure of the database, showing the process of creating a text corpus. A machine-readable Korean SAMPA convention for the control data input to the MBROLA application is also suggested. Diphone concatenation and prosody manipulation are performed using the MBR-PSOLA algorithm. A set of segment duration models can be applied to the diphone synthesis of Korean.

  • PDF

Development of Knapsack Problem Solver Using Relational DBMS (관계형 데이터베이스를 이용한 배낭문제 해법기의 구현)

  • 서창교;송구선
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.2
    • /
    • pp.73-73
    • /
    • 1988
  • Knapsack problems represent many business application such as cargo loading, project selection, and capital budgeting. In this research we developed a knapsack problem solver based on Martello-Toth algorithm using a relational database management system on the PC platform. The solver used the menu-driven user interface. The solver can be easily integrated with the database of decision support system because the solver can access the database to retrieve the data for the model and to store the result directly.

Development of knapsack problem solver using relational DBMS (관계형 데이터베이스를 이용한 배낭문제 해법기의 구현)

  • 서창교;송구선
    • Korean Management Science Review
    • /
    • v.13 no.2
    • /
    • pp.73-94
    • /
    • 1996
  • Knapsack problems represent many business application such as cargo loading, project selection, and capital budgeting. In this research we developed a knapsack problem solver based on Martello-Toth algorithm using a relational database management system on the PC platform. The solver used the menu-driven user interface. The solver can be easily integrated with the database of decision support system because the solver can access the database to retrieve the data for the model and to store the result directly.

  • PDF

Development of Assessment System for Pipeline Integrity (매설배관의 건전성 평가 시스템 개발)

  • 이억섭;윤해룡
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.8
    • /
    • pp.158-165
    • /
    • 2003
  • The object of this work is to develop an assessment system for pipeline integrity. The internal algorithm and the database of the system are described in this paper. The system consists of four module applications; the effect of corrosion in pipeline, crack, SCC (stress corrosion cracking) and fatigue module. The database of the system is separated to mainly four parts; geometry of pipeline, material properties, boundary condition and general properties. This system may give a guideline for maintenance and modifications.

Mining Association Rules in Multiple Databases using Links (복수 데이터베이스에서 링크를 이용한 연관 규칙 탐사)

  • Bae, Jin-Uk;Sin, Hyo-Seop;Lee, Seok-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.8
    • /
    • pp.939-954
    • /
    • 1999
  • 데이타마이닝 분야에서는 대용량의 트랜잭션 데이타베이스와 같은 하나의 데이타베이스로부터 연관 규칙을 찾는 연구가 많이 수행되어왔다. 그러나, 창고형 할인매장이나 백화점 같이 고객 카드를 이용하는 판매점의 등장으로, 단지 트랜잭션에 대한 분석 뿐만이 아니라, 트랜잭션과 고객과의 관계에 대한 분석 또한 요구되고 있다. 즉, 두 개의 데이타베이스로부터 연관 규칙을 찾는 연구가 필요하다. 이 논문에서는 두 데이타베이스 사이에 링크를 생성하여 연관 항목집합을 찾는 알고리즘을 제안한다. 실험 결과, 링크를 이용한 알고리즘은 고객 데이타베이스가 메모리에 거주가능한 크기라면 시간에 따른 분석에 유용함을 보여주었다.Abstract There have been a lot of researches of mining association rules from one database such as transaction database until now. But as the large discount store using customer card emerges, the analysis is not only required about transactions, but also about the relation between transactions and customer data. That is, it is required to search association rules from two databases. This paper proposes an efficient algorithm constructing links from one database to the other. Our experiments show the algorithm using link is useful for temporal analysis of memory-resident customer database.