O
- Object type@Title(value="COF: Connectivity-based Outlier Factor") @Reference(authors="J. Tang, Z. Chen, A. W. C. Fu, D. W. Cheung", title="Enhancing effectiveness of outlier detections for low density patterns", booktitle="In Advances in Knowledge Discovery and Data Mining", url="https://doi.org/10.1007/3-540-47887-6_53", bibkey="DBLP:conf/pakdd/TangCFC02") public class COF<O> extends AbstractDistanceBasedAlgorithm<O,OutlierResult> implements OutlierAlgorithm
Reference:
J. Tang, Z. Chen, A. W. C. Fu, D. W. Cheung
Enhancing effectiveness of outlier detections for low density patterns.
Advances in Knowledge Discovery and Data Mining.
Modifier and Type | Class and Description |
---|---|
static class |
COF.Parameterizer<O>
Parameterization class.
|
Modifier and Type | Field and Description |
---|---|
protected int |
k
The number of neighbors to query (including the query point!)
|
private static Logging |
LOG
The logger for this class.
|
ALGORITHM_ID
DISTANCE_FUNCTION_ID
Constructor and Description |
---|
COF(int k,
DistanceFunction<? super O> distanceFunction)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
protected void |
computeAverageChainingDistances(KNNQuery<O> knnq,
DistanceQuery<O> dq,
DBIDs ids,
WritableDoubleDataStore acds)
Computes the average chaining distance, the average length of a path
through the given set of points to each target.
|
private void |
computeCOFScores(KNNQuery<O> knnq,
DBIDs ids,
DoubleDataStore acds,
WritableDoubleDataStore cofs,
DoubleMinMax cofminmax)
Compute Connectivity outlier factors.
|
TypeInformation[] |
getInputTypeRestriction()
Get the input type restriction used for negotiating the data query.
|
protected Logging |
getLogger()
Get the (STATIC) logger for this class.
|
OutlierResult |
run(Database database,
Relation<O> relation)
Runs the COF algorithm on the given database.
|
getDistanceFunction
run
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
run
private static final Logging LOG
protected int k
public COF(int k, DistanceFunction<? super O> distanceFunction)
k
- the number of neighbors to use for comparison (excluding the query
point)distanceFunction
- the neighborhood distance functionpublic OutlierResult run(Database database, Relation<O> relation)
database
- Database to queryrelation
- Data to processprotected void computeAverageChainingDistances(KNNQuery<O> knnq, DistanceQuery<O> dq, DBIDs ids, WritableDoubleDataStore acds)
knnq
- KNN querydq
- Distance queryids
- IDs to processacds
- Storage for average chaining distancesprivate void computeCOFScores(KNNQuery<O> knnq, DBIDs ids, DoubleDataStore acds, WritableDoubleDataStore cofs, DoubleMinMax cofminmax)
knnq
- KNN queryids
- IDs to processacds
- Average chaining distancescofs
- Connectivity outlier factor storagecofminmax
- Score minimum/maximum trackerpublic TypeInformation[] getInputTypeRestriction()
AbstractAlgorithm
getInputTypeRestriction
in interface Algorithm
getInputTypeRestriction
in class AbstractAlgorithm<OutlierResult>
protected Logging getLogger()
AbstractAlgorithm
getLogger
in class AbstractAlgorithm<OutlierResult>
Copyright © 2019 ELKI Development Team. License information.