Calculating the squared euclidean distance for vertical data represented in ptrees

Mohammad K. Hossain, Arijit Chatterjee, Arjun G. Roy, William Perrizo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Euclidean distance measures the natural distance between two points in space, hence it is very common in use in mathematics. However it is computationally very expensive as there involves costly square and square root operations to calculate this distance. An alternative approach is to calculate this distance without computing the square root, which is called the Square Euclidean Distance (SED). Although it does not support the triangular inequality property but it can be used for comparing the distance of two points from a fixed points. For this reason SED has been used in classification, clustering, image processing and other areas to save the computational time as well as increase accuracy. In this paper we have shown how SED can be calculated for vertical data represented in pTrees. This algorithm uses only bitwise operations across various pTrees without performing any horizontal scan of the data points. As a result the algorithm works very fast on huge volume of data represented by pTrees comparing with traditional horizontal data representation.

Original languageEnglish (US)
Title of host publicationProceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012
Pages185-189
Number of pages5
StatePublished - Dec 1 2012
Externally publishedYes
Event21st International Conference on Software Engineering and Data Engineering, SEDE 2012 - Los Angeles, CA, United States
Duration: Jun 27 2012Jun 29 2012

Publication series

NameProceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012

Conference

Conference21st International Conference on Software Engineering and Data Engineering, SEDE 2012
CountryUnited States
CityLos Angeles, CA
Period6/27/126/29/12

Fingerprint Dive into the research topics of 'Calculating the squared euclidean distance for vertical data represented in ptrees'. Together they form a unique fingerprint.

  • Cite this

    Hossain, M. K., Chatterjee, A., Roy, A. G., & Perrizo, W. (2012). Calculating the squared euclidean distance for vertical data represented in ptrees. In Proceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012 (pp. 185-189). (Proceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012).