Journal
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
Volume 7, Issue 2, Pages 311-323Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-016-0504-4
Keywords
Metric-space indexing; Pivot selection; Intrinsic dimension; Objective function; Range query
Categories
Funding
- China 863 [2015AA015305]
- NSF-China [61170076, U1301252, 61471243]
- Guangdong Key Laboratory Project [2012A061400024]
- NSF-Shenzhen [JCYJ20140418095735561, JCYJ20150731160834611]
- Shenzhen-Hong Kong Innovation circle Project [SGLH20131010163759789]
Ask authors/readers for more resources
Metric-space indexing abstracts various data types into universal metric spaces and prunes data only exploiting the triangle inequality of the distance function in metric spaces. Since there is no coordinates in metric space, one usually first pick a number of reference points, pivots, and consider the distances from a data point to the pivots as its coordinates. In this paper, we first survey and discuss the state of the art of pivot selection for metric-space indexing from the perspectives of importance, objective function, number of pivots, and selection algorithm. Further, we propose a new objective function, a new method to determine the number of pivots and an incremental sampling framework for pivot selection. Experimental results show that the new objective function is more consistent with the query performance, the new method to determine the number of pivots is more efficient, and the incremental sampling framework leads to better query performance.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available