RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Study of Traveling Partners’ Discovery Algorithm Based Closed Clustering and Intersecting

        Kongfa Hu,Jiadong Xie,Chengjun Hu,Tao Yang,Yuqing Mao,Yun Hu,Long Li 보안공학연구지원센터 2016 International Journal of Hybrid Information Techno Vol.9 No.6

        As the rapid development of IOT (the Internet of Things), RFID technology has been widely applied, and it generates a large of RFID trajectory stream data with the spatial-temporal characteristic. Because RFID has many characteristics, it leads to become very difficult that extracting moving objects groups that together moving (ie. traveling partners) in a period of time from RFID trajectory stream data. Existing methods are difficult to efficiently find this model. This paper presents a closed clustering and intersecting algorithm (CCI) for RFID data to detect movement along traveling partners, which is mainly constituted by two steps: first step is clustering sub-trajectory, it generates sub-trajectory clusters; second step is intersecting sub-trajectories with the traveling partners’ candidate set to improve the candidate set, and find out traveling partners. In this process, we use the principle of Closure to accelerate our processing. Through experiments on the RFID synthetic dataset, we demonstrate the effectiveness and efficiency of our algorithm, thus show that our algorithm is suitable for discovering traveling partners in RFID applications.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