A K-Median Algorithm With Running Time Independent of Data Size

Machine Learning - Netherlands
doi 10.1023/b:mach.0000033115.78247.f0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

An Improved Dynamic Time Warping Algorithm Employing Nonlinear Median Filtering

2011English

Real-Time Travel Time Prediction Using Multi-Level K-Nearest Neighbor Algorithm and Data Fusion Method

2014English

K-Means Based Data Stream Clustering Algorithm Extended With No. Of Cluster Estimation Method

International Journal of Advance Engineering and Research Development
2014English

Finding a Latent K–simplex in O* (K · Nnz(data)) Time via Subset Smoothing

2020English

Enhancement of the K-Means Algorithm for Mixed Data in Big Data Platforms

Advances in Intelligent Systems and Computing
ControlSystems EngineeringComputer Science
2018English

Median-Of-K Jumplists and Dangling-Min BSTs

2019English

Detecting Feedback Vertex Sets of Size K in O*(2.7k) Time

2020English

A New Algorithm for Finding the K Shortest Paths in a Time-Schedule Network With Constraints on Arcs

Journal of Algorithms and Computational Technology
Computational MathematicsApplied MathematicsNumerical Analysis
2016English

Myocardial Infarct Size Quantification in Mice by SPECT Using a Novel Algorithm Independent of a Normal Perfusion Database

EJNMMI Research
Nuclear MedicineRadiologyImaging
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy