earticle

논문검색

Sensitive Distance Estimates Technique Analysis for Continuously K-Nearest Neighbors Query in Multi-Stream Processing

초록

영어

In many real-world applications, data streams are usually collected in a decentralized manner such like sensor network, ubiquities sensor network, internet traffic analysis, and so on. In particularly, requirements for continuous, fast, high-volumes, adaptability, costly streaming data, an approximated analysis is needful for fast response to users on forward predicates. Distance estimate for both of “continuously” queries and streams is still a more challenge area because of a smaller or larger threshold selected is very easily to lead to a wrong result for continuously k-nearest neighbor queries. Therefore, we proposed a required filtering method to help to choose a well threshold of distance estimate in order to control error rates of approximated answers.

목차

Abstract
 1. Introduction
 2. Framework Overview
  2.1. Q-Filtering Test Model
  2.2. FH-transform
 3. Experiment and Evaluation
  3.1. Results for Q-filtering
 4. Conclusion
 Acknowledgements
 References

저자정보

  • Ling Wang Database/Bioinformatics Laboratory, School of Electrical & Computer Engineering, Chungbuk National University, Chungbuk, Korea
  • Tie Hua Zhou Database/Bioinformatics Laboratory, School of Electrical & Computer Engineering, Chungbuk National University, Chungbuk, Korea
  • Kyung Joo Cheoi Department of Computer Science, School of Electrical & Computer Engineering, Chungbuk National University, Chungbuk, Korea
  • Kwang Deuk Kim Korea Institute of Energy Research, Daejeon, Korea
  • Keun Ho Ryu Database/Bioinformatics Laboratory, School of Electrical & Computer Engineering, Chungbuk National University, Chungbuk, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.