Linear speed-up for a parallel non-approximate recasting of centre-based clustering algorithms, including K-means, K-harmonic means, and EM

Reproducibility study - Faster k-means cluster estimation

Zoubek, Filip
Winkler, Martin
Vasili, Anxhelo

January 2021

We had a look at a heuristic improvement of K-Mean clustering algorithm that claimed significant imp...

Published In Knowledge Discovery from Databases (KDD '99),. Accelerating Exact k-means Algorithms with Geometric Reasoning

Dan Pelleg
Andrew Moore
Dan Pelleg
Andrew Moore

January 1999

We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to...

An Improvement in K-mean Clustering Algorithm Using Better Time and Accuracy

Er. Nikhil Chaturvedi
Er. Anand Rajavat

June 2021

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects i...

Scale up center-based data clustering algorithms by parallelism

Zhang, B.
Hsu, M.
Hewlett-Packard Laboratories, Bristol (United Kingdom)

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:4335.26205(2000-6) / BLDSC - British ...

A new clustering algorithm with multiple runs of iterative procedures

Zhang, Q.
Boyle, R.D
Leeds Univ. (United Kingdom). Dept. of Computer Studies

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS-RRS--90.12) / BLDSC ...

Parallel algorithms for global optimisation

Jha, M
Dixon, L.
University of Hertfordshire, Hatfield (United Kingdom). Numerical Optimisation Centre

January 1992

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.575(UH-NOC-TR--263) / BLDSC - B...

Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup

Yufei Ding
Yue Zhao
Xipeng Shen
Madanlal Musuvathi
Todd Mytkowicz

January 2016

This paper presents Yinyang K-means, a new algorithm for K-means clustering. By cluster-ing the cent...

Parallel algorithms for MIMD parallel computers

Yousif, H.M

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:DX72757/87 / BLDSC - British Library...

Parallel algorithms for SIMD and MIMD computers

Levin, M.D

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:DX92790 / BLDSC - British Library Do...

k-means Performance Improvements with Centroid Calculation Heuristics both for Serial and Parallel environments

Karimov, Jeyhun
Özbayoğlu, Ahmet Murat
Dogdu, Erdogan

January 2015

4th IEEE International Congress on Big Data, BigData Congress ( 2015 : New York City; United States...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

Parallelising a molecular dynamics algorithm on a multi-processor workstation

Mueller-Plathe, F
Science and Engineering Research Council (SERC), Daresbury (United Kingdom). Daresbury Lab

January 1990

Available from British Library Document Supply Centre- DSC:6609.025(DL/SCI/P--698T) / BLDSC - Britis...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

A stochastic parallel algorithm for global optimisation

Butti, A
Hatfield Polytechnic (United Kingdom). Numerical Optimisation Centre

January 1989

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(HP-NOC-TR--221) / BLDSC - Br...

Reproducibility study - Faster k-means cluster estimation

Zoubek, Filip
Winkler, Martin
Vasili, Anxhelo

January 2021

We had a look at a heuristic improvement of K-Mean clustering algorithm that claimed significant imp...

Published In Knowledge Discovery from Databases (KDD '99),. Accelerating Exact k-means Algorithms with Geometric Reasoning

Dan Pelleg
Andrew Moore
Dan Pelleg
Andrew Moore

January 1999

We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to...

An Improvement in K-mean Clustering Algorithm Using Better Time and Accuracy

Er. Nikhil Chaturvedi
Er. Anand Rajavat

June 2021

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects i...

Scale up center-based data clustering algorithms by parallelism

Zhang, B.
Hsu, M.
Hewlett-Packard Laboratories, Bristol (United Kingdom)

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:4335.26205(2000-6) / BLDSC - British ...

A new clustering algorithm with multiple runs of iterative procedures

Zhang, Q.
Boyle, R.D
Leeds Univ. (United Kingdom). Dept. of Computer Studies

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS-RRS--90.12) / BLDSC ...

Parallel algorithms for global optimisation

Jha, M
Dixon, L.
University of Hertfordshire, Hatfield (United Kingdom). Numerical Optimisation Centre

January 1992

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.575(UH-NOC-TR--263) / BLDSC - B...

Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup

Yufei Ding
Yue Zhao
Xipeng Shen
Madanlal Musuvathi
Todd Mytkowicz

January 2016

This paper presents Yinyang K-means, a new algorithm for K-means clustering. By cluster-ing the cent...

Parallel algorithms for MIMD parallel computers

Yousif, H.M

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:DX72757/87 / BLDSC - British Library...

Parallel algorithms for SIMD and MIMD computers

Levin, M.D

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:DX92790 / BLDSC - British Library Do...

k-means Performance Improvements with Centroid Calculation Heuristics both for Serial and Parallel environments

Karimov, Jeyhun
Özbayoğlu, Ahmet Murat
Dogdu, Erdogan

January 2015

4th IEEE International Congress on Big Data, BigData Congress ( 2015 : New York City; United States...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

Parallelising a molecular dynamics algorithm on a multi-processor workstation

Mueller-Plathe, F
Science and Engineering Research Council (SERC), Daresbury (United Kingdom). Daresbury Lab

January 1990

Available from British Library Document Supply Centre- DSC:6609.025(DL/SCI/P--698T) / BLDSC - Britis...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering

He, Guanlin
Vialle, Stephane
Baboulin, Marc

September 2021

International audienceSummary k-Means is a standard algorithm for clustering data. It constitutes ge...

A stochastic parallel algorithm for global optimisation

Butti, A
Hatfield Polytechnic (United Kingdom). Numerical Optimisation Centre

January 1989

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(HP-NOC-TR--221) / BLDSC - Br...

Reproducibility study - Faster k-means cluster estimation

Zoubek, Filip
Winkler, Martin
Vasili, Anxhelo

January 2021

We had a look at a heuristic improvement of K-Mean clustering algorithm that claimed significant imp...

Published In Knowledge Discovery from Databases (KDD '99),. Accelerating Exact k-means Algorithms with Geometric Reasoning

Dan Pelleg
Andrew Moore
Dan Pelleg
Andrew Moore

January 1999

We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to...

An Improvement in K-mean Clustering Algorithm Using Better Time and Accuracy

Er. Nikhil Chaturvedi
Er. Anand Rajavat

June 2021

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects i...

Linear speed-up for a parallel non-approximate recasting of centre-based clustering algorithms, including K-means, K-harmonic means, and EM

Abstract

Extracted data

Linear speed-up for a parallel non-approximate recasting of centre-based clustering algorithms, including K-means, K-harmonic means, and EM

Abstract

Extracted data

Related items

Related items