{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:09:00Z","timestamp":1761808140790,"version":"3.41.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684734"},{"type":"electronic","value":"9783319684741"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_12","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T15:15:48Z","timestamp":1506525348000},"page":"173-187","source":"Crossref","is-referenced-by-count":15,"title":["Good and Bad Neighborhood Approximations for Outlier Detection Ensembles"],"prefix":"10.1007","author":[{"given":"Evelyn","family":"Kirner","sequence":"first","affiliation":[]},{"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"key":"12_CR1","first-page":"671","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS 66, 671\u2013687 (2003)","journal-title":"JCSS"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Achtert, E., Kriegel, H.P., Schubert, E., Zimek, A.: Interactive data mining with 3D-parallel-coordinate-trees. In: Proceedings SIGMOD, pp. 1009\u20131012 (2013)","DOI":"10.1145\/2463676.2463696"},{"issue":"1","key":"12_CR3","first-page":"4:1","volume":"3","author":"F Angiulli","year":"2009","unstructured":"Angiulli, F., Fassetti, F.: DOLPHIN: an efficient algorithm for mining distance-based outliers in very large datasets. ACM TKDD 3(1), 4:1\u201357 (2009)","journal-title":"ACM TKDD"},{"issue":"2","key":"12_CR4","first-page":"203","volume":"17","author":"F Angiulli","year":"2005","unstructured":"Angiulli, F., Pizzuti, C.: Outlier mining in large high-dimensional data sets. IEEE TKDE 17(2), 203\u2013215 (2005)","journal-title":"IEEE TKDE"},{"key":"12_CR5","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: Proceedings SODA, pp. 271\u2013280 (1993)"},{"key":"12_CR6","volume-title":"Outliers in Statistical Data","author":"V Barnett","year":"1994","unstructured":"Barnett, V., Lewis, T.: Outliers in Statistical Data, 3rd edn. Wiley, New York (1994)","edition":"3"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Bay, S.D., Schwabacher, M.: Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In: Proceedings KDD, pp. 29\u201338 (2003)","DOI":"10.1145\/956750.956758"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: an efficient and robust access method for points and rectangles. In: Proceedings SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"12_CR9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R., Sander, J.: LOF: Identifying density-based local outliers. In: Proceedings SIGMOD. pp. 93\u2013104 (2000)","DOI":"10.1145\/335191.335388"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10618-015-0444-8","volume":"30","author":"GO Campos","year":"2016","unstructured":"Campos, G.O., Zimek, A., Sander, J., Campello, R.J.G.B., Micenkov\u00e1, B., Schubert, E., Assent, I., Houle, M.E.: On the evaluation of unsupervised outlier detection: Measures, datasets, and an empirical study. Data Min. Knowl. Disc. 30, 891\u2013927 (2016)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"12_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V Chandola","year":"2009","unstructured":"Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM CSUR 41(3), 1\u201358 (2009). Article 15","journal-title":"ACM CSUR"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings ACM SoCG, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"1","key":"12_CR14","first-page":"25","volume":"32","author":"T Vries de","year":"2012","unstructured":"de Vries, T., Chawla, S., Houle, M.E.: Density-preserving projections for large-scale local anomaly detection. KAIS 32(1), 25\u201352 (2012)","journal-title":"KAIS"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Dong, W., Charikar, M., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings WWW, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"12_CR16","unstructured":"Erickson, J.: On the relative complexities of some geometric problems. In: Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995, pp. 85\u201390 (1995)"},{"issue":"1","key":"12_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"JM Geusebroek","year":"2005","unstructured":"Geusebroek, J.M., Burghouts, G.J., Smeulders, A.W.M.: The amsterdam library of object images. Int. J. Comput. Vis. 61(1), 103\u2013112 (2005)","journal-title":"Int. J. Comput. Vis."},{"key":"12_CR18","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings VLDB, pp. 518\u2013529 (1999)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"3","key":"12_CR20","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D Hilbert","year":"1891","unstructured":"Hilbert, D.: Ueber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck. Math. Ann. 38(3), 459\u2013460 (1891)","journal-title":"Math. Ann."},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-46759-7_20","volume-title":"Similarity Search and Applications","author":"Y Imamura","year":"2016","unstructured":"Imamura, Y., Shinohara, T., Hirata, K., Kuboyama, T.: Fast Hilbert Sort Algorithm Without Using Hilbert Indices. In: Amsaleg, L., Houle, M.E., Schubert, E. (eds.) SISAP 2016. LNCS, vol. 9939, pp. 259\u2013267. Springer, Cham (2016). doi: 10.1007\/978-3-319-46759-7_20"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Jin, W., Tung, A.K., Han, J.: Mining top-n local outliers in large databases. In: Proceedings KDD, pp. 293\u2013298 (2001)","DOI":"10.1145\/502512.502554"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in Modern Analysis and Probability, Contemporary Mathematics, vol. 26, pp. 189\u2013206. American Mathematical Society (1984)","DOI":"10.1090\/conm\/026\/737400"},{"issue":"2","key":"12_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.patcog.2010.08.018","volume":"44","author":"A Kab\u00e1n","year":"2011","unstructured":"Kab\u00e1n, A.: On the distance concentration awareness of certain data reduction techniques. Pattern Recogn. 44(2), 265\u2013277 (2011)","journal-title":"Pattern Recogn."},{"key":"12_CR26","unstructured":"Knorr, E.M., Ng, R.T.: Algorithms for mining distance-based outliers in large datasets. In: Proceedings VLDB, pp. 392\u2013403 (1998)"},{"issue":"5","key":"12_CR27","first-page":"1170","volume":"15","author":"G Kollios","year":"2003","unstructured":"Kollios, G., Gunopulos, D., Koudas, N., Berchthold, S.: Efficient biased sampling for approximate clustering and outlier detection in large datasets. IEEE TKDE 15(5), 1170\u20131187 (2003)","journal-title":"IEEE TKDE"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: Interpreting and unifying outlier scores. In: Proceedings SDM, pp. 13\u201324 (2011)","DOI":"10.1137\/1.9781611972818.2"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"HP Kriegel","year":"2017","unstructured":"Kriegel, H.P., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? KAIS 52(2), 341\u2013378 (2017). doi: 10.1007\/s10115-016-1004-2","journal-title":"KAIS"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Lazarevic, A., Kumar, V.: Feature bagging for outlier detection. In: Proceedings KDD, pp. 157\u2013166 (2005)","DOI":"10.1145\/1081870.1081891"},{"issue":"2","key":"12_CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann, J., Isele, R., Jakob, M., Jentzsch, A., Kontokostas, D., Mendes, P.N., Hellmann, S., Morsey, M., van Kleef, P., Auer, S., Bizer, C.: DBpedia - a large-scale, multilingual knowledge base extracted from wikipedia. Semant. Web J. 6(2), 167\u2013195 (2015)","journal-title":"Semant. Web J."},{"issue":"1","key":"12_CR32","first-page":"3:1","volume":"6","author":"FT Liu","year":"2012","unstructured":"Liu, F.T., Ting, K.M., Zhou, Z.H.: Isolation-based anomaly detection. ACM TKDD 6(1), 3:1\u201339 (2012)","journal-title":"ACM TKDD"},{"issue":"2","key":"12_CR33","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek, J.: On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms 33(2), 142\u2013156 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR34","unstructured":"Morton, G.M.: A computer oriented geodetic data base and a new technique in file sequencing. Technical report, International Business Machines Co (1966)"},{"issue":"11","key":"12_CR35","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE TPAMI 36(11), 2227\u20132240 (2014)","journal-title":"IEEE TPAMI"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen, H.V., Gopalkrishnan, V.: Efficient pruning schemes for distance-based outlier detection. In: Proceedings ECML PKDD, pp. 160\u2013175 (2009)","DOI":"10.1007\/978-3-642-04174-7_11"},{"issue":"2","key":"12_CR37","first-page":"1469","volume":"3","author":"GH Orair","year":"2010","unstructured":"Orair, G.H., Teixeira, C., Wang, Y., Meira, W., Parthasarathy, S.: Distance-based outlier detection: consolidation and renewed bearing. PVLDB 3(2), 1469\u20131480 (2010)","journal-title":"PVLDB"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Papadimitriou, S., Kitagawa, H., Gibbons, P.B., Faloutsos, C.: LOCI: Fast outlier detection using the local correlation integral. In: Proceedings ICDE, pp. 315\u2013326 (2003)","DOI":"10.1109\/ICDE.2003.1260802"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Ramaswamy, S., Rastogi, R., Shim, K.: Efficient algorithms for mining outliers from large data sets. In: Proceedings SIGMOD, pp. 427\u2013438 (2000)","DOI":"10.1145\/342009.335437"},{"issue":"1","key":"12_CR40","first-page":"73","volume":"1","author":"PJ Rousseeuw","year":"2011","unstructured":"Rousseeuw, P.J., Hubert, M.: Robust statistics for outlier detection. WIREs DMKD 1(1), 73\u201379 (2011)","journal-title":"WIREs DMKD"},{"issue":"12","key":"12_CR41","first-page":"1976","volume":"8","author":"E Schubert","year":"2015","unstructured":"Schubert, E., Koos, A., Emrich, T., Z\u00fcfle, A., Schmid, K.A., Zimek, A.: A framework for clustering uncertain data. PVLDB 8(12), 1976\u20131979 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"12_CR42","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s10618-012-0300-z","volume":"28","author":"E Schubert","year":"2014","unstructured":"Schubert, E., Zimek, A., Kriegel, H.P.: Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection. Data Min. Knowl. Disc. 28(1), 190\u2013237 (2014)","journal-title":"Data Min. Knowl. Disc."},{"key":"12_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-18123-3_2","volume-title":"Database Systems for Advanced Applications","author":"E Schubert","year":"2015","unstructured":"Schubert, E., Zimek, A., Kriegel, H.-P.: Fast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 19\u201336. Springer, Cham (2015). doi: 10.1007\/978-3-319-18123-3_2"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.I.: Optimised kd-trees for fast image descriptor matching. In: Proceedings CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Venkatasubramanian, S., Wang, Q.: The Johnson-Lindenstrauss transform: an empirical study. In: Proceedings ALENEX Workshop (SIAM), pp. 164\u2013173 (2011)","DOI":"10.1137\/1.9781611972917.16"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Wang, Y., Parthasarathy, S., Tatikonda, S.: Locality sensitive outlier detection: a ranking driven approach. In: Proceedings ICDE, pp. 410\u2013421 (2011)","DOI":"10.1109\/ICDE.2011.5767852"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, X., Dou, W., He, Q., Zhou, R., Leckie, C., Kotagiri, R., Salcic, Z.: LSHiForest: A generic framework for fast tree isolation based ensemble anomaly analysis. In: Proceedings ICDE (2017)","DOI":"10.1109\/ICDE.2017.145"},{"issue":"1","key":"12_CR48","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2594473.2594476","volume":"15","author":"A Zimek","year":"2013","unstructured":"Zimek, A., Campello, R.J.G.B., Sander, J.: Ensembles for unsupervised outlier detection: challenges and research questions. SIGKDD Explor. 15(1), 11\u201322 (2013)","journal-title":"SIGKDD Explor."},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Zimek, A., Campello, R., Sander, J.: Data perturbation for outlier detection ensembles. In: Proceedings SSDBM, pp. 13:1\u201312 (2014)","DOI":"10.1145\/2618243.2618257"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Zimek, A., Gaudet, M., Campello, R., Sander, J.: Subsampling for efficient and effective unsupervised outlier detection ensembles. In: Proceedings KDD, pp. 428\u2013436 (2013)","DOI":"10.1145\/2487575.2487676"},{"issue":"5","key":"12_CR51","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/sam.11161","volume":"5","author":"A Zimek","year":"2012","unstructured":"Zimek, A., Schubert, E., Kriegel, H.P.: A survey on unsupervised outlier detection in high-dimensional numerical data. Stat. Anal. Data Min. 5(5), 363\u2013387 (2012)","journal-title":"Stat. Anal. Data Min."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T22:38:01Z","timestamp":1750891081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}