An Efficient Parallel Algorithm for High Dimensional Similarity Join Export

@inproceedings{citeulike:1761859, abstract = {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 ...}, author = {Alsabti and Ranka and Singh}, booktitle = {IPPS: 11th International Parallel Processing Symposium}, citeulike-article-id = {1761859}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/alsabti98efficient.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/alsabti98efficient.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/alsabti98efficient.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/alsabti98efficient.html}, keywords = {k-means}, posted-at = {2007-10-12 21:51:49}, priority = {3}, publisher = {IEEE Computer Society Press}, title = {An Efficient Parallel Algorithm for High Dimensional Similarity Join}, url = {http://citeseer.ist.psu.edu/alsabti98efficient.html}, year = {1998} }

TY - CONF ID - citeulike:1761859 L3 - citeulike-article-id:1761859 N2 - 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 ... TI - An Efficient Parallel Algorithm for High Dimensional Similarity Join PB - IEEE Computer Society Press T2 - IPPS: 11th International Parallel Processing Symposium KW - k-means AU - Alsabti AU - Ranka AU - Singh PY - 1998/// UR - http://citeseer.ist.psu.edu/alsabti98efficient.html ER -