{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:49:39Z","timestamp":1725544179374},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_66","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"557-566","source":"Crossref","is-referenced-by-count":42,"title":["A Nonparametric Outlier Detection for Effectively Discovering Top-N Outliers from Engineering Data"],"prefix":"10.1007","author":[{"given":"Hongqin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Foss","sequence":"additional","affiliation":[]},{"given":"Junfeng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"66_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1061\/(ASCE)0887-3801(2004)18:4(291)","volume":"18","author":"O. Raz","year":"2004","unstructured":"Raz, O., Buchheit, R., Shaw, M., Koopman, P., Faloutsos, C.: Detecting Semantic Anomalies in Truck Weigh-in-Motion Traffic Data Using Data Mining. Journal of Computing in Civil Engineering, ASCE\u00a018(4), 291\u2013300 (2004)","journal-title":"Journal of Computing in Civil Engineering, ASCE"},{"key":"66_CR2","unstructured":"Knorr, E., Ng, R.: Algorithms for Mining Distance-based Outliers in Large Datasets. In: Proc. of 24th International Conference on Very Large Databases (1998)"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Breunig, M., Kriegel, H., Ng, R., Sander, J.: LOF: Identifying Density-Based Local Outliers. In: Proc. of ACM SIGMOD 2000 International Conference on Management of Data, Dallas, TX (2000)","DOI":"10.1145\/342009.335388"},{"key":"66_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-47887-6_53","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Tang","year":"2002","unstructured":"Tang, J., Chen, Z., Fu, A., Cheung, D.: Enhancing Effectiveness of outlier Detections for Low Density Patterns. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 535\u2013548. Springer, Heidelberg (2002)"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Foss, A., Za\u00efane, O.: A Parameterless Method for Efficiently Discovering Clusters of arbitrary Shape in Large Datasets. In: Proc. of 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan (2002)","DOI":"10.1109\/ICDM.2002.1183901"},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-94-015-3994-4","volume-title":"Identification of Outliers","author":"D. Hawkins","year":"1980","unstructured":"Hawkins, D.: Identification of Outliers, p. 1. Chapman and Hall, London (1980)"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Ramaswamy, S., Rastogi, R., Shim, K.: Efficient Algorithms for Mining Outliers from Large Data Sets. In: Proc. of the ACM SIGMOD International Conference on Management of Data, Dallas, TX (2000)","DOI":"10.1145\/342009.335437"},{"key":"66_CR8","unstructured":"Goldstein, J., Ramakrishnan, R.: Constrast Polots and P-Sphere Trees: Space vs. Time in Nearest Neighbor Searches. In: Proc. 26th VLDB conference (2000)"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. In: STOC 1998 (1998)","DOI":"10.1145\/276698.276877"},{"key":"66_CR10","unstructured":"Liu, T., Moore, A.W., Gray, A., Wang, K.: An Investigation of Practical Approximate Nearest Neighbor Algorithms. In: NIPS (December 2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:59Z","timestamp":1619506319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11731139_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}