Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
A One-Pass Algorithm For Accurately Estimating Quantiles For Disk-Resident Data, Khaled Alsabti, Sanjay Ranka, Vineet Singh
A One-Pass Algorithm For Accurately Estimating Quantiles For Disk-Resident Data, Khaled Alsabti, Sanjay Ranka, Vineet Singh
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
The '-quantile of an ordered sequence of data values is the element with rank ' \Theta n, where n is the total number of values. Accurate estimates of quantiles are required for the solution of many practical applications. In this paper, we present a new algorithm for estimating the quantile values for disk-resident data. Our algorithm has the following characteristics: (1) It requires only one pass over the data; (2) It is deterministic; (3) It produces good lower and upper bounds of the true values of the quantiles; (4) It requires no a priori knowledge of the distribution of the …
An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh
An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh
Electrical Engineering and Computer Science - All Scholarship
In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of the root node, we may be able to prune the candidate set by using simple geometrical constraints. This approach can be applied recursively until the size of the candidate set is one for each …
Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems, Chao Wei Ou, Sanjay Ranka, Geoffrey C. Fox
Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems, Chao Wei Ou, Sanjay Ranka, Geoffrey C. Fox
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper describes the performance of locality-based mapping and remapping partitioners for unstructured grids. We show that the algorithm produces good mappings at a relatively low cost and can be easily parallelized. Further, the algorithm can provide remapping for incremental problems at a fraction of the total cost.