Clustering based on Dependence Tree in Massive Data Streams

홈 > 연구문헌 > 영문 논문지 > JICCE (한국정보통신학회)

한글제목(Korean Title)	Clustering based on Dependence Tree in Massive Data Streams
영문제목(English Title)	Clustering based on Dependence Tree in Massive Data Streams
저자(Author)	Hong-won Yun
원문수록처(Citation)	VOL 06 NO. 02 PP. 0182 ~ 0186 (2008. 06)
한글내용 (Korean Abstract)
영문내용 (English Abstract)	RFID systems generate huge amount of data quickly. The data are associated with the locations and the timestamps and the containment relationships. It is requires to assure efficient queries and updates for product tracking and monitoring. We propose a clustering technique for fast query processing. Our study presents the state charts of temporal event flow and proposes the dependence trees with data association and uses them to cluster the linked events. Our experimental evaluation show the power of proposing clustering technique based on dependence tree.
키워드(Keyword)	Clustering RFID Data Data Association Dependence tree
파일첨부	PDF 다운로드