• Title/Summary/Keyword: Filtering Algorithm

Search Result 1,427, Processing Time 0.031 seconds

A STUDY ON INITIAL CONVERGENCE PROPERTIES OF THE KALMAN FILLTERING ALGORITHM

  • Park, Dong-Jo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10b
    • /
    • pp.1051-1054
    • /
    • 1988
  • In this paper we present initial convergence properties of the Kalman filtering algorithm, we put an arbitrary small positive correlation matrix as an initial condition in the recursive algorithm. This arbitrary small initial condition perturbs the Kalman filtering algorithm and may lead to initial instability. We derive a condition which insures the stable operation of the Kalman filtering algorithm from the stochastic Lyapunov difference equation.

  • PDF

Collaborative Filtering Recommendation Algorithm Based on LDA2Vec Topic Model (LDA2Vec 항목 모델을 기반으로 한 협업 필터링 권장 알고리즘)

  • Xin, Zhang;Lee, Scott Uk-Jin
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2020.07a
    • /
    • pp.385-386
    • /
    • 2020
  • In this paper, we propose a collaborative filtering recommendation algorithm based on the LDA2Vec topic model. By extracting and analyzing the article's content, calculate their semantic similarity then combine the traditional collaborative filtering algorithm to recommend. This approach may promote the system's recommend accuracy.

  • PDF

An Improved Method of Fault Indication Information Using Filtering Algorithm (배전자동화 중앙장치에서 필터링 알고리즘을 통한 고장표시 오류 개선방법)

  • Seo, Jung-Soo;Kim, Hyung-Seung;Lim, Sung-Il;Choi, Myeon-Song;Lee, Seung-Jae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.10
    • /
    • pp.1418-1425
    • /
    • 2015
  • In this paper, an filtering method of FI(Fault Indication) information generated by FRTU(Feeder Remote Terminal Unit)s is proposed for the present DAS(Distribution Automation System). In order to find fault area, correct FI information should be generated. But when a single line-to-ground fault occurs, FI information is generated in downside of the fault in some circumstance because existing FI algorithm considers only magnitude. These wrong FI information can be removed by changing existing algorithm. An improved algorithm considers both the direction of zero-sequence current and the phase of three-phase current&voltage. But many FRTUs are distributed in DAS and Changing the algorithm all of FRTU will spend a lot of time and cost. On the other hand, an filtering algorithm proposed in this paper can substitute for it. The filtering algorithm also considers both the direction of zero-sequence current and the phase of three-phase current&voltage. In case study, the proposed method has been shown the reasonability in filtering the fault indication information.

New Algorithm for Recursive Estimation in Linear Discrete-Time Systems with Unknown Parameters

  • Shin Vladimir;Ahn Jun-Il;Kim Du-Yong
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.4
    • /
    • pp.456-465
    • /
    • 2006
  • The problem of recursive filtering far linear discrete-time systems with uncertainties is considered. A new suboptimal filtering algorithm is herein proposed. It is based on the fusion formula, which represents an optimal mean-square linear combination of local Kalman estimates with weights depending on cross-covariances between local filtering errors. In contrast to the optimal weights, the suboptimal weights do not depend on current measurements, and thus the proposed algorithm can easily be implemented in real-time. High accuracy and efficiency of the suboptimal filtering algorithm are demonstrated on the following examples: damper harmonic oscillator motion and vehicle motion constrained to a plane.

Spamming page filtering algorithm using Web structure management management (Web Structure Management기법을 이용한 Spamming page filtering algorithm)

  • 신광섭;이우기;강석호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.238-240
    • /
    • 2004
  • 정보 통신 기술의 발달로 엄청난 양의 정보가 World Wide Web을 통해 저장되고 공유된다. 특히, 사용자가 WWW을 이용하여 필요한 정보를 얻고자할 때, 가장 많이 사용되는 것이 Web search engine이다. 그러나 Web search engine의 algorithm 자체의 부정확성과 악의적으로 작성된 Web page로 인해 search engine 결과가 사용자의 요구와 일치하지 못하는 문제가 발생한다. 본 논문에서는 여러 Web search algorithm 중에서 Web structure management 기법을 중심으로 문제점을 분석하고 이를 해결할 수 있는 수정된 algorithm을 제시한다. 마지막으로 제시된 algorithm이 spamming page를 filtering하는 과정을 예시하여 논증한다.

  • PDF

