—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
— Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction da...
In this work, a two-dimensional (2-D) representation of the hourly solar radiation data is proposed. The model enables accurate forecasting using image prediction methods. One year...
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...