Earticle

초록

영어

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 ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605