Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1888
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Patra, B K | - |
dc.date.accessioned | 2013-03-14T06:18:44Z | - |
dc.date.available | 2013-03-14T06:18:44Z | - |
dc.date.issued | 2012-10 | - |
dc.identifier.citation | 2nd International Conference on Communication, Computing & Security (ICCCS-2012), Rourkela, October 6-8, 2012. Conference Proceeding published by Procedia Technology, Volume 6, 2012, Pages 469–474 | en |
dc.identifier.uri | http://hdl.handle.net/2080/1888 | - |
dc.description | Copyright for this paper belongs to proceeding publisher | en |
dc.description.abstract | Discovering outliers in a collection of patterns is a very well known problem that has been studied in various application domains. Density based technique is a popular one for finding outliers in a dataset. This technique calculates outlierness of each pattern using statistics of neighborhood of the pattern. However, density based approaches do not work well with large datasets as these approaches need to compute a large number of distance computations inorder to find neighborhood statistics. In this paper, we propose to utilize triangle inequality based in- dexing approach to speed up the classical density based outlier detection method LOF. Proposed approach computes less number of distance computations compared to the LOF method. Exper- imental results demonstrate that our proposed method reduces a significant number of distance computations compared to the LOF method. | en |
dc.format.extent | 121251 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Procedia Technology | en |
dc.subject | Outlier detection | en |
dc.subject | LOF | en |
dc.subject | triangle inequality | en |
dc.subject | large datasets | en |
dc.title | Using the triangle inequality to accelerate Density based Outlier Detection Method | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.