rDenStream, A Clustering Algorithm over an Evolving Data Stream. Liu, L., Huang, H., Guo, Y., & Chen, F. In 2009 International Conference on Information Engineering and Computer Science, pages 1–4, December, 2009. ISSN: 2156-7387doi abstract bibtex For mining new pattern from evolving data streams, most algorithms are inherited from DenStream framework which is realized via a sliding window. So at the early stage of a pattern emerges, its knowledge points can be easily mistaken as outliers and dropped. In most cases, these points can be ignored, but in some special applications which need to quickly and precisely master the emergence rule of some patterns, these points must play their rules. Based on DenStream, this paper proposes a three-step clustering algorithm, rDenStream, which presents the concept of outlier retrospect. In rDenStream clustering, dropped micro-clusters are stored on outside memory temporarily, and will be given new chance to attend clustering to improve the clustering accuracy. Experiments modeled the arrival of data stream in Poisson process, and the results over standard data set showed its advantage over other methods in the early phase of new pattern discovery.
@inproceedings{liu_rdenstream_2009,
title = {{rDenStream}, {A} {Clustering} {Algorithm} over an {Evolving} {Data} {Stream}},
doi = {10.1109/ICIECS.2009.5363379},
abstract = {For mining new pattern from evolving data streams, most algorithms are inherited from DenStream framework which is realized via a sliding window. So at the early stage of a pattern emerges, its knowledge points can be easily mistaken as outliers and dropped. In most cases, these points can be ignored, but in some special applications which need to quickly and precisely master the emergence rule of some patterns, these points must play their rules. Based on DenStream, this paper proposes a three-step clustering algorithm, rDenStream, which presents the concept of outlier retrospect. In rDenStream clustering, dropped micro-clusters are stored on outside memory temporarily, and will be given new chance to attend clustering to improve the clustering accuracy. Experiments modeled the arrival of data stream in Poisson process, and the results over standard data set showed its advantage over other methods in the early phase of new pattern discovery.},
booktitle = {2009 {International} {Conference} on {Information} {Engineering} and {Computer} {Science}},
author = {Liu, Li-xiong and Huang, Hai and Guo, Yun-fei and Chen, Fu-cai},
month = dec,
year = {2009},
note = {ISSN: 2156-7387},
keywords = {Analytical models, Clustering algorithms, Computational modeling, Data engineering, Intrusion detection, Mathematics, Partitioning algorithms, Research and development, Switching systems, Systems engineering and theory},
pages = {1--4},
}
Downloads: 0
{"_id":"hzFEyptH9Brsphspw","bibbaseid":"liu-huang-guo-chen-rdenstreamaclusteringalgorithmoveranevolvingdatastream-2009","author_short":["Liu, L.","Huang, H.","Guo, Y.","Chen, F."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"rDenStream, A Clustering Algorithm over an Evolving Data Stream","doi":"10.1109/ICIECS.2009.5363379","abstract":"For mining new pattern from evolving data streams, most algorithms are inherited from DenStream framework which is realized via a sliding window. So at the early stage of a pattern emerges, its knowledge points can be easily mistaken as outliers and dropped. In most cases, these points can be ignored, but in some special applications which need to quickly and precisely master the emergence rule of some patterns, these points must play their rules. Based on DenStream, this paper proposes a three-step clustering algorithm, rDenStream, which presents the concept of outlier retrospect. In rDenStream clustering, dropped micro-clusters are stored on outside memory temporarily, and will be given new chance to attend clustering to improve the clustering accuracy. Experiments modeled the arrival of data stream in Poisson process, and the results over standard data set showed its advantage over other methods in the early phase of new pattern discovery.","booktitle":"2009 International Conference on Information Engineering and Computer Science","author":[{"propositions":[],"lastnames":["Liu"],"firstnames":["Li-xiong"],"suffixes":[]},{"propositions":[],"lastnames":["Huang"],"firstnames":["Hai"],"suffixes":[]},{"propositions":[],"lastnames":["Guo"],"firstnames":["Yun-fei"],"suffixes":[]},{"propositions":[],"lastnames":["Chen"],"firstnames":["Fu-cai"],"suffixes":[]}],"month":"December","year":"2009","note":"ISSN: 2156-7387","keywords":"Analytical models, Clustering algorithms, Computational modeling, Data engineering, Intrusion detection, Mathematics, Partitioning algorithms, Research and development, Switching systems, Systems engineering and theory","pages":"1–4","bibtex":"@inproceedings{liu_rdenstream_2009,\n\ttitle = {{rDenStream}, {A} {Clustering} {Algorithm} over an {Evolving} {Data} {Stream}},\n\tdoi = {10.1109/ICIECS.2009.5363379},\n\tabstract = {For mining new pattern from evolving data streams, most algorithms are inherited from DenStream framework which is realized via a sliding window. So at the early stage of a pattern emerges, its knowledge points can be easily mistaken as outliers and dropped. In most cases, these points can be ignored, but in some special applications which need to quickly and precisely master the emergence rule of some patterns, these points must play their rules. Based on DenStream, this paper proposes a three-step clustering algorithm, rDenStream, which presents the concept of outlier retrospect. In rDenStream clustering, dropped micro-clusters are stored on outside memory temporarily, and will be given new chance to attend clustering to improve the clustering accuracy. Experiments modeled the arrival of data stream in Poisson process, and the results over standard data set showed its advantage over other methods in the early phase of new pattern discovery.},\n\tbooktitle = {2009 {International} {Conference} on {Information} {Engineering} and {Computer} {Science}},\n\tauthor = {Liu, Li-xiong and Huang, Hai and Guo, Yun-fei and Chen, Fu-cai},\n\tmonth = dec,\n\tyear = {2009},\n\tnote = {ISSN: 2156-7387},\n\tkeywords = {Analytical models, Clustering algorithms, Computational modeling, Data engineering, Intrusion detection, Mathematics, Partitioning algorithms, Research and development, Switching systems, Systems engineering and theory},\n\tpages = {1--4},\n}\n\n","author_short":["Liu, L.","Huang, H.","Guo, Y.","Chen, F."],"key":"liu_rdenstream_2009","id":"liu_rdenstream_2009","bibbaseid":"liu-huang-guo-chen-rdenstreamaclusteringalgorithmoveranevolvingdatastream-2009","role":"author","urls":{},"keyword":["Analytical models","Clustering algorithms","Computational modeling","Data engineering","Intrusion detection","Mathematics","Partitioning algorithms","Research and development","Switching systems","Systems engineering and theory"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["analytical models","clustering algorithms","computational modeling","data engineering","intrusion detection","mathematics","partitioning algorithms","research and development","switching systems","systems engineering and theory"],"search_terms":["rdenstream","clustering","algorithm","over","evolving","data","stream","liu","huang","guo","chen"],"title":"rDenStream, A Clustering Algorithm over an Evolving Data Stream","year":2009}