• Title/Summary/Keyword: Search-Result Clustering

Search Result 75, Processing Time 0.024 seconds

Query Optimization for an Advanced Keyword Search on Relational Data Stream (관계형 데이터 스트림에서 고급 키워드 검색을 위한 질의 최적화)

  • Joo, Jin-Ung;Kim, Hak-Soo;Hwang, Jin-Ho;Son, Jin-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.6
    • /
    • pp.859-870
    • /
    • 2009
  • Despite the surge in the research for keyword search method over relational database, only little attention has been devoted to studying on relational data stream.The research for keyword search over relational data stream is intense interest because streaming data is recently a major research topic of growing interest in the data management. In this regard we first analyze the researches related to keyword search methodover relational data stream, and then this paper focuses on the method of minimizing the join cost occurred while processing keyword search queries. As a result, we propose an advanced keyword search method that can yield more meaningful results for users on relational data streams. We also propose a query optimization method using layered-clustering for efficient query processing.

A Load Balanced Clustering Model for Energy Efficient Packet Transmission in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적 패킷 전송을 위한 부하 균형 클러스터링 모델)

  • Lee, Jae-Hee;Kim, Byung-Ki;Kang, Seong-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.12
    • /
    • pp.409-414
    • /
    • 2015
  • The energy conservation is the most important subject for long run operation of the sensor nodes with limited power resources. Clustering is one of most energy efficient technique to grouped the sensor nodes into distinct cluster. But, in a cluster based WSN, CHs and gateways bear an extra work load to send the processed data to the sink. The inappropriate cluster formation may cause gateways overloaded and may increase latency in communication. In this paper, we propose a novel load balanced clustering model for improving energy efficiency and giving a guarantee of long network lifetime. We show the result of performance measurement experiments that designs using a branch and bound algorithm and a multi-start local search algorithm to compare with the existing load balanced clustering model.

A Study On Predicting Stock Prices Of Hallyu Content Companies Using Two-Stage k-Means Clustering (2단계 k-평균 군집화를 활용한 한류컨텐츠 기업 주가 예측 연구)

  • Kim, Jeong-Woo
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.7
    • /
    • pp.169-179
    • /
    • 2021
  • This study shows that the two-stage k-means clustering method can improve prediction performance by predicting the stock price, To this end, this study introduces the two-stage k-means clustering algorithm and tests the prediction performance through comparison with various machine learning techniques. It selects the cluster close to the prediction target obtained from the k-means clustering, and reapplies the k-means clustering method to the cluster to search for a cluster closer to the actual value. As a result, the predicted value of this method is shown to be closer to the actual stock price than the predicted values of other machine learning techniques. Furthermore, it shows a relatively stable predicted value despite the use of a relatively small cluster. Accordingly, this method can simultaneously improve the accuracy and stability of prediction, and it can be considered as the new clustering method useful for small data. In the future, developing the two-stage k-means clustering is required for the large-scale data application.

Development of Economical Run Model for Electric Railway Vehicle (전기철도차량 경제운전 모형 개발)

  • Lee Tae-Hyung;Hang Hee-Soo
    • Journal of the Korean Society for Railway
    • /
    • v.9 no.1 s.32
    • /
    • pp.76-80
    • /
    • 2006
  • The Optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model have been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme are utilized, respectively. As a result, two meta-models for trip time and energy consumption were constructed. The optimization to search an economical running pattern was achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

Development of Economical Run Model for High Speed Rolling stock 350 experimental (한국형 고속열차 경계운전 모형 개발)

  • Lee, Tae-Hyung;Park, Choon-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2005.10c
    • /
    • pp.238-240
    • /
    • 2005
  • The Optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model have been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme are utilized, respectively. As a result, two meta-models for trip time and energy consumption were constructed. The optimization to search an economical running pattern was achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

  • PDF

Optimal Economical Running Patterns Based on Fuzzy Model (철도차량을 위한 퍼지모델기반 최적 경제운전 패턴 개발)

  • Lee, Tae-Hyung;Hwang, Hee-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.5
    • /
    • pp.594-600
    • /
    • 2006
  • The optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model has been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme ate utilized, respectively. As a result, two meta-models for trip time and energy consumption are constructed. The optimization to search an economical running pattern is achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

Mean Shift Clustering을 이용한 영상 검색결과 개선

  • Kwon, Kyung-Su;Shin, Yun-Hee;Kim, Young-Rae;Kim, Eun-Yi
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2009.05a
    • /
    • pp.138-143
    • /
    • 2009
  • 본 논문에서는 감성 공간에서 mean shift clustering과 user feedback을 이용하여 영상 검색 결과를 개선하기 위한 시스템을 제안한다. 제안된 시스템은 사용자 인터페이스, 감성 공간 변환, 검색결과 순위 재지정(re-ranking)으로 구성된다. 사용자 인터페이스는 텍스트 형태의 질의 입력과 감성 어휘 선택에 따른 user feedback에 의해 개선된 검색결과를 보인다. 사용된 감성 어휘는 고바야시가 정의한 romantic, natural, casual, elegant, chic, classic, dandy, modern 등의 8개 어휘를 사용한다. 감성 공간 변환 단계에서는 입력된 질의에 따라 웹 영상 검색 엔진(Yahoo)에 의해 검색된 결과 영상들에 대해 컬러와 패턴정보의 특징을 추출하고, 이를 입력으로 하는 8개의 각 감성별 분류기에 의해 각 영상은 8차원 감성 공간으로의 특징 벡터로 변환된다. 이때 감성 공간으로 변환된 특징 벡터들은 mean shift clustering을 통해 군집화 되고, 그 결과로써 대표 클러스터를 찾게 된다. 검색결과 순위 재지정 단계에서는 user feedback 유무에 따라 대표 클러스터의 평균 벡터와 user feedback에 의해 생성된 사용자 감성 벡터에 의해 검색 결과를 개선할 수 있다. 이때 각 기준에 따라 유사도가 결정되고 검색결과 순위가 재지정 된다 제안된 시스템의 성능을 검증하기 위해 7개의 질의의 각 400장, 총 2,800장에 대한 Yahoo 검색 결과와 제안된 시스템을 개선된 검색 결과를 비교하였다.

  • PDF

A performance improvement methodology of web document clustering using FDC-TCT (FDC-TCT를 이용한 웹 문서 클러스터링 성능 개선 기법)

  • Ko, Suc-Bum;Youn, Sung-Dae
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.637-646
    • /
    • 2005
  • There are various problems while applying classification or clustering algorithm in that document classification which requires post processing or classification after getting as a web search result due to my keyword. Among those, two problems are severe. The first problem is the need to categorize the document with the help of the expert. And, the second problem is the long processing time the document classification takes. Therefore we propose a new method of web document clustering which can dramatically decrease the number of times to calculate a document similarity using the Transitive Closure Tree(TCT) and which is able to speed up the processing without loosing the precision. We also compare the effectivity of the proposed method with those existing algorithms and present the experimental results.

A hybrid algorithm for classifying rock joints based on improved artificial bee colony and fuzzy C-means clustering algorithm

  • Ji, Duofa;Lei, Weidong;Chen, Wenqin
    • Geomechanics and Engineering
    • /
    • v.31 no.4
    • /
    • pp.353-364
    • /
    • 2022
  • This study presents a hybrid algorithm for classifying the rock joints, where the improved artificial bee colony (IABC) and the fuzzy C-means (FCM) clustering algorithms are incorporated to take advantage of the artificial bee colony (ABC) algorithm by tuning the FCM clustering algorithm to obtain the more reasonable and stable result. A coefficient is proposed to reduce the amount of blind random searches and speed up convergence, thus achieving the goals of optimizing and improving the ABC algorithm. The results from the IABC algorithm are used as initial parameters in FCM to avoid falling to the local optimum in the local search, thus obtaining stable classifying results. Two validity indices are adopted to verify the rationality and practicability of the IABC-FCM algorithm in classifying the rock joints, and the optimal amount of joint sets is obtained based on the two validity indices. Two illustrative examples, i.e., the simulated rock joints data and the field-survey rock joints data, are used in the verification to check the feasibility and practicability in rock engineering for the proposed algorithm. The results show that the IABC-FCM algorithm could be applicable in classifying the rock joint sets.

Efficient Continuous Vocabulary Clustering Modeling for Tying Model Recognition Performance Improvement (공유모델 인식 성능 향상을 위한 효율적인 연속 어휘 군집화 모델링)

  • Ahn, Chan-Shik;Oh, Sang-Yeob
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.177-183
    • /
    • 2010
  • In continuous vocabulary recognition system by statistical method vocabulary recognition to be performed using probability distribution it also modeling using phoneme clustering for based sample probability parameter presume. When vocabulary search that low recognition rate problem happened in express vocabulary result from presumed probability parameter by not defined phoneme and insert phoneme and it has it's bad points of gaussian model the accuracy unsecure for one clustering modeling. To improve suggested probability distribution mixed gaussian model to optimized for based resemble Euclidean and Bhattacharyya distance measurement method mixed clustering modeling that system modeling for be searching phoneme probability model in clustered model. System performance as a result of represent vocabulary dependence recognition rate of 98.63%, vocabulary independence recognition rate of 97.91%.