{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T21:04:29Z","timestamp":1780693469410,"version":"3.54.1"},"publisher-location":"New York, NY","reference-count":157,"publisher":"Springer New York","isbn-type":[{"value":"9781493920914","type":"print"},{"value":"9781493920921","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-1-4939-2092-1_38","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T09:30:47Z","timestamp":1426498247000},"page":"1109-1152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Data Summarization Techniques for Big Data\u2014A Survey"],"prefix":"10.1007","author":[{"given":"Z. R.","family":"Hesabi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Z.","family":"Tari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Goscinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Fahad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I.","family":"Khalil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Queiroz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"A. Hathaway, J. Bezdek, and Y. Hu, \u201cGeneralized fuzzyc-means clustering strategies using Lnorm distances,\u201d IEEE Transaction on Fuzzy Systems, 8(5):576\u2013582, October 2000.","DOI":"10.1109\/91.873580"},{"key":"38_CR2","unstructured":"J. MacQueen, \u201cSome methods for classification and analysis of multivariate observations,\u201d in Proc. 5th Berkeley Sympium, 1:281\u2013297, 1967."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"G. Carpenter, S. Grossberg, and D. Rosen, \u201cFuzzy ART: Fast stable learning and categorization of analog patterns by an adaptive resonance system,\u201d Neural Network, 4:759\u2013771, 1991.","DOI":"10.1016\/0893-6080(91)90056-B"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"G. Anagnostopoulos and M. Georgiopoulos, \u201cEllipsoid ART and ARTMAP for incremental unsupervised and supervised learning,\u201d Proceedings of IEEE International Joint Conference Neural Networks (IJCNN\u201901), Washington DC, pp.\u00a01221\u20131226, 2001.","DOI":"10.1109\/IJCNN.2001.939535"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"J. Mao and A. Jain, \u201cA self-organizing network for hyperellipsoidal clustering (HEC),\u201d IEEE Transactions Neural Networks, 7(1):16\u201329, January 1996.","DOI":"10.1109\/72.478389"},{"key":"38_CR6","unstructured":"C. Van Rijsbergen, \u201cInformation Retrieval,\u201d Butterworth-Heinemann, 1979."},{"key":"38_CR7","unstructured":"J. Cezkanowski, \u201cZur differentialdiagnose der neandertalgruppe. KorrespondenzBlatt deutsch. Ges. Anthropol,\u201d Ethnol. Urgesch, 40:44\u201347, 1909."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"R. Whittaker, \u201cA study of summer foliage insect communities in the Great Smoky Mountains,\u201d Ecological Monographs, 22:1\u201344, 1952.","DOI":"10.2307\/1948527"},{"key":"38_CR9","unstructured":"L. Legendre and P. Legendre, \u201cNumerical ecology,\u201d New York: Elsevier Scientific, 1983."},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"R. Johnson and D. Wichern, \u201cApplied multivariate statistical analysis,\u201d Englewood Cliffs, NJ: Prentice\u2013Hall, 1998.","DOI":"10.2307\/2533879"},{"key":"38_CR11","unstructured":"P.F. Russel and T. R. Rao, \u201cOn habitat and association of species of anopheline larvae in south-eastern Madras,\u201d Journal of Malaria India Institute (3):153\u2013178, 1940."},{"key":"38_CR12","unstructured":"R.R. Sokal and C. D. Michener, \u201cA statistical method for evaluating systematic relationships,\u201d Bulletin of the Society of University of Kansas, 38:1409\u20131438, 1958."},{"key":"38_CR13","unstructured":"P. Jaccard, \u201c\u00c9tude comparative de la distribuition florale dans une portion des Alpes et de Jura,\u201d Bulletin de la Societ\u00e9 Voudoise des Sciences Naturelles, 37:547\u2013579, 1901."},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"J.S. Rogers and T. T. Tanimoto, \u201cA computer program for classifying plants,\u201d Science, 132:1115\u20131118, 1960.","DOI":"10.1126\/science.132.3434.1115"},{"key":"38_CR15","unstructured":"S. Kulczynski, \u201cClasse des Sciences Math\u00e9matiques et Naturelles, \u201d Bulletin International de l\u02bcAcadamie Polonaise des Sciences et des Lettres S\u00e9rie B (Sciences Naturelles) (Supplement II), pp.\u00a057\u2013203, 1927."},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"J. Tubbs, \u201cA note on binary template matching,\u201d Pattern Recognition, 22(4):359\u2013365, 1989.","DOI":"10.1016\/0031-3203(89)90045-9"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"L. Kaufman and P. Rousseeuw, \u201cFinding Groups in Data: An Introduction to Cluster Analysis,\u201d Wiley, 1990.","DOI":"10.1002\/9780470316801"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"B. Everitt, S. Landau, and M. Leese, \u201cCluster Analysis,\u201d London:Arnold, 2001.","DOI":"10.1002\/9781118887486.ch6"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"P. Sneath, \u201cThe application of computers to taxonomy,\u201d J. Gen. Microbiology, 17:201\u2013226, 1957.","DOI":"10.1099\/00221287-17-1-201"},{"key":"38_CR20","unstructured":"T. Sorensen, \u201cA method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyzes of the vegetation on Danish commons,\u201d Biologiske Skrifter, 5:1\u201334, 1948."},{"key":"38_CR21","unstructured":"A. Jain and R. Dubes, \u201cAlgorithms for clustering data,\u201d Englewood Cliffs, NJ: Prentice\u2013Hall, 1988."},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, and M. Livny, \u201cBIRCH: An efficient data clustering method for very large databases,\u201d Proceedings of ACM International Conference Management of Data (SIGMOD), pp.\u00a0103\u2013114, 1996.","DOI":"10.1145\/235968.233324"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"T. Chiu, D. Fang, J. Chen, Y. Wang and C. Jeris, \u201cA robust and scalable clustering algorithm for mixed type attributes in large database environment,\u201d Proceedings of 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a0263\u2013268, 2001.","DOI":"10.1145\/502512.502549"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"V. Ganti, R. Ramakrishnan, J. Gehrke, A. Powell, and J. French, \u201cClustering large datasets in arbitrary metric spaces,\u201d Proceedings of the 15th International Conference on Data Engineering (ICDE), pp.\u00a0502\u2013511, 1999.","DOI":"10.1109\/ICDE.1999.754966"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi, and K. Shim, \u201cCURE: An efficient clustering algorithm for large databases,\u201d Proc. ACM SIGMOD International Conference Management of Data, pp.\u00a073\u201384, 1998.","DOI":"10.1145\/276305.276312"},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi, and K. Shim, \u201cROCK: A robust clustering algorithm for categorical attributes,\u201d Information Systems, 25(5):345\u2013366, 2000.","DOI":"10.1016\/S0306-4379(00)00022-3"},{"key":"38_CR27","unstructured":"E. Forgy, \u201cCluster analysis of multivariate data: efficiency vs. interpretability of classifications,\u201d Biometrics, 21:768\u2013780, 1965."},{"key":"38_CR28","unstructured":"J. MacQueen, \u201cSome methods for classification and analysis of multivariate observations,\u201d Proceedings of 5th Berkeley Symposium, 1:281\u2013297, 1976."},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"J. Mao and A.K. Jain, \u201cA Self-organizing network for hyperellipsoidal clustering (HEC),\u201d IEEE Transactions on Neural Networks, 7(1):16\u201329, 1996.","DOI":"10.1109\/72.478389"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"J. Dunn, \u201cA fuzzy relative of the ISODATA process and its use in detecting compact well separated clusters,\u201d Journal of Cybernetic, 3(3):32\u201357, 1974.","DOI":"10.1080\/01969727308546046"},{"key":"38_CR31","unstructured":"E. Forgy, \u201cCluster analysis of multivariate data: Efficiency versus interpretability of classification,\u201d Biometrics, 21:768\u2013780, 1965."},{"key":"38_CR32","doi-asserted-by":"crossref","unstructured":"J. Dunn, \u201cA fuzzy relative of the ISODATA process and its use in detecting compact well separated clusters,\u201d Journal of Cybernetics, 3(3):32\u201357, 1974.","DOI":"10.1080\/01969727308546046"},{"key":"38_CR33","doi-asserted-by":"crossref","unstructured":"J. Bezdek, \u201cPattern Recognition with fuzzy objective function algorithms,\u201d New York: Plenum, 1981.","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"38_CR34","doi-asserted-by":"crossref","unstructured":"S. Eschrich, J. Ke, J. Hall and D. Goldgof, \u201cFast accurate fuzzy clustering through data reduction,\u201d IEEE Transactions on Fuzzy Systems, 11 (2):262\u2013270, 2003.","DOI":"10.1109\/TFUZZ.2003.809902"},{"key":"38_CR35","unstructured":"M. Steinbach, G. Karypis, and V. Kumar, \u201cA comparison of document clustering techniques,\u201d KDD Workshop on Text Mining, 2000."},{"key":"38_CR36","doi-asserted-by":"crossref","unstructured":"D. Pelleg and A. Moore, \u201cAccelerating exact K-means algorithms with geometric reasoning,\u201d Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.277\u2013281, 1999.","DOI":"10.1145\/312129.312248"},{"key":"38_CR37","unstructured":"D. Pelleg and A. Moore, \u201cX-means: extending K-means with efficient estimation of the number of clusters,\u201d Proceedings 17th International Conference on Machine Learning (ICML), Stanford University, 2000."},{"key":"38_CR38","unstructured":"B. Sch\u00f6lkopf, C. Burges, and A. Smola, \u201cAdvances in kernel methods: support vector learning,\u201d The MIT Press, 1999."},{"key":"38_CR39","doi-asserted-by":"crossref","unstructured":"L. Kaufman and P. Rousseeuw, \u201cFinding groups in data: an introduction to cluster analysis,\u201d John Wiley and Sons, New York, NY, 1990.","DOI":"10.1002\/9780470316801"},{"key":"38_CR40","unstructured":"R. Ng and J. Han, \u201cEfficient and effective clustering methods for spatial data mining,\u201d Proceedings of the 20th International Conference on Very Large Databases (VLDB), pp.144\u2013155, Santiago, Chile, 1994."},{"key":"38_CR41","unstructured":"M. Ester, H-P. Kriegel, J. Sander, and X. Xu, \u201cA density-based algorithm for discovering clusters in large spatial databases with noise,\u201d Proceedings of the 2nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a0226\u2013231, Portland, Oregon, 1996."},{"key":"38_CR42","unstructured":"X. Xu, M. Ester, H-P. Kriegel, and J. Sander, \u201cA distribution-based clustering algorithm for mining in large spatial databases,\u201d Proceedings of the 14th International Conference on Data Engineering (ICDE), 324\u2013331, Orlando, FL, 1998."},{"key":"38_CR43","doi-asserted-by":"crossref","unstructured":"J. Sander, M. Ester, H-P. Kriegel, and X. Xu, \u201cDensity-based clustering in spatial databases: the algorithm GDBSCAN and its applications,\u201d Data Mining and Knowledge Discovery, 2(2):169\u2013194, 1998.","DOI":"10.1023\/A:1009745219419"},{"key":"38_CR44","unstructured":"A. Hinneburg and D. Keim, \u201cAn efficient approach to clustering large multimedia databases with noise,\u201d Proceedings of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a058\u201365, 1998."},{"key":"38_CR45","doi-asserted-by":"crossref","unstructured":"M. Ankerst, M. Breunig, and H-P. Kriegel, K. Sander, \u201cOPTICS: Ordering points to identify clustering structure,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.\u00a049\u201360, 1999.","DOI":"10.1145\/304181.304187"},{"key":"38_CR46","unstructured":"P. Grabusts and Borisov, \u201cA Using grid-clustering methods in data classification,\u201d Proceedings of the IEEE International Conference on Parallel Computing in Electrical Engineering (PARELEC), 2002."},{"key":"38_CR47","doi-asserted-by":"crossref","unstructured":"F. Murtagh and P. Contreras, \u201cMethods of Hierarchical Clustering,\u201d CSIR, 2011.","DOI":"10.1007\/978-3-642-04898-2_288"},{"key":"38_CR48","unstructured":"S.A. Elavarasi, J. Akilandeswari, B. Sathiyabhama, \u201cA survey on partition clustering algorithms,\u201d International Journal of Enterprise Computing and Business Systems, 2011."},{"key":"38_CR49","unstructured":"W. Wang, J. Yang, and R. Muntz, \u201cSTING: a statistical information grid approach to spatial data mining,\u201d, Proceedings of the 23rd International Conference on Very Large Databases (VLDB), pp.\u00a018\u2013195, 1997."},{"key":"38_CR50","doi-asserted-by":"crossref","unstructured":"G. Sheikholeslami, S. Chatterjee, and A. Zhang, \u201cWavecluster: a wavelet based clustering approach for spatial data in very large databases,\u201d The VLDB Journal, 8(3\u20134):289\u2013304, 2000.","DOI":"10.1007\/s007780050009"},{"key":"38_CR51","doi-asserted-by":"crossref","unstructured":"E. Schikuta, \u201cGrid-clustering: An efficient hierarchical clustering method for very large data sets,\u201d Proceedings of the 13th IEEE International Conference on Pattern Recognition, pp.\u00a0101\u2013105, 1996","DOI":"10.1109\/ICPR.1996.546732"},{"key":"38_CR52","doi-asserted-by":"crossref","unstructured":"D. Barbar and P. Chen, \u201cUsing the fractal dimension to cluster datasets,\u201d Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a0260\u2013264, 2000.","DOI":"10.1145\/347090.347145"},{"key":"38_CR53","unstructured":"A. Hinneburg and D. Keim, \u201cOptimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering,\u201d Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), pp.\u00a0506\u2013517, 1999."},{"key":"38_CR54","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, \u201cAutomatic subspace clustering of high dimensional data for data mining applications,\u201d Proc. ACM SIGMOD Int. Conf. Management of Data, pp.\u00a094\u2013105, 1998.","DOI":"10.1145\/276305.276314"},{"key":"38_CR55","unstructured":"P. Berkhin, \u201cSurvey of clustering data mining techniques,\u201d Technical report, Accrue Software, San Jose, California, 2002."},{"key":"38_CR56","unstructured":"P. Kaur and S. Aggrawal, \u201cComparative study of clustering techniques,\u201d International Journal on Advanced Research in Engineering and Technology, 1:69\u201375, 2013."},{"key":"38_CR57","doi-asserted-by":"crossref","unstructured":"R. Xu and D. Wunsch, \u201cSurvey of clustering algorithms,\u201d IEEE Transactions on Neural Networks, 16(3):645\u2013678, 2005.","DOI":"10.1109\/TNN.2005.845141"},{"key":"38_CR58","unstructured":"W.G. Cochran, \u201cSampling techniques,\u201d 3rd Ed. John Wiley, 1977."},{"key":"38_CR59","doi-asserted-by":"crossref","unstructured":"J.S. Vitter. \u201cRandom sampling with a reservoir,\u201d ACM Transactions on Mathematical Software, pp.37\u201357, 1985.","DOI":"10.1145\/3147.3165"},{"key":"38_CR60","doi-asserted-by":"crossref","unstructured":"J.S. Vitter, \u201cFaster methods for random sampling,\u201d Communication of the ACM (CACM), 27(7), July 1984.","DOI":"10.1145\/358105.893"},{"key":"38_CR61","doi-asserted-by":"crossref","unstructured":"J. Zhang, J. Xu, and S. Liao, \u201cSampling methods for summarizing unordered vehicle-to-vehicle data streams\u201d, Transportation Research Part C\u2014Emerging Technologies, 23:56\u201367, 2012.","DOI":"10.1016\/j.trc.2011.11.009"},{"key":"38_CR62","doi-asserted-by":"crossref","unstructured":"M. Dash. And W. Ng, \u201cEfficient reservoir sampling for transactional data streams,\u201d Proceedings of IEEE International Conference on Data Mining (ICDM), pp.\u00a0662\u2013666, 2006.","DOI":"10.1109\/ICDMW.2006.68"},{"key":"38_CR63","unstructured":"D. Ghosh, and A. Vogt, \u201cA modification of Poisson sampling,\u201d Proceedings of the American Statistical Association, Survey Research Methods Section, pp.198\u2013199, 1999."},{"key":"38_CR64","unstructured":"B. Babcock, M. Datar, and R. Motwani, \u201cSampling from a moving window over streaming data,\u201d Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia, pp.\u00a0633\u2013634, 2002."},{"key":"38_CR65","unstructured":"C.C. Aggarwal. \u201cOn biased reservoir sampling in the presence of stream evolution,\u201d Proceedings of the 32nd International Conference on Very large Data Bases (VLDB), pp.607\u2013618, 2006."},{"key":"38_CR66","unstructured":"R. Gemulla, W. Lehner, and P.J. Haas, \u201cA Dip in the reservoir maintaining sample synopses of evolving datasets,\u201d Proceedings of the 32nd International Conference on Very large Data Bases (VLDB), pp.\u00a0595\u2013606, 2006."},{"key":"38_CR67","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons and Y. Matias, \u201cNew sampling-based summary statistics for improving approximate query answers,\u201d Proceedings of the ACM International Conference on Management of Data (SIGMOD), New York, NY USA, pp.\u00a0331\u2013342, 1998.","DOI":"10.1145\/276305.276334"},{"key":"38_CR68","doi-asserted-by":"crossref","unstructured":"R. Gemulla, W. Lehner, and P.J. Haas, \u201cMaintaining Bernoulli samples over evolving multisets,\u201d In: Proc. ACM International Conference on Principles of Database Systems (PODS), pp.\u00a093\u2013102, 2007.","DOI":"10.1145\/1265530.1265544"},{"key":"38_CR69","unstructured":"S. Chaudhuri, G. Das, M. Datar, R. Motwani, and V. Narasayya, \u201d Overcoming limitations of sampling for aggregation queries,\u201d Proceedings of the IEEE International Conference on Data Engineering (ICDE), 2001."},{"key":"38_CR70","doi-asserted-by":"crossref","unstructured":"C. Hua-Hui and L. Kang-Li, \u201cWeighted random sampling based hierarchical amnesic synopses for data streams,\u201dProceedings of the 5th International Conference on Computer Science and Education (ICCSE), pp.1816\u20131820, 2010.","DOI":"10.1109\/ICCSE.2010.5593801"},{"key":"38_CR71","doi-asserted-by":"crossref","unstructured":"P.S. Efraimidis and P.G. Spirakis, \u201cWeighted random sampling with a reservoir,\u201d Information Processing Letters, 97(5):181\u2013185, 2006.","DOI":"10.1016\/j.ipl.2005.11.003"},{"key":"38_CR72","doi-asserted-by":"crossref","unstructured":"S. Acharya, P.B. Gibbons, and V. Poosala, \u201cCongressional samples for approximate answering of group-by queries,\u201d ACMSIGMOD Record, 29(2):487\u2013498, 2000.","DOI":"10.1145\/335191.335450"},{"key":"38_CR73","unstructured":"H.J. Chang and K.C. Huang, \u201cRemainder linear systematic sampling,\u201d Sankhya B 62, pp.\u00a0249\u2013256, 2000."},{"key":"38_CR74","doi-asserted-by":"crossref","unstructured":"N. Uthayakumaran, \u201cAdditional circular systematic sampling methods\u201d. Biometrical Journal, 40 (4):467\u2013474, 1998.","DOI":"10.1002\/(SICI)1521-4036(199808)40:4<467::AID-BIMJ467>3.0.CO;2-W"},{"key":"38_CR75","doi-asserted-by":"crossref","unstructured":"C.-H. Leu and F.F. Kao, \u201cModified balanced circular systematic sampling,\u201d Statistics & Probability Letters, 76(4):373\u2013383, 2006.","DOI":"10.1016\/j.spl.2005.08.005"},{"key":"38_CR76","doi-asserted-by":"crossref","unstructured":"M.A. Bujang et al., \u201cModification of systematic sampling: a comparison with a conventional approach in systematic sampling,\u201d Proceedings of the International Conference on Statistics in Science, Business, and Engineering (ICSSBE), pp.1\u20134, 2012.","DOI":"10.1109\/ICSSBE.2012.6396525"},{"key":"38_CR77","doi-asserted-by":"crossref","unstructured":"M. Al-Kateb, B.S. Lee, and X.S. Wang, \u201cAdaptive-size reservoir sampling over data streams,\u201d Proceedings of the 19th IEEE International Conference on Scientific and Statistical Database Management, Banff, Canada, pp.\u00a022\u201333, 2007.","DOI":"10.1109\/SSDBM.2007.29"},{"key":"38_CR78","unstructured":"M. Al-Kateb and B.S. Lee, \u201cAdaptive stratified reservoir sampling over heterogeneous data streams,\u201d Information Systems, Available online, 2012."},{"key":"38_CR79","doi-asserted-by":"crossref","unstructured":"M.D. Bankier, \u201cPower allocations: determining sample sizes for subnational areas,\u201d The American Statistician, 42:174\u2013177, 1988.","DOI":"10.1080\/00031305.1988.10475556"},{"key":"38_CR80","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, G. Das, and V. Narasayya, \u201cOptimized stratified sampling for approximate query processing,\u201d ACM Transactions on Database Systems (TODS), 32(2), p.9-es, June 2007.","DOI":"10.1145\/1242524.1242526"},{"key":"38_CR81","doi-asserted-by":"crossref","unstructured":"T. Liu and G. Agrawal, \u201cStratified k-means clustering over a deep web data source,\u201d Proceedings of the 18th ACM International Conference on Knowledge Discovery and Data Mining (KDD), pp.1113\u20131121, 2012.","DOI":"10.1145\/2339530.2339705"},{"key":"38_CR82","doi-asserted-by":"crossref","unstructured":"H. Sug, \u201cA structural sampling technique for better decision trees,\u201d Proceedings of the 1st Asian Conference on Intelligent Information and Database Systems (ACIIDS), pp.24\u201327, 2009.","DOI":"10.1109\/ACIIDS.2009.24"},{"key":"38_CR83","doi-asserted-by":"crossref","unstructured":"A. Pol, C. Jermaine, and S. Arumugam, \u201cMaintaining very large random samples using the geometric file,\u201d The VLDB Journal, 17:997\u20131018, 2008.","DOI":"10.1007\/s00778-007-0048-z"},{"key":"38_CR84","doi-asserted-by":"crossref","unstructured":"T.S. Buda, J. Murphy, and M. Kristiansen, \u201cTowards realistic sampling: generating dependencies in a relational database\u201d. Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication (ICUIMC), 2013.","DOI":"10.1145\/2448556.2448568"},{"key":"38_CR85","doi-asserted-by":"crossref","unstructured":"S. Cong, J. Han, J. Hoeflinger, and D. Padua, \u201cA sampling-based framework for parallel data mining,\u201d Proceedings of the 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp.\u00a0255\u2013265, 2005.","DOI":"10.1145\/1065944.1065979"},{"key":"38_CR86","doi-asserted-by":"crossref","unstructured":"B. Babcock, S. Chaudhuri, and G. Das, \u201cDynamic sample selection for approximate query processing,\u201d Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp.\u00a0539\u2013550, 2003.","DOI":"10.1145\/872757.872822"},{"key":"38_CR87","doi-asserted-by":"crossref","unstructured":"R. Gemulla, W. Lehner, and P. J. Haas, \u201cMaintaining bounded-size sample synopses of evolving datasets,\u201d The VLDB Journal, 17:173\u2013201, 2008.","DOI":"10.1007\/s00778-007-0065-y"},{"key":"38_CR88","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, \u201cFast discovery of association rules,\u201d In Advances in Knowledge Discovery and Data Mining, 1996."},{"key":"38_CR89","doi-asserted-by":"crossref","unstructured":"B. Chen, P. Haas, and P. Scheuermann, \u201cA new two-phase sampling based algorithm for discovering association rules,\u201d Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2002.","DOI":"10.1145\/775047.775114"},{"key":"38_CR90","unstructured":"F. Olken, \u201cRandom sampling from databases,\u201d Ph. D. Dissertation, 1993."},{"key":"38_CR91","unstructured":"I. Boxill, C. Chambers, and W. Eleanor, \u201cIntroduction to social research with applications to the Caribbean,\u201d University of the West Indies Press, Chapter 4, page 36, 1997."},{"key":"38_CR92","doi-asserted-by":"crossref","unstructured":"C.A. Moser, \u201cQuota sampling,\u201d Journal of the Royal Statistical Society, 115(3):411\u2013423, 1952.","DOI":"10.2307\/2980740"},{"key":"38_CR93","doi-asserted-by":"crossref","unstructured":"C. Sibona and S. Walczak, \u201cPurposive sampling on Twitter: a case study,\" Proceedings of the 45th Hawaii International Conference System Science (HICSS), pp.\u00a03510, 3519, 2012.","DOI":"10.1109\/HICSS.2012.493"},{"key":"38_CR94","doi-asserted-by":"crossref","unstructured":"D.F. Nettleton, \u201cData mining of social networks represented as graphs,\u201d Computer Science Review, 7:1\u201334, 2013.","DOI":"10.1016\/j.cosrev.2012.12.001"},{"key":"38_CR95","doi-asserted-by":"crossref","unstructured":"P.D. Gr\u00fcnwald, \u201cMinimum description length tutorial,\u201d In: Advances in Minimum Description Length, P. Gr\u00fcnwald and I. Myung I (eds), MIT Press, Cambridge, 2005.","DOI":"10.7551\/mitpress\/1114.001.0001"},{"key":"38_CR96","doi-asserted-by":"crossref","unstructured":"J. Rissanen, \u201cModeling by shortest data description,\u201d Automatica, 14(1):465\u2013471, 1978.","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"38_CR97","unstructured":"P.D. Grunwald, \u201cThe Minimum description length principle and reasoning under uncertainty,\u201d cwi.nl, 1998."},{"key":"38_CR98","doi-asserted-by":"crossref","unstructured":"J. Kiernan and E. Terzi,\u201cConstructing comprehensive summaries of large event sequences,\u201d Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp.\u00a0417\u2013425, 2008.","DOI":"10.1145\/1401890.1401943"},{"key":"38_CR99","doi-asserted-by":"crossref","unstructured":"J. Kiernan and E. Terzi, \u201cConstructing comprehensive summaries of large event sequences,\u201d ACM Transactions on Knowledge and Data Discovery Data, 3(4), 2009.","DOI":"10.1145\/1631162.1631169"},{"key":"38_CR100","doi-asserted-by":"crossref","unstructured":"P. Wang, H. Wang, M. Liu, and W. Wang, \u201cAn algorithmic approach to event summarization,\u201d Proceedings of the ACM International Conference on Management of data (SIGMOD), pp.183\u2013194, 2010.","DOI":"10.1145\/1807167.1807189"},{"key":"38_CR101","doi-asserted-by":"crossref","unstructured":"Y. Jiang, C.-S. Perng, and T. Li, \u201cNatural event summarization,\u201d Proceedings of the 20th ACM International Conference on Information and Knowledge Management (CIKM), pp.765\u2013774, 2011.","DOI":"10.1145\/2063576.2063688"},{"key":"38_CR102","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Aggarwal, and V.V.V. Prasad, \u201cDepth first generation of long patterns,\u201d Proceedings of 7th International Conference on Knowledge Discovery and Data Mining, 2000.","DOI":"10.1145\/347090.347114"},{"key":"38_CR103","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke, \u201cMAFIA: a maximal frequent itemset algorithm for transactional databases,\u201d Proceedings of the International Conference on Data Engineering (ICDE), April 2001."},{"key":"38_CR104","unstructured":"J. Pei, J. Han, and R. Mao, \u201cCloset: An efficient algorithm for mining frequent closed itemsets,\u201d Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery, May 2000."},{"key":"38_CR105","doi-asserted-by":"crossref","unstructured":"W. Zhou, H. Liu, and H. Cheng, \u201cMining closed episodes from event sequences efficiently,\u201d Proceedings of the 14th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD), pp.\u00a0310\u2013318, 2010.","DOI":"10.1007\/978-3-642-13657-3_34"},{"key":"38_CR106","unstructured":"S. A. Vreeken and M. van Leeuwen, \u201cItem sets that compress,\u201d Proceedings of SIAM International Conference on Data Mining (SDM), pp.393\u2013404, 2006."},{"key":"38_CR107","doi-asserted-by":"crossref","unstructured":"M. van Leeuwen, J. Vreeken, A. Siebes, \u201cCompression picks the item sets that matter,\u201d Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECML-PKDD), pp\u00a0585\u2013592, 2006.","DOI":"10.1007\/11871637_59"},{"key":"38_CR108","doi-asserted-by":"crossref","unstructured":"J. Vreeken, M. van Leeuwen, and A. Siebes, \u201cKrimp: mining itemsets that compress,\u201d Data Mining and Knowledge Discovery, 23(1):169\u2013214, 2011.","DOI":"10.1007\/s10618-010-0202-x"},{"key":"38_CR109","doi-asserted-by":"crossref","unstructured":"M. Leeuwen and A. Siebes, \u201cStreamKrimp: detecting change in data streams,\u201d Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECML-PKDD), pp: 672\u2013687, 2008.","DOI":"10.1007\/978-3-540-87479-9_62"},{"key":"38_CR110","doi-asserted-by":"crossref","unstructured":"K. Smets and J. Vreeken, \u201cSlim: directly mining descriptive patterns,\u201d Proceedings of SIAM International Conference on Data Mining (SDM), pp.\u00a0236\u2013247, 2012.","DOI":"10.1137\/1.9781611972825.21"},{"key":"38_CR111","doi-asserted-by":"crossref","unstructured":"N. Tatti and J. Vreeken, \u201cThe long and the short of it: summarising event sequences with serial episodes,\u201d Proceedings of the 18th ACM SIGKDD international conference on Knowledge Discovery and Data Mining (KDD), pp: 462\u2013470, 2012.","DOI":"10.1145\/2339530.2339606"},{"key":"38_CR112","unstructured":"L.H. Thanh, M. Fabian, F. Dmitriy, and C. Toon, \u201cMining compressing sequential patterns,\u201d Statistical Analysis and Data Mining, 2013."},{"key":"38_CR113","doi-asserted-by":"crossref","unstructured":"F. Moerchen, M. Thies, and A. Ultsch, \u201cEfficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression,\u201d Knowledge Information Systems, 29:55\u201380, 2011.","DOI":"10.1007\/s10115-010-0329-5"},{"key":"38_CR114","unstructured":"R. Polikar, \u201cThe wavelet tutorial,\u201d http:\/\/engineering.rowan.edu\/polikar\/WAVELETS\/WTtutorial.html."},{"key":"38_CR115","doi-asserted-by":"crossref","unstructured":"G. Strang, \u201cWavelet transforms versus fourier transforms,\u201d Bulletin of American Mathematic Society, (new series 28):288\u2013305, 1990.","DOI":"10.1090\/S0273-0979-1993-00390-2"},{"key":"38_CR116","doi-asserted-by":"crossref","unstructured":"A. Haar, \u201cZur Theorie der orthogonalen Funktionensysteme,\u201dMathematische Annalen, 69(3):331\u2013371, 1910.","DOI":"10.1007\/BF01456326"},{"key":"38_CR117","doi-asserted-by":"crossref","unstructured":"I. Daubechies, \u201cTen lectures on wavelets,\u201d SIAM publications, 1992.","DOI":"10.1137\/1.9781611970104"},{"key":"38_CR118","doi-asserted-by":"crossref","unstructured":"M. Garofalakis and P. B. Gibbons, \u201cProbabilistic wavelet synopses,\u201d ACM Transactions on Database Systems (TODS), 29:43\u201390, 2004.","DOI":"10.1145\/974750.974753"},{"key":"38_CR119","doi-asserted-by":"crossref","unstructured":"Y. Matias, J.S. Vitter, and M. Wang, \u201cWavelet-based histograms for selectivity estimation,\u201d Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp.\u00a0448\u2013459, 1998.","DOI":"10.1145\/276305.276344"},{"key":"38_CR120","doi-asserted-by":"crossref","unstructured":"Y. Matias and D. Urieli, \u201cInner-product based wavelet synopses for range-sum queries,\u201d Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pp.\u00a0504\u2013515, 2006.","DOI":"10.1007\/11841036_46"},{"key":"38_CR121","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and M. Wang, \u201cApproximate computation of multidimensional aggregates of sparse data using wavelets\u201d, Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp.\u00a0193\u2013204, 1999.","DOI":"10.1145\/304181.304199"},{"key":"38_CR122","doi-asserted-by":"crossref","unstructured":"K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim, \u201cApproximate query processing using wavelets,\u201d The VLDB Journal, 10(2\u20133):199\u2013223, 2001.","DOI":"10.1007\/s007780100049"},{"key":"38_CR123","unstructured":"A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, \u201cSurfing wavelets on streams: One-pass summaries for approximate aggregate queries\u201d. The VLDB Journal, pp.\u00a079\u201388, 2001."},{"key":"38_CR124","doi-asserted-by":"crossref","unstructured":"D. Sacharidis, A. Deligiannakis, and T. Sellis, \u201cHierarchically compressed wavelet synopses,\u201d The VLDB Journal, 18:203\u2013231, 2009.","DOI":"10.1007\/s00778-008-0096-z"},{"key":"38_CR125","doi-asserted-by":"crossref","unstructured":"A. Deligiannakis and N. Roussopoulos, \u201cExtended wavelets for multiple measures,\u201d Proceedings of ACM International Conference on Management of Data (SIGMOD), pp.\u00a0229\u2013240, 2003.","DOI":"10.1145\/872757.872786"},{"key":"38_CR126","doi-asserted-by":"crossref","unstructured":"A. Deligiannakis, M. Garofalakis, and N. Roussopoulos, \u201cExtended wavelets for multiple measures,\u201d ACM Transactions on Database Systems (TODS), 32(2), 2007.","DOI":"10.1145\/1242524.1242527"},{"key":"38_CR127","doi-asserted-by":"crossref","unstructured":"S. Guha, C. Kim, and K. Shim, \u201cXwave: Approximate extended wavelets for streaming data,\u201d Proceedings of the International Conference on Very Large Data Bases (VLDB), pp.\u00a0288\u2013299, 2004.","DOI":"10.1016\/B978-012088469-8\/50028-0"},{"key":"38_CR128","doi-asserted-by":"crossref","unstructured":"S. Guha and B. Harb, \u201cApproximation algorithms for wavelet transform coding of data streams,\u201d Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.","DOI":"10.1145\/1109557.1109633"},{"key":"38_CR129","unstructured":"Y. Matias, J.S. Vitter, and M. Wang, \u201cDynamic maintenance of wavelet-based histograms,\u201d Proceedings of International Conference on Very Large Data Bases (VLDB), pp.\u00a0101\u2013110, 2000."},{"key":"38_CR130","doi-asserted-by":"crossref","unstructured":"G. Cormode, M. Garofalakis, and D. Sacharidis, \u201cFast approximate wavelet tracking on streams,\u201d Proceedings of the International Conference on Extending Database Technology (EDBT), 2006.","DOI":"10.1007\/11687238_4"},{"key":"38_CR131","unstructured":"P. Karras and N. Mamoulis, \u201cOne-pass wavelet synopses for maximum-error metrics,\u201d Proceedings of the International Conference on Very Large Data Bases (VLDB), pp.\u00a0421\u2013432, 2005."},{"key":"38_CR132","doi-asserted-by":"crossref","unstructured":"K.-L. Liao, H.-H. Chen, J.-B. Qian, and Y.-H. Dong, \u201cWavelet decomposition algorithm for uncertain data streams,\u201dProceedings of the 6th International Conference on Computer Science & Education (ICCSE), pp.965\u2013970, 2011.","DOI":"10.1109\/ICCSE.2011.6028796"},{"key":"38_CR133","doi-asserted-by":"crossref","unstructured":"Y. Zhao, C. Aggarwal, and P. Yu, \u201cOn wavelet decomposition of uncertain time series data sets,\u201d Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM), pp.129\u2013138, 2010.","DOI":"10.1145\/1871437.1871458"},{"key":"38_CR134","doi-asserted-by":"crossref","unstructured":"C.C. Aggarwal (ed.), \u201cData streams: models and algorithms\u201d, Springer, 2007.","DOI":"10.1007\/978-0-387-47534-9"},{"key":"38_CR135","doi-asserted-by":"crossref","unstructured":"M. Stern, E. Buchmann, and K. B\u00f6hm, \u201cA wavelet transform for efficient consolidation of sensor relations with quality guarantees,\u201d Proceedings of the International Conference on Very Large Databases (VLDB), pp.157\u2013168, 2009.","DOI":"10.14778\/1687627.1687646"},{"key":"38_CR136","doi-asserted-by":"crossref","unstructured":"J. Jestes, K. Yi, and F. Li, \u201cBuilding wavelet histograms on large data in MapReduce,\u201d Proceedings of the International Conference on Very Large Databases (VLDB), pp.109\u2013120, 2011.","DOI":"10.14778\/2078324.2078327"},{"key":"38_CR137","doi-asserted-by":"crossref","unstructured":"G. Cormode and M. Garofalakis, \u201cHistograms and wavelets on probabilistic data,\"Proceedings of the IEEE 25th International Conference on Data Engineering (ICDE), pp.293\u2013304, 2009.","DOI":"10.1109\/ICDE.2009.74"},{"key":"38_CR138","unstructured":"R. P. Kooi, \u201cThe optimization of queries in relational databases,\u201d PhD thesis, Case Western Reserver University, Sept. 1980."},{"key":"38_CR139","doi-asserted-by":"crossref","unstructured":"M. Muralikrisbna and D.J. Dewitt, \u201cEqui-depth histograms for estimating selectivity factors for multidimensional queries,\u201d Proceedings of ACM International Conference on Management of Data (SIGMOD), pp.\u00a028\u201336, 1988.","DOI":"10.1145\/971701.50205"},{"key":"38_CR140","doi-asserted-by":"crossref","unstructured":"Y. Ioannidis and V. Poosala. \u201cBalancing histogram optimality and practicality for query result size estimation\u201d. Proceedings of ACM International Conference on Management of Data (SIGMOD), pp.\u00a0233\u2013244, 1995.","DOI":"10.1145\/568271.223841"},{"key":"38_CR141","doi-asserted-by":"crossref","unstructured":"V. Poosala, Y.E. Ioannidis, P.J. Haas, E.J. Shekita, \u201cImproved histograms for selectivity estimation of range predicates,\u201d Proceedings of ACM International Conference on Management of Data (SIGMOD), pp.\u00a0294\u2013305, 1996.","DOI":"10.1145\/235968.233342"},{"key":"38_CR142","unstructured":"A.C. Konig and G. Weikum, \u201cCombining histograms and parametric curve fitting for feedback-driven query result-size estimation,\u201d Proceedings of the International Conference on Very Large Data Bases (VLDB), Edinburgh, pp.\u00a0423\u2013434, 1999."},{"key":"38_CR143","unstructured":"V. Poosala and Y. Ioannidis, \u201cSelectivity estimation without the attribute value independence assumption,\u201d Proceedings of the International Conference on Very Large Data Bases (VLDB), Athens, pp: 486\u2013495, 1997."},{"key":"38_CR144","doi-asserted-by":"crossref","unstructured":"D. Gunopulos, G. Kollios, V.J. Tsotras, and C. Domeniconi, \u201cApproximating multi-dimensional aggregate range queries over real attributes,\u201d Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp.463\u2013474, 2000.","DOI":"10.1145\/335191.335448"},{"key":"38_CR145","doi-asserted-by":"crossref","unstructured":"N. Bruno and S. Chaudhuri, \u201cExploiting statistics on query expressions for optimization,\u201d Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp.\u00a0263\u2013274, 2002.","DOI":"10.1145\/564691.564722"},{"key":"38_CR146","doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, \u201cA framework for clustering evolving data streams,\u201d Proceedings of the 29th International conference on Very Large Data Bases (VLDB), pp.\u00a081\u201392, 2003.","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"38_CR147","doi-asserted-by":"crossref","unstructured":"F. Cao, M. Ester, W. Qian, and A. Zhou, \u201cDensity-based clustering over an evolving data stream with noise,\u201d Proceedings of SIAM Conference on Data Mining (SDM), pp.\u00a0328\u2013339, 2006.","DOI":"10.1137\/1.9781611972764.29"},{"key":"38_CR148","doi-asserted-by":"crossref","unstructured":"Y. Chen, \u201cDensity-based clustering for real-time stream data,\u201d Proceedings of the Knowledge Discovery and Data Mining (KDD), San Jose, California, USA, pp.\u00a0133\u2013142, 2007.","DOI":"10.1145\/1281192.1281210"},{"key":"38_CR149","doi-asserted-by":"crossref","unstructured":"J. Ren, R. Ma, and J. Ren, \u201cDensity-based data streams clustering over sliding windows,\u201d Proceedings of the 6th International Conference on Fuzzy systems and Knowledge Discovery (FSKD), Piscataway, NJ, USA, pp.\u00a0248\u2013252, 2009.","DOI":"10.1109\/FSKD.2009.553"},{"key":"38_CR150","doi-asserted-by":"crossref","unstructured":"W. Ng and M. Dash, \u201cDiscovery of frequent patterns in transactional data streams,\u201d Transactions on Large-Scale Data- and Knowledge-Centered Systems II,. Springer Berlin\/Heidelberg, 6380:1\u201330, 2010.","DOI":"10.1007\/978-3-642-16175-9_1"},{"key":"38_CR151","doi-asserted-by":"crossref","unstructured":"L.-X. Liu, H. Huang, Y.-F. Gu, and F.-C. Chen, \u201crDenStream\u2014a clustering algorithm over an evolving data stream,\u201dProceedings of CIECS International Conference on Information Engineering and Computer Science, pp.1\u20134, 2009.","DOI":"10.1109\/ICIECS.2009.5363379"},{"key":"38_CR152","doi-asserted-by":"crossref","unstructured":"C. Ruiz, E. Menasalvas, and M. Spiliopoulou, \u201cC-DenStream: using domain knowledge on a data stream,\u201d Proceedings of the 12th International Conference on Discovery Science, pp.\u00a0287\u2013301, 2009.","DOI":"10.1007\/978-3-642-04747-3_23"},{"key":"38_CR153","doi-asserted-by":"crossref","unstructured":"W.-H. Zhu, Y. Yin, Y.-H. Xie, \u201cArbitrary shape cluster algorithm for clustering data stream,\u201d Journal of Software, 17(3):379\u2013387, 2006.","DOI":"10.1360\/jos170379"},{"key":"38_CR154","doi-asserted-by":"crossref","unstructured":"H. Wang, Y. Yu, Q. Wang, and Y. Wan, \u201cA density-based clustering structure mining algorithm for data streams,\u201d Proceedings of the 1st ACM International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications (BigMine), pp.\u00a069\u201376, 2012.","DOI":"10.1145\/2351316.2351326"},{"key":"38_CR155","doi-asserted-by":"crossref","unstructured":"P. Kranen, I. Assent, C. Baldauf, and T. Sei, \u201cThe ClusTree: indexing micro-clusters for anytime stream mining,\u201d Knowledge Information Systems, 29(2):249\u2013272, 2011.","DOI":"10.1007\/s10115-010-0342-8"},{"key":"38_CR156","doi-asserted-by":"crossref","unstructured":"A. Amini, T.Y. Wah, M.R. Saybani, and S.R.A.S. Yazdi, \u201cA study of density-grid based clustering algorithms on data streams,\u201d Proceedings of 18th International Conference Fuzzy Systems and Knowledge Discovery (FSKD), 3:1652\u20131656, 2011.","DOI":"10.1109\/FSKD.2011.6019867"},{"key":"38_CR157","unstructured":"A. Amini and T.Y. Wah,\u201c Density micro-clustering algorithms on data streams: a review,\u201d Proceeding of the International Multiconference of Engineers and Computer scientists (IMECS), 2011."}],"container-title":["Handbook on Data Centers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2092-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:24:43Z","timestamp":1747787083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4939-2092-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9781493920914","9781493920921"],"references-count":157,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2092-1_38","relation":{},"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}