What is the generally used and accepted way to handle LOF scores as inifinite in ELKI, due to duplicate points? If LOF scores of ELKI to be used, should such scores be considered as maximum-scores, zeros, or inliers?
1
There are 1 answers
Related Questions in DATA-MINING
- How can I compare the similarity between multiple sets?
- I can't click the xpath address after 2 iteration
- Text clustering based on “stance” rather than the distribution of embeddings as the basis for clustering
- Using a BERT Model, I keep getting the error: Op type not registered 'CaseFoldUTF8' in binary running on MacBook-Pro-21.lan
- How to generate all possible association rule using frequent itemset?
- Representation of sequential rules in data mining (sequence pattern mining)
- Add rows to the weather data for each day, placing the corresponding date at the top
- The Output of this python code is not what I am expecting
- Preparing CSV files for pm4py event-log conversion
- KNIME Concatenate node with List Files/Folders loop?
- Weka attribute problems
- What is a more optimal method for performing this Pandas Computation
- Scrape Company opening amd closing time on Google map
- Python as_strided method, how does it work?
- Why is this .csv file not woking in Weka?
Related Questions in ELKI
- Getting row indices back from the DBIDs neighbours in ELKI CorePredicate DBCAN
- WeightedCorePredicate Implementation for ELKI - An example
- Elki GDBSCAN Java/Scala - how to modify the CorePredicate
- Visualization results of dbscan using ELKI
- DBSCAN: How to Cluster Large Dataset with One Huge Cluster
- ELKI: How to Specify Feature Columns of CSV for K-Means
- ELKI: LOF score as infinite
- how to install ELKI on windows?
- Should DBSCAN and its index have the same distance function
- sample_weight option in the ELKI implementation of DBSCAN
- Create Dendrogram with Elki
- KMeans usage in ELKI, comprehensive example
- How can I cluster data using a distance matrix with the ELKI library?
- ELKI KNNDistancesSampler
- Can ELKI cluster non-normalized negative points?
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
The LOF score of a point is infinite if at least one neighbor of a point has reachability distance 0 (because they are duplicate points).
If the point itself has a non-zero reachability, the value is thus infinitely higher than the lrd of the neighbors (or in terms of density: the point is infinitely less dense than the neighbors), so it is an outlier.
The proper way of handling this is to increase k (minpts) to be larger than the maximum number of duplicate points. If you have too many duplicate points, this usually indicates that using LOF may not be a good idea for this data set. LOF requires that a nearest-neighbor density estimation makes sense on the data, and if you have this kind of problems, the cause usually is the input data, not the algorithm.