Abstract
Numerous applications in different fields, such as spatial databases, multimedia databases, data mining and recommender systems, may benefit from efficient and effective aggregate similarity search, also known as aggregate nearest neighbor (AggNN) search. Given a group of query objects Q, the goal of AggNN is to retrieve the k most similar objects from the database, where the underlying similarity measure is defined as an aggregation (usually sum, avg or max) of the distances between the retrieved objects and every query object in Q. Recently, the problem was generalized so as to retrieve the k objects which are most similar to a fixed proportion of the elements of Q. This variant of aggregate similarity search is referred to as ‘flexible AggNN’, or FANN. In this work, we propose two approximation algorithms, one for the sum and avg variants of FANN, and the other for the max variant. Extensive experiments are provided showing that, relative to state-of-the-art approaches (both exact and approximate), our algorithms produce query results with good accuracy, while at the same time being very efficient — even for real datasets of very high dimension.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proc. Symp. on Principles of Database Systems (PODS), pp. 102–113 (2001)
Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems (TODS) 29(2), 319–362 (2004)
Bernecker, T., Emrich, T., Graf, F., Kriegel, H.P., Kröger, P., Renz, M., Schubert, E., Zimek, A.: Subspace similarity search using the ideas of ranking and top-k retrieval. In: Proc. ICDE Workshop DBRank, pp. 4–9 (2010)
Razente, H.L., Barioni, M.C.N., Traina, A.J.M., Traina, Jr., C.: Aggregate similarity queries in relevance feedback methods for content-based image retrieval. In: Proc. Symp. on Applied Computing, pp. 869–874 (2008)
Beliakov, G., Calvo, T., James, S.: Aggregation of preferences in recommender systems. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook. Springer (2010)
Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering (TKDE) 17(6), 820–833 (2005)
Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE Transactions on Knowledge and Data Engineering (TKDE) 23(10), 1526–1540 (2011)
Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems (TODS) 30(2), 529–576 (2005)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proc. Intern. Conf. on Data Engineering (ICDE), pp. 301–312 (2004)
Razente, H.L., Barioni, M.C.N., Traina, A.J.M., Faloutsos, C., Traina, Jr., C.: A novel optimization approach to efficiently process aggregate similarity queries in metric access methods. In: Proc. Intern. Conf. on Information and Knowledge Management (CIKM), pp. 193–202 (2008)
Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: Proc. Intern. Conf. on Management of Data (SIGMOD), pp. 1009–1020 (2011)
Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: Proc. Intern. Conf. on Management of Data (SIGMOD), pp. 154–165 (1998)
Houle, M., Ma, X., Nett, M., Oria, V.: Dimensional testing for multi-step similarity search. In: Proc. Intern. Conf. on Data Mining (ICDM), pp. 299–308 (2012)
Houle, M., Kashima, H., Nett, M.: Generalized expansion dimension. In: IEEE ICDM Workshop on Practical Theories for Exploratory Data Mining (PTDM), pp. 587–594 (2012)
Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proc. Symp. on Theory of Computing (STOC), pp. 741–750 (2002)
LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278–2324 (1998)
Geusebroek, J.M., Burghouts, G.J., Smeulders, A.W.M.: The Amsterdam library of object images. International Journal of Computer Vision (IJCV) 61(1), 103–112 (2005)
Boujemaa, N., Fauqueur, J., Ferecatu, M., Fleuret, F., Gouet, V., Saux, B.L., Sahbi, H.: IKONA: interactive generic and specific image retrieval. In: Proc. Intern. Workshop on Multimedia Content-Based Indexing and Retrieval (MMCBIR) (2001)
Rose, K., Manjunath, B.S.: The Cortina data set. http://www.scl.ece.ucsb.edu/datasets/index.htm
Reuters Ltd.: Reuters corpus, vol. 2, multilingual corpus. http://trec.nist.gov/data/reuters/reuters.html
Houle, M.E., Sakuma, J.: Fast approximate similarity search in extremely high-dimensional data sets. In: Proc. Intern. Conf. on Data Engineering (ICDE), pp. 619–630 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Houle, M.E., Ma, X., Oria, V. (2015). Flexible Aggregate Similarity Search in High-Dimensional Data Sets. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds) Similarity Search and Applications. SISAP 2015. Lecture Notes in Computer Science(), vol 9371. Springer, Cham. https://doi.org/10.1007/978-3-319-25087-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-25087-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25086-1
Online ISBN: 978-3-319-25087-8
eBook Packages: Computer ScienceComputer Science (R0)