@article{zhou_tracking_2008,
	title = {Tracking clusters in evolving data streams over sliding windows},
	volume = {15},
	issn = {0219-3116},
	url = {https://doi.org/10.1007/s10115-007-0070-x},
	doi = {10.1007/s10115-007-0070-x},
	abstract = {Mining data streams poses great challenges due to the limited memory availability and real-time query response requirement. Clustering an evolving data stream is especially interesting because it captures not only the changing distribution of clusters but also the evolving behaviors of individual clusters. In this paper, we present a novel method for tracking the evolution of clusters over sliding windows. In our SWClustering algorithm, we combine the exponential histogram with the temporal cluster features, propose a novel data structure, the Exponential Histogram of Cluster Features (EHCF). The exponential histogram is used to handle the in-cluster evolution, and the temporal cluster features represent the change of the cluster distribution. Our approach has several advantages over existing methods: (1) the quality of the clusters is improved because the EHCF captures the distribution of recent records precisely; (2) compared with previous methods, the mechanism employed to adaptively maintain the in-cluster synopsis can track the cluster evolution better, while consuming much less memory; (3) the EHCF provides a flexible framework for analyzing the cluster evolution and tracking a specific cluster efficiently without interfering with other clusters, thus reducing the consumption of computing resources for data stream clustering. Both the theoretical analysis and extensive experiments show the effectiveness and efficiency of the proposed method.},
	language = {en},
	number = {2},
	urldate = {2022-03-27},
	journal = {Knowledge and Information Systems},
	author = {Zhou, Aoying and Cao, Feng and Qian, Weining and Jin, Cheqing},
	month = may,
	year = {2008},
	pages = {181--214},
}

{"_id":"6AiCYZ9GT3sKCsLNN","bibbaseid":"zhou-cao-qian-jin-trackingclustersinevolvingdatastreamsoverslidingwindows-2008","author_short":["Zhou, A.","Cao, F.","Qian, W.","Jin, C."],"bibdata":{"bibtype":"article","type":"article","title":"Tracking clusters in evolving data streams over sliding windows","volume":"15","issn":"0219-3116","url":"https://doi.org/10.1007/s10115-007-0070-x","doi":"10.1007/s10115-007-0070-x","abstract":"Mining data streams poses great challenges due to the limited memory availability and real-time query response requirement. Clustering an evolving data stream is especially interesting because it captures not only the changing distribution of clusters but also the evolving behaviors of individual clusters. In this paper, we present a novel method for tracking the evolution of clusters over sliding windows. In our SWClustering algorithm, we combine the exponential histogram with the temporal cluster features, propose a novel data structure, the Exponential Histogram of Cluster Features (EHCF). The exponential histogram is used to handle the in-cluster evolution, and the temporal cluster features represent the change of the cluster distribution. Our approach has several advantages over existing methods: (1) the quality of the clusters is improved because the EHCF captures the distribution of recent records precisely; (2) compared with previous methods, the mechanism employed to adaptively maintain the in-cluster synopsis can track the cluster evolution better, while consuming much less memory; (3) the EHCF provides a flexible framework for analyzing the cluster evolution and tracking a specific cluster efficiently without interfering with other clusters, thus reducing the consumption of computing resources for data stream clustering. Both the theoretical analysis and extensive experiments show the effectiveness and efficiency of the proposed method.","language":"en","number":"2","urldate":"2022-03-27","journal":"Knowledge and Information Systems","author":[{"propositions":[],"lastnames":["Zhou"],"firstnames":["Aoying"],"suffixes":[]},{"propositions":[],"lastnames":["Cao"],"firstnames":["Feng"],"suffixes":[]},{"propositions":[],"lastnames":["Qian"],"firstnames":["Weining"],"suffixes":[]},{"propositions":[],"lastnames":["Jin"],"firstnames":["Cheqing"],"suffixes":[]}],"month":"May","year":"2008","pages":"181–214","bibtex":"@article{zhou_tracking_2008,\n\ttitle = {Tracking clusters in evolving data streams over sliding windows},\n\tvolume = {15},\n\tissn = {0219-3116},\n\turl = {https://doi.org/10.1007/s10115-007-0070-x},\n\tdoi = {10.1007/s10115-007-0070-x},\n\tabstract = {Mining data streams poses great challenges due to the limited memory availability and real-time query response requirement. Clustering an evolving data stream is especially interesting because it captures not only the changing distribution of clusters but also the evolving behaviors of individual clusters. In this paper, we present a novel method for tracking the evolution of clusters over sliding windows. In our SWClustering algorithm, we combine the exponential histogram with the temporal cluster features, propose a novel data structure, the Exponential Histogram of Cluster Features (EHCF). The exponential histogram is used to handle the in-cluster evolution, and the temporal cluster features represent the change of the cluster distribution. Our approach has several advantages over existing methods: (1) the quality of the clusters is improved because the EHCF captures the distribution of recent records precisely; (2) compared with previous methods, the mechanism employed to adaptively maintain the in-cluster synopsis can track the cluster evolution better, while consuming much less memory; (3) the EHCF provides a flexible framework for analyzing the cluster evolution and tracking a specific cluster efficiently without interfering with other clusters, thus reducing the consumption of computing resources for data stream clustering. Both the theoretical analysis and extensive experiments show the effectiveness and efficiency of the proposed method.},\n\tlanguage = {en},\n\tnumber = {2},\n\turldate = {2022-03-27},\n\tjournal = {Knowledge and Information Systems},\n\tauthor = {Zhou, Aoying and Cao, Feng and Qian, Weining and Jin, Cheqing},\n\tmonth = may,\n\tyear = {2008},\n\tpages = {181--214},\n}\n\n","author_short":["Zhou, A.","Cao, F.","Qian, W.","Jin, C."],"key":"zhou_tracking_2008","id":"zhou_tracking_2008","bibbaseid":"zhou-cao-qian-jin-trackingclustersinevolvingdatastreamsoverslidingwindows-2008","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10115-007-0070-x"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":[],"search_terms":["tracking","clusters","evolving","data","streams","over","sliding","windows","zhou","cao","qian","jin"],"title":"Tracking clusters in evolving data streams over sliding windows","year":2008}