<--- Back to Details
First PageDocument Content
K-means clustering / Cluster analysis / Vector quantization / BIRCH / Sorting algorithm / Merge algorithm / CURE data clustering algorithm / Data stream clustering
Date: 2016-07-10 13:05:33
K-means clustering
Cluster analysis
Vector quantization
BIRCH
Sorting algorithm
Merge algorithm
CURE data clustering algorithm
Data stream clustering

Parallelizing Clustering of Geoscientific Data Sets using Data Streams Silvia Nittel Spatial Information Science & Engineering University of Maine Orono, ME, USA

Add to Reading List

Source URL: silvianittel.files.wordpress.com

Download Document from Source Website

File Size: 137,70 KB

Share Document on Facebook

Similar Documents

CSE 181 Project guidelines

CSE 181 Project guidelines

DocID: 1rn8e - View Document

Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

DocID: 1rmpD - View Document

Information Processing Letters–42 www.elsevier.com/locate/ipl HCPO: an efficient insertion order for incremental Delaunay triangulation Sheng Zhou ∗ , Christopher B. Jones

Information Processing Letters–42 www.elsevier.com/locate/ipl HCPO: an efficient insertion order for incremental Delaunay triangulation Sheng Zhou ∗ , Christopher B. Jones

DocID: 1rggE - View Document

CHAPTER 8  Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI  8.1 INTRODUCTION

CHAPTER 8 Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI 8.1 INTRODUCTION

DocID: 1reEI - View Document

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

DocID: 1r8dX - View Document