Continuous Medoid Queries over Moving Objects

• Main Authors: PAPADOPOULOS, Stavros, SACHARIDIS, Dimitris, MOURATIDIS, Kyriakos
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2007
• Subjects: Medoid Queries; Continuous Query Processing; Moving Object Databases; Databases and Information Systems; Numerical Analysis and Scientific Computing
• Online Access: https://ink.library.smu.edu.sg/sis_research/878; https://ink.library.smu.edu.sg/context/sis_research/article/1877/viewcontent/SSTD07_ContMedoids.pdf
• Institution: Singapore Management University

In the k-medoid problem, given a dataset P, we are asked to choose kpoints in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points in P and their closest medoid. Finding the optimal k medoids is NP hard, and existing algorithms aim at approximate answe...