The explosive growth of time-series data, the scale of time series data (TSD) suggests that the scale and capability of many Internet of Things (IoT) based applications has already been exceeded. Moreover, redundancy persists in TSD due to correlation between information acquired via different sources. In this project, we propose a cohort of dominant dataset selection algorithms for electricity consumption time series data with focus on discriminating the dominant dataset that is small dataset but capable of representing the kernel information carried by time series data with an arbitrarily small error rate less than “. Furthermore, we prove that the selection problem of the minimum dominant dataset is an NP-complete problem. The affine transformation model is introduced to define as the linear correlation relationship between time series data objects. Our proposed framework consists of the scanning selection algorithm with O(n3) time complexity and the greedy selection algorithm with O(n4) time complexity, which are respectively proposed to select the dominant dataset based on the linear correlation distance between time-series data objects. The proposed algorithms are evaluated on the real electricity consumption data of Harbin city in China. The experimental results show that the proposed algorithms not only reduce the size of extracted kernel dataset but also ensure the time-series data integrity in term of accuracy and efficiency.