Performance of Collaborative Filtering Agent System using Clustering for Better Recommendations (개선된 추천을 위해 클러스터링을 이용한 협동적 필터링 에이전트 시스템의 성능)

  • Hwang, Byeong-Yeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5S
    • /
    • pp.1599-1608
    • /
    • 2000
  • Automated collaborative filtering is on the verge of becoming a popular technique to reduce overloaded information as well as to solve the problems that content-based information filtering systems cannot handle. In this paper, we describe three different algorithms that perform collaborative filtering: GroupLens that is th traditional technique; Best N, the modified one; and an algorithm that uses clustering. Based on the exeprimental results using real data, the algorithm using clustering is compared with the existing representative collaborative filtering agent algorithms such as GroupLens and Best N. The experimental results indicate that the algorithms using clustering is similar to Best N and better than GroupLens for prediction accuracy. The results also demonstrate that the algorithm using clustering produces the best performance according to the standard deviation of error rate. This means that the algorithm using clustering gives the most stable and the best uniform recommendation. In addition, the algorithm using clustering reduces the time of recommendation.

  • PDF

The Outlier-Filtering Algorithm for National Highway Continuous Traffic Counts Data (일반국도 상시조사 교통량 자료의 이상치 판정 알고리즘 개발)

  • Shin, Jae Myong;Lee, Sang Hyup;Kim, Hyun Suk
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.2
    • /
    • pp.691-702
    • /
    • 2013
  • In this study the quantitative outlier-filtering algorithm has been developed using the smoothing method based on the day-of-the-week traffic volume variation pattern and then, in order to test the effectiveness of the algorithm, it has been used to identify outliers from the traffic volume data collected at 14 continuous traffic counts sites on the national highways in the year 2010. The test results are satisfactory since the filtering rate is 98.2% for normal days and the mis-filtering rate is 8.0% for abnormal days. Therefore, the algorithm will be able to be used for roughly-but-quickly filtering outliers from the collected traffic volume data.

Cooperative Data Stream Filtering for Sensor Tag (센서태그 통합 데이터 필터링에 관한 연구)

  • Ryu, Seung-Wan;Oh, Seul-Ki;Park, Sei-Kwon;Oh, Dong-Ok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8A
    • /
    • pp.683-690
    • /
    • 2011
  • The conventional sensor tag data filtering algorithm uses time window based data filtering for each tag data. However, this approach shows many performance problems such as low error and event detection rate and larger storage size requirement. In this paper, we propose a collaborative sensor tag data filtering algorithm to improve sensor data processing performance. simulation study shows that the proposed sensor tag filtering algorithm outperforms the conventional filtering algorithm in terms of the processing time, the size of required data storage memory and accuracy of error and event detection rate.

An Efficient Central Queue Management Algorithm for High-speed Parallel Packet Filtering (고속 병렬 패킷 여과를 위한 효율적인 단일버퍼 관리 방안)

  • 임강빈;박준구;최경희;정기현
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.7
    • /
    • pp.63-73
    • /
    • 2004
  • This paper proposes an efficient centralized sin91e buffer management algorithm to arbitrate access contention mon processors on the multi-processor system for high-speed Packet filtering and proves that the algorithm provides reasonable performance by implementing it and applying it to a real multi-processor system. The multi-processor system for parallel packet filtering is modeled based on a network processor to distribute the packet filtering rules throughout the processors to speed up the filtering. In this paper we changed the number of processors and the processing time of the filtering rules as variables and measured the packet transfer rates to investigate the performance of the proposed algorithm.

Short-term Water Demand Forecasting Algorithm Based on Kalman Filtering with Data Mining (데이터 마이닝과 칼만필터링에 기반한 단기 물 수요예측 알고리즘)

  • Choi, Gee-Seon;Shin, Gang-Wook;Lim, Sang-Heui;Chun, Myung-Geun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1056-1061
    • /
    • 2009
  • This paper proposes a short-term water demand forecasting algorithm based on kalman filtering with data mining for sustainable water supply and effective energy saving. The proposed algorithm utilizes a mining method of water supply data and a decision tree method with special days like Chuseok. And the parameters of MLAR (Multi Linear Auto Regression) model are estimated by Kalman filtering algorithm. Thus, we can achieve the practicality of the proposed forecasting algorithm through the good results applied to actual operation data.