Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/14684
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRanjan K.G.
dc.contributor.authorPrusty B.R.
dc.contributor.authorJena D.
dc.date.accessioned2021-05-05T10:15:39Z-
dc.date.available2021-05-05T10:15:39Z-
dc.date.issued2019
dc.identifier.citation1st International Conference on Power Electronics Applications and Technology in Present Energy Scenario, PETPES 2019 - Proceedings , Vol. , , p. -en_US
dc.identifier.urihttps://doi.org/10.1109/PETPES47060.2019.9004012
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14684-
dc.description.abstractOut-of-sample forecasting of historically observed time-series inevitably necessitates the application of a suitable data cleaning method to assist improved accuracy of the obtained results. The existing data cleaning methods though work amply with nonvolatile time series; fail when applied to a volatile time-series. In this paper, the suitability of the k-nearest neighbor approach and sliding window prediction approach is tested on a set of nonvolatile and volatile time-series. The performance comparison is carried out considering the historical record of furniture sales data, PV generation, load power, and ambient temperature data of different time-steps collected from various places in the USA. Further, the effect of parameters allied with both the methods on the preprocessing result is also analyzed. Finally, possible reforms are suggested for the appropriate preprocessing of volatile time-series. © 2019 IEEE.en_US
dc.titleComparison of two data cleaning methods as applied to volatile time-seriesen_US
dc.typeConference Paperen_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.