{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:28:11Z","timestamp":1773325691272,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s00778-004-0125-5","type":"journal-article","created":{"date-parts":[[2004,8,18]],"date-time":"2004-08-18T03:53:46Z","timestamp":1092801226000},"page":"211-221","source":"Crossref","is-referenced-by-count":147,"title":["An effective and efficient algorithm for high-dimensional outlier detection"],"prefix":"10.1007","volume":"14","author":[{"given":"Charu C.","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/373626.373638","volume":"30","author":"Aggarwal","year":"2001","unstructured":"Aggarwal CC (2001) Re-designing distance functions and distance based applications for high dimensional data. ACM SIGMOD Rec 30(1):13-18","journal-title":"ACM SIGMOD Rec"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC(1999) Fast algorithms for projected clustering. In: Proceedings of ACM SIGMOD, pp 61-72","DOI":"10.1145\/304182.304188"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu P (2000) Finding generalized projected clusters in high dimensional spaces. In: Proceedings of ACM SIGMOD, pp 70-81","DOI":"10.1145\/342009.335383"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional space. In: Proceedings of ICDT, pp 420-434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"Aggarwal","year":"1997","unstructured":"Aggarwal CC, Orlin JB, Tai RP (1997) Optimized crossover for the independent set problem. Operat Res 45(2):226-234","journal-title":"Operat Res"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of ACM SIGMOD, pp 94-105","DOI":"10.1145\/276304.276314"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD, pp 207-216","DOI":"10.1145\/170035.170072"},{"key":"CR8","unstructured":"Arning A, Agrawal R, Raghavan P (1996) A linear method for deviation detection in large databases. In: Proceedings of KDD, pp 164-169"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbors meaningful? In: Proceedings of ICDT, pp 217-235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Breunig MM, Kriegel H-P, Ng RT, Sander J (2000) LOF: identifying density-based local outliers. In: Proceedings of ACM SIGMOD, pp 93-104","DOI":"10.1145\/342009.335388"},{"key":"CR11","unstructured":"Chakrabarti K, Mehrotra S (2000) Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: Proceedings of the VLDB conference, pp 89-104"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Darwin C (1859) The origin of species by natural selection. Available at: http:\/\/www.literature.org\/authors\/darwin-charles\/the-origin-of-species\/","DOI":"10.5962\/bhl.title.68064"},{"key":"CR13","unstructured":"De Jong KA (1975) Analysis of the behaviour of a class of genetic adaptive systems. PhD dissertation, University of Michigan, Ann Arbor, MI"},{"key":"CR14","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD, pp 226-231"},{"key":"CR15","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: Proceedings of ACM SIGMOD, pp 73-84","DOI":"10.1145\/276304.276312"},{"key":"CR17","unstructured":"Hinneburg A, Aggarwal CC, Keim DA (2000) What is the nearest neighbor in high dimensional spaces? In: Proceedings of the VLDB conference, pp 506-515"},{"key":"CR18","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4589):671-680","journal-title":"Science"},{"key":"CR20","unstructured":"Knorr E, Ng R (1998) Algorithms for mining distance-based outliers in large data sets. In: Proceedings of the VLDB conference, pp 392-403"},{"key":"CR21","unstructured":"Knorr E, Ng R (1999) Finding intensional knowledge of distance-based outliers. In: Proceedings of the VLDB conference, pp 211-222"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1109\/TKDE.2003.1245289","volume":"15","author":"Parthasarathy","year":"2003","unstructured":"Parthasarathy, S Aggarwal CC (2003) On the use of conceptual reconstruction for mining massively incomplete data sets. IEEE Trans Knowl Data Eng 15(6):1512-1531","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Ramaswamy S, Rastogi R, Shim K (2000) Efficient algorithms for mining outliers from large data sets. In: Proceedings of ACM SIGMOD, pp 427-438","DOI":"10.1145\/342009.335437"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of ACM SIGMOD, pp 103-114","DOI":"10.1145\/233269.233324"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0125-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0125-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0125-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:04:58Z","timestamp":1559127898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0125-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0125-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}