Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

316293124 · Jun 202019922001200920172026
48 results for load clustering

This paper proposes a submodular load clustering method for transmission-level load areas.

problem Traditional load analysis challenges with new electricity usage patterns.
method Robust Principal Component Analysis (R-PCA) and submodular cluster center selection.
result The proposed method efficiently clusters load areas and demonstrates effectiveness in PJM load data.

Hierarchical clustering models capture electricity load patterns from smart meters.

problem Improving efficiency and sustainability of electricity systems.
method Quantile autocovariances and autocorrelations for summarizing time series.
result Clusters identify relevant consumption behaviors and capture geo-demographic segmentation.

Consumer Demand Response (DR) is an important research and industry problem, which seeks to categorize, predict and modify consumer's energy consumption. Unfortunately, traditional clustering methods have resulted in many hundreds of clusters, with a given consumer often associated with several clusters, making it diff…

2017-02-05abs ↗pdf ↗

SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.

problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.

Paper examines vulnerabilities in data-driven pricing schemes.

problem Vulnerability of clustering-oriented pricing schemes to malicious user behavior.
method Defined a notion of disguising to identify strategic behaviors of malicious users, characterized sensitivity zones to evaluate malicious user percentages, conducted cost benefit analysis.
result Concluded with a vulnerability analysis of data-driven pricing schemes.

CROCS clusters consumer behaviour from smart meters, capturing variability and robustness.

problem Insufficient consumer segmentation in existing clustering methods.
method Two-stage clustering framework: first stage clusters daily load profiles, second stage uses WSMD for set-to-set comparison.
result CROCS captures intra-consumer variability and robustness to anomalies and missing data.

New ML-based detection improves PMH signal detection in load-modulated MIMO systems.

problem Detecting PMH signals without prior CSI is challenging and computationally expensive.
method Proposes HEM-ML and HEM-KD schemes using EM and KD-tree for efficient detection.
result Achieves comparable detection results to optimal ML detector with reduced complexity.

A mixture of common skew-t factor analyzers model is introduced for model-based clustering of high-dimensional data. By assuming common component factor loadings, this model allows clustering to be performed in the presence of a large number of mixture components or when the number of dimensions is too large to be well…

2013-07-21abs ↗pdf ↗

Study explores K-means clustering of variables and its relation to PCA.

problem Exploring the relationship between K-means clustering of variables and PCA.
method Apply PCA to original data and K-means to transposed data, quantify variable contributions to principal components.
result Identifies how variable clusters contribute to principal components identified by PCA.

Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems, however, use simple generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern ma…

2018-10-03abs ↗pdf ↗

This paper analyzes load predictability at different aggregation levels and improves forecasting accuracy.

problem Challenges in short-term load forecasting, especially at low aggregation levels.
method Characterized SME and residential loads, quantified predictability using approximate entropy, compared various STLF techniques.
result Improved forecasting accuracy for low-aggregation loads, validated with data processing techniques.

In this chapter we review the main literature related to kernel spectral clustering (KSC), an approach to clustering cast within a kernel-based optimization setting. KSC represents a least-squares support vector machine based formulation of spectral clustering described by a weighted kernel PCA objective. Just as in th…

2015-05-03abs ↗pdf ↗

A distributed framework for reducing high-dimensional matrix-variate time series data.

problem Reducing dimensionality of high-dimensional, heterogeneous matrix-variate time series data.
method Data partitioning, distributed two-dimensional tensor PCA, aggregation, final PCA, factor matrix computation.
result Preserves latent matrix structure, improves computational efficiency and information utilization.

In (exploratory) factor analysis, the loading matrix is identified only up to orthogonal rotation. For identifiability, one thus often takes the loading matrix to be lower triangular with positive diagonal entries. In Bayesian inference, a standard practice is then to specify a prior under which the loadings are indepe…

2014-09-26abs ↗pdf ↗

Paper uses econometrics time series model with T-student Distribution for short-term load forecasting.

problem Accurate short-term load forecasting for optimizing electrical sources and protecting energy.
method Uses SARIMA-GARCH model with T-student Distribution to forecast electric load.
result The proposed model outperforms the ARIMA model with Normal Distribution.

We consider a collection of prediction experiments, which are clustered in the sense that groups of experiments ex- hibit similar relationship between the predictor and response variables. The experiment clusters as well as the regres- sion relationships are unknown. The regression relation- ships define the experiment…

2011-03-23abs ↗pdf ↗

We use online convex optimization (OCO) for setpoint tracking with uncertain, flexible loads. We consider full feedback from the loads, bandit feedback, and two intermediate types of feedback: partial bandit where a subset of the loads are individually observed and the rest are observed in aggregate, and Bernoulli feed…

2017-09-12abs ↗pdf ↗

This paper uses a diffusion model to forecast electrical loads with uncertainty.

problem Uncertainties in electrical load forecasting due to renewable energy and external events.
method Diffusion-based Seq2Seq structure for epistemic uncertainty and robust additive Cauchy distribution for aleatoric uncertainty.
result Ability to separate and quantify both types of uncertainties in load forecasting.

Paper presents a method for probabilistic load forecasting using adaptive online learning.

problem Inability to assess intrinsic uncertainties and capture dynamic changes in consumption patterns.
method Adaptive online learning of hidden Markov models for recursive parameter updates and sequential prediction.
result Significant improvement in performance compared to existing techniques across various scenarios.

New method predicts heat load in thermal grids using latent variables.

problem Predicting heat load in district energy systems.
method Combines nominal model for outdoor temperature with latent variable model for residual heat load.
result Proposed method achieves better prediction accuracy than artificial neural networks.

Paper proposes dense average network for improved power load forecasting.

problem Improving power load forecasting accuracy to save millions for the power industry.
method Introduces dense average connection and constructs dense average network for power load forecasting.
result Proposed model outperforms existing methods on public datasets.

Paper proposes a framework for probabilistic load forecasting by integrating point forecasts.

problem Short-term load forecasting for power systems energy management.
method Two-stage framework: first stage for point forecasting, second stage for probabilistic forecasting using feature integration.
result Numerical results show effectiveness of the proposed approach in hour-ahead load forecasting.

A new method calculates risk loadings in classification ratemaking without subjective parameters.

problem Subjective risk loading parameters in classification ratemaking.
method Bootstrap method to calculate total risk premium, then determine risk loading parameters using quantile regression models.
result Risk premiums calculated by the new method reasonably differentiate different risk classes.

Deep learning improves weather modeling for electricity load forecasting.

problem Accurate load and renewable energy forecasting requires complex spatio-temporal weather modeling.
method Automated spatio-temporal feature extraction using deep neural networks.
result Deep learning outperforms traditional methods in French national load forecasting.

A method for selecting data for short-term load forecasting using Bayesian probabilistic models.

problem Lack of effective data selection techniques in power load forecasting.
method A fully automatic methodology based on a full Bayesian probabilistic model.
result The method improves the performance of load forecast models using real data.

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.

Adaptive probabilistic load forecasting improves performance in power systems.

problem Complexity of electricity load forecasting due to changing drivers and local generation.
method Adaptive probabilistic approach using Kalman filter and online gradient descent.
result Adaptive probabilistic forecasts improve performance in both point and probabilistic forecasting.