An Efficient Comparison-Based Deterministic Algorithm to Solve the Closest Pair Problem

Zhou, Yinghua; Yu, Hong

doi:10.1109/icicta.2015.45

Cited by 5 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, they put forward some new data structures for various query types, including quadrants, strips, rectangles and halfplanes. Zhou et al, [38] propose a simple and efficient algorithm to solve the closest pair problem in k-dimensional space. It sorts these points according to the one-dimension value and only calculates the distances of pairs which may be closer than the current closest pair.…”

Section: B K-closest Pairs Findingmentioning

confidence: 99%

Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems

Liu

Hua³

2020

IEEE Access

View full text Add to dashboard Cite

Given two object sets P and Q, a k-closest pairs (k-CP) query finds k closest object pairs from P×Q. This operation is common in many real-life applications such as GIS, data mining and recommender systems. However, the k-CP problem has not been well studied in Dynamic Cyber-Physical-Social Systems (D-CPSS), where temporal information and multiple attributes are associated with each edge. In D-CPSS, people would like to specify multiple constraints on these attributes within a time interval to illustrate their requirements. In this paper, we study the temporal multiple constraints k closest pairs (TMC-k-CP) in D-CPSS, which is NP-Complete. We propose a divide-and-conquer cloud-based algorithm (DC) to find TMC-k-CP efficiently and effectively. To the best of our knowledge, DC is the first algorithm supporting the TMC-k-CP query in D-CPSS. The experimental results on eight real D-CPSS datasets demonstrate that our algorithm outperforms the state-of-the-art methods in terms of both efficiency and effectiveness.

show abstract

Section: B K-closest Pairs Findingmentioning

confidence: 99%

Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems

Liu

Hua³

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In 2015, the Pair-Pruned_CP algorithm of [8] was introduced. It is a simple and efficient algorithm to solve the closest pair of points problem.…”

Section: = ( −1)mentioning

confidence: 99%

Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping

Dellosa

Fajardo

Medina

2019

IJEECS

View full text Add to dashboard Cite

<span>This paper introduces an algorithm to solve the closest pair of points problem in a 2D plane based on dynamic warping. The algorithm computes all the distances between the set of points P(x, y) and a reference point R(i, j), records all the result in a grid and finally determines the minimum distance using schematic steps. Results show that the algorithm of finding the closest pair of points has achieved less number of comparisons in determining the closest pair of points compared with the brute force and divide-and-conquer methods of the closest pair of points. </span>

show abstract

“…It utilized the concept of CPP to monitor and contribute to the solution to traffic congestions. The most commonly used to solve the CPP program was the brute force method which requires the computation of the distances between the pair of points using Euclidean distance as used by [8][9][10]. The CPP is being utilized to determine the estimated position once the coordinates are already computed.…”

Section: Introductionmentioning

confidence: 99%

Modified fingerprinting localization technique of indoor positioning system based on coordinates

Dellosa

Fajardo

Medina

2019

IJEECS

View full text Add to dashboard Cite

<span>The fingerprinting localization technique is the most commonly used localization technique of the indoor positioning system. It is used by several technologies for short and long range position estimation like wireless fidelity and radio frequency. There are several schemes used to estimate a location for the indoor environment but the drawbacks resulted in complexity issues. These drawbacks have negative effects on location estimation. In order to address these drawbacks, this work attempted to explore the fingerprinting localization technique for location estimation of the indoor environment that focuses on position estimation. Results showed that the simplicity of the design of position estimation without compromising the functionality of the operations was observed with 100% accuracy on position estimation.</span>

show abstract

An Efficient Comparison-Based Deterministic Algorithm to Solve the Closest Pair Problem

Cited by 5 publications

References 10 publications

Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems

Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems

Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping

Modified fingerprinting localization technique of indoor positioning system based on coordinates

Contact Info

Product

Resources

About