Abstract
A Simple-Map (S-Map, for short), which is one of dimension reduction techniques applicable to any metric space, uses the distances between central points and objects as the coordinate values. S-Map with multiple central points is a projection to multidimensional \(L_\infty \) space. In the previous researches for S-Map, the candidates for central points are randomly selected from data objects in database, and the summation of projective distances between sampled pairs of points is used as the scoring function to be maximized. We can improve the above method to select central points by using local search. The coordinate values of central points obtained after local search tend to be the maximum or the minimum ends of the space. By focusing on this tendency, in this paper, we propose a binary quantization to select central points divided into the maximum values and the minimum values based on whether the coordinate value of an object in database is greater than the threshold or not.
This work is partially supported by Grant-in-Aid for Scientific Research 24240021, 24300060, 25540137, 26280085, 26280090 and 26370281 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Inform. 1, 173–189 (1972)
Fukunaga, K.: Statistical Pattern Recognition, 2nd edn. Academic Press, San Diego (1990)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of SIGMOD 1984, pp. 47–57 (1984)
Shinohara, T., Ishizaka, H.: On dimension reduction mappings for approximate retrieval of multi-dimensional data. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery science. LNCS (LNAI), vol. 2281, pp. 224–231. Springer, Heidelberg (2002)
Nakanishi, Y.: A study on central point selection of dimension reduction projection simple-map for fast similarity search in high-dimensional data, Master Thesis, Kyushu Institute of Technology (2006)
Ogawa, F.: A study on simulated annealing and local search for central point selection of dimension reduction projection Simple-Map, Graduation Thesis, Kyushu Institute of Technology (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, Q., Nakashima, M., Shinohara, T., Hirata, K., Kuboyama, T. (2015). Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization. In: Murata, T., Mineshima, K., Bekki, D. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2014. Lecture Notes in Computer Science(), vol 9067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48119-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-48119-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48118-9
Online ISBN: 978-3-662-48119-6
eBook Packages: Computer ScienceComputer Science (R0)