Evolutionary clustering. Chakrabarti, D., Kumar, R., & Tomkins, A. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, of KDD '06, pages 554–560, New York, NY, USA, 2006. ACM. ![Evolutionary clustering [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex We consider the problem of clustering data over time. An evolutionary clustering should simultaneously optimize two potentially conflicting criteria: first, the clustering at any point in time should remain faithful to the current data as much as possible; and second, the clustering should not shift dramatically from one timestep to the next. We present a generic framework for this problem, and discuss evolutionary versions of two widely-used clustering algorithms within this framework: k-means and agglomerative hierarchical clustering. We extensively evaluate these algorithms on real data sets and show that our algorithms can simultaneously attain both high accuracy in capturing today's data, and high fidelity in reflecting yesterday's clustering.
@inproceedings{Chakrabarti:2006:EC:1150402.1150467,
abstract = {We consider the problem of clustering data over time. An <i>evolutionary clustering</i> should simultaneously optimize two potentially conflicting criteria: first, the clustering at any point in time should remain faithful to the current data as much as possible; and second, the clustering should not shift dramatically from one timestep to the next. We present a generic framework for this problem, and discuss evolutionary versions of two widely-used clustering algorithms within this framework: <i>k</i>-means and agglomerative hierarchical clustering. We extensively evaluate these algorithms on real data sets and show that our algorithms can simultaneously attain both high accuracy in capturing today's data, and high fidelity in reflecting yesterday's clustering.},
acmid = {1150467},
added-at = {2013-04-08T10:59:22.000+0200},
address = {New York, NY, USA},
author = {Chakrabarti, Deepayan and Kumar, Ravi and Tomkins, Andrew},
biburl = {https://www.bibsonomy.org/bibtex/2f4370d207b30cd8c3be3f3d6c304c548/becker},
booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
description = {Evolutionary clustering},
doi = {10.1145/1150402.1150467},
interhash = {0b224eaab5e2b15eb6d6ec9285bd4f82},
intrahash = {f4370d207b30cd8c3be3f3d6c304c548},
isbn = {1-59593-339-5},
keywords = {clustering thema thema:evolutionary_clustering main evolutionary},
location = {Philadelphia, PA, USA},
numpages = {7},
pages = {554--560},
publisher = {ACM},
series = {KDD '06},
timestamp = {2013-04-19T09:35:25.000+0200},
title = {Evolutionary clustering},
url = {http://doi.acm.org/10.1145/1150402.1150467},
year = 2006
}
Downloads: 0
{"_id":"J9nKhF2DqgfLRDmYX","bibbaseid":"chakrabarti-kumar-tomkins-evolutionaryclustering-2006","author_short":["Chakrabarti, D.","Kumar, R.","Tomkins, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"We consider the problem of clustering data over time. An <i>evolutionary clustering</i> should simultaneously optimize two potentially conflicting criteria: first, the clustering at any point in time should remain faithful to the current data as much as possible; and second, the clustering should not shift dramatically from one timestep to the next. We present a generic framework for this problem, and discuss evolutionary versions of two widely-used clustering algorithms within this framework: <i>k</i>-means and agglomerative hierarchical clustering. We extensively evaluate these algorithms on real data sets and show that our algorithms can simultaneously attain both high accuracy in capturing today's data, and high fidelity in reflecting yesterday's clustering.","acmid":"1150467","added-at":"2013-04-08T10:59:22.000+0200","address":"New York, NY, USA","author":[{"propositions":[],"lastnames":["Chakrabarti"],"firstnames":["Deepayan"],"suffixes":[]},{"propositions":[],"lastnames":["Kumar"],"firstnames":["Ravi"],"suffixes":[]},{"propositions":[],"lastnames":["Tomkins"],"firstnames":["Andrew"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2f4370d207b30cd8c3be3f3d6c304c548/becker","booktitle":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining","description":"Evolutionary clustering","doi":"10.1145/1150402.1150467","interhash":"0b224eaab5e2b15eb6d6ec9285bd4f82","intrahash":"f4370d207b30cd8c3be3f3d6c304c548","isbn":"1-59593-339-5","keywords":"clustering thema thema:evolutionary_clustering main evolutionary","location":"Philadelphia, PA, USA","numpages":"7","pages":"554–560","publisher":"ACM","series":"KDD '06","timestamp":"2013-04-19T09:35:25.000+0200","title":"Evolutionary clustering","url":"http://doi.acm.org/10.1145/1150402.1150467","year":"2006","bibtex":"@inproceedings{Chakrabarti:2006:EC:1150402.1150467,\n abstract = {We consider the problem of clustering data over time. An <i>evolutionary clustering</i> should simultaneously optimize two potentially conflicting criteria: first, the clustering at any point in time should remain faithful to the current data as much as possible; and second, the clustering should not shift dramatically from one timestep to the next. We present a generic framework for this problem, and discuss evolutionary versions of two widely-used clustering algorithms within this framework: <i>k</i>-means and agglomerative hierarchical clustering. We extensively evaluate these algorithms on real data sets and show that our algorithms can simultaneously attain both high accuracy in capturing today's data, and high fidelity in reflecting yesterday's clustering.},\n acmid = {1150467},\n added-at = {2013-04-08T10:59:22.000+0200},\n address = {New York, NY, USA},\n author = {Chakrabarti, Deepayan and Kumar, Ravi and Tomkins, Andrew},\n biburl = {https://www.bibsonomy.org/bibtex/2f4370d207b30cd8c3be3f3d6c304c548/becker},\n booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},\n description = {Evolutionary clustering},\n doi = {10.1145/1150402.1150467},\n interhash = {0b224eaab5e2b15eb6d6ec9285bd4f82},\n intrahash = {f4370d207b30cd8c3be3f3d6c304c548},\n isbn = {1-59593-339-5},\n keywords = {clustering thema thema:evolutionary_clustering main evolutionary},\n location = {Philadelphia, PA, USA},\n numpages = {7},\n pages = {554--560},\n publisher = {ACM},\n series = {KDD '06},\n timestamp = {2013-04-19T09:35:25.000+0200},\n title = {Evolutionary clustering},\n url = {http://doi.acm.org/10.1145/1150402.1150467},\n year = 2006\n}\n\n","author_short":["Chakrabarti, D.","Kumar, R.","Tomkins, A."],"key":"Chakrabarti:2006:EC:1150402.1150467","id":"Chakrabarti:2006:EC:1150402.1150467","bibbaseid":"chakrabarti-kumar-tomkins-evolutionaryclustering-2006","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/1150402.1150467"},"keyword":["clustering thema thema:evolutionary_clustering main evolutionary"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/ravi Kumar?items=1000","dataSources":["DiSHMj5oiLBLaqrYP"],"keywords":["clustering thema thema:evolutionary_clustering main evolutionary"],"search_terms":["evolutionary","clustering","chakrabarti","kumar","tomkins"],"title":"Evolutionary clustering","year":2006}