Efficient Algorithms for Mining Outliers from Large Data Sets

Efficient Algorithms for Mining Outliers from Large Data Sets. In Weidong Chen, Jeffrey F. Naughton, Philip A. Bernstein, editors, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA. pages 427-438, ACM, 2000. [doi]

@inproceedings{RamaswamyRS00,
  title = {Efficient Algorithms for Mining Outliers from Large Data Sets},
  year = {2000},
  doi = {10.1145/342009.335437},
  url = {http://doi.acm.org/10.1145/342009.335437},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/RamaswamyRS00},
  cites = {0},
  citedby = {0},
  pages = {427-438},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  editor = {Weidong Chen and Jeffrey F. Naughton and Philip A. Bernstein},
  publisher = {ACM},
  isbn = {1-58113-218-2},
}