-
1
-
-
0347172110
-
OPTICS: Ordering points to identify the cluster structure
-
M. Ankerst, M. Breunig, H.P. Kriegel, and J. Sander: "OPTICS: Ordering points to identify the cluster structure", Proc. of ACM-SIGMOD Conf., pp. 49-60, 1999.
-
(1999)
Proc. of ACM-SIGMOD Conf.
, pp. 49-60
-
-
Ankerst, M.1
Breunig, M.2
Kriegel, H.P.3
Sander, J.4
-
5
-
-
84899149437
-
A Fast Computer Intrusion Detection Algorithm based on Hypothesis Testing of Command Transition Probabilities
-
W. DuMouchel, M. Schonlau: "A Fast Computer Intrusion Detection Algorithm based on Hypothesis Testing of Command Transition Probabilities", Proc.of 4th Intl. Conf. On Knowledge Discovery and Data Mining, 1998, pp. 189-193.
-
(1998)
Proc.of 4th Intl. Conf. on Knowledge Discovery and Data Mining
, pp. 189-193
-
-
Dumouchel, W.1
Schonlau, M.2
-
6
-
-
85170282443
-
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
-
M. Ester, H. Kriegel, J. Sander, X. Xu: "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", Proc. of 2nd Intl. Conf. On Knowledge Discovery and Data Mining, 1996, pp 226-231.
-
(1996)
Proc. of 2nd Intl. Conf. on Knowledge Discovery and Data Mining
, pp. 226-231
-
-
Ester, M.1
Kriegel, H.2
Sander, J.3
Xu, X.4
-
7
-
-
0013113240
-
Adaptive Fraud Detection
-
Kluwer Academic Publishers
-
T. Fawcett, F. Provost: "Adaptive Fraud Detection", Data Mining and Knowledge Discovery Journal, Kluwer Academic Publishers, Vol. 1, No. 3, 1997, pp 291-316.
-
(1997)
Data Mining and Knowledge Discovery Journal
, vol.1
, Issue.3
, pp. 291-316
-
-
Fawcett, T.1
Provost, F.2
-
8
-
-
0032091595
-
Cure: An Efficient Clustering Algorithm for Large Databases
-
S. Guha, R. Rastogi, K. Shim: "Cure: An Efficient Clustering Algorithm for Large Databases", In Proc. of the ACM SIGMOD Conf., 1998, pp 73-84.
-
(1998)
Proc. of the ACM SIGMOD Conf.
, pp. 73-84
-
-
Guha, S.1
Rastogi, R.2
Shim, K.3
-
10
-
-
0002948319
-
Algorithms for Mining Distance-based Outliers in Large Datasets
-
E. Knorr, R. Ng: "Algorithms for Mining Distance-based Outliers in Large Datasets", Proc. of 24th Intl. Conf. On VLDB, 1998, pp 392-403.
-
(1998)
Proc. of 24th Intl. Conf. on VLDB
, pp. 392-403
-
-
Knorr, E.1
Ng, R.2
-
11
-
-
0012905555
-
Finding Intensional Knowledge of Distance-based Outliers
-
E. Knorr, R. Ng: "Finding Intensional Knowledge of Distance-based Outliers", Proc. of 25th Intl. Conf. On VLDB, 1999, pp 211-222.
-
(1999)
Proc. of 25th Intl. Conf. on VLDB
, pp. 211-222
-
-
Knorr, E.1
Ng, R.2
-
14
-
-
84976703615
-
Nearest Neighbor Queries
-
N. Roussopoulos, S. Kelley, F. Vincent, "Nearest Neighbor Queries", Proc. of ACM SIGMOD Conf., 1995, pp 71-79.
-
(1995)
Proc. of ACM SIGMOD Conf.
, pp. 71-79
-
-
Roussopoulos, N.1
Kelley, S.2
Vincent, F.3
-
16
-
-
70449702302
-
A Robust Outlier Detection Scheme in Large Data Sets
-
J. Tang, Z. Chen, A. Fu, D. Cheung, "A Robust Outlier Detection Scheme in Large Data Sets", PAKDD, 2002.
-
(2002)
PAKDD
-
-
Tang, J.1
Chen, Z.2
Fu, A.3
Cheung, D.4
-
17
-
-
0030157145
-
BIRCH: An Efficient Data Clustering Method for Very Large Databases
-
T. Zhang, R. Ramakrishnan, M. Linvy: "BIRCH: An Efficient Data Clustering Method for Very Large Databases", Proc. of ACM SIGMOD Intl. Conf., , 1996, pp 103-114.
-
(1996)
Proc. of ACM SIGMOD Intl. Conf.
, pp. 103-114
-
-
Zhang, T.1
Ramakrishnan, R.2
Linvy, M.3
|