The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Outlier Detection Using Replicator Neural Networks
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1996) · Cited by 20,179
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 1×
“Following [22], [4] and [17] when dealing with large databases, we consider it more meaningful to assign each datum an outlyingness score.”
BackgroundInfluentialBIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Hawkins, D. M. (1980) · doi:10.1007/978-94-015-3994-4 · Cited by 2,982
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195 · cited 1×
“Distance-based methods use distance metrics such as Mahalanobis distance [2, 15] or Euclidean distance [11, 13, 12].”
MethodEfficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171 · cited 1×
“Following [22], [4] and [17] when dealing with large databases, we consider it more meaningful to assign each datum an outlyingness score.”
BackgroundInfluentialFawcett, T., & Provost, F. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009700419189 · Cited by 881
Fast Very Robust Methods for the Detection of Multiple Outliers
Atkinson, A. C. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476872 · Cited by 269
On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms
Yamanishi, K., Takeuchi, J.-I., Williams, G., & Milne, P. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347160 · Cited by 226
Self-citation(2022) · Machine Graphics and Vision · doi:10.22630/mgv · Cited by 195
Replicator Neural Networks for Universal Optimal Source Coding
Hecht-Nielsen, R. (1995) · Science · doi:10.1126/science.269.5232.1860 · Cited by 134
Williams, G. J., & Huang, J. Z. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63797-4_87 · Cited by 74
Self-citationA unified approach for mining outliers
Knorr, E. M., & Ng, R. T. (1997) · Cited by 57
DuMouchel, W., & Schonlau, M. (1998) · Cited by 43
An efficient approximation scheme for data mining tasks
George Kollios, D., Gunupulos, D., Koudas, N., & Berchtold, S. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2001.914858 · Cited by 24
Equivalent error bars for neural network classifiers trained by Bayesian inference.
Sykacek, P. (1997) · Cited by 17
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“Replicator Neural Networks have been used for one-class anomaly detection [Hawkins et al. 2002; Williams et al. 2002].”
BackgroundMethodInfluentialDeep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
A survey of network anomaly detection techniques
Ahmed, M., Naser Mahmood, A., & Hu, J. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.11.016 · Cited by 1,750
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
Anomaly Detection Using Autoencoders with Nonlinear Dimensionality Reduction
Sakurada, M., & Yairi, T. (2014) · Proceedings of the MLSDA 2014 2nd Workshop on Machine Learning for Sensory Data Analysis · doi:10.1145/2689746.2689747 · Cited by 1,438
Metadata
- Authors
- Hawkins, S., He, H., Williams, G., & Baxter, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 170-180
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1876967670
- Cited by
- 710
- References
- 22
- FWCI
- 4.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.