惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

L
LangChain Blog
有赞技术团队
有赞技术团队
博客园_首页
IT之家
IT之家
爱范儿
爱范儿
量子位
小众软件
小众软件
Jina AI
Jina AI
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 聂微东
The Cloudflare Blog
博客园 - 司徒正美
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
大猫的无限游戏
大猫的无限游戏
月光博客
月光博客
雷峰网
雷峰网
V
Visual Studio Blog
博客园 - Franky
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
美团技术团队
Last Week in AI
Last Week in AI
S
SegmentFault 最新的问题

cs.DS updates on arXiv.org

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications A computational phase transition for learning-to-sample from Ising models Covering vertices by sequential stars Fermi-Dirac machines as quantizations of neurons A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation A Tight Bound on Localization of Electrical Flows Optimal Dimension-Free Sampling for Regularized Classification Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs Beyond the Half-Approximation: Fair and Efficient Online Class Matching Efficient Uniform Sampling of Surjections via their Profiles Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking Learning-Augmented Online Scheduling with Parsimonious Preemption Entropy Equivalence Testing Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees The Secretary Problem with a Stochastic Precursor Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification Block-Sphere Vector Quantization An Approximation Algorithm for Graph Label Selection Iterative Chow Filtering for Learning with Distribution Shift Complexity of Non-Log-Concave Sampling in Fisher Information Stochastic Matching via Local Sparsification Finite Sample Bounds for Learning with Score Matching What is Learnable in Valiant's Theory of the Learnable? Provable Quantization with Randomized Hadamard Transform Min-Max Optimization Requires Exponentially Many Queries Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm A proximal gradient algorithm for composite log-concave sampling
Clustering Residential Electricity Load Curves via Commun...
Yunyou Huang, Jianfeng Zhan, Nana Wang, Chunjie Luo, Lei Wang, R · 2018-11-26 · via cs.DS updates on arXiv.org

Performing analytic of household load curves (LCs) has significant value in predicting individual electricity consumption patterns, and hence facilitate developing demand-response strategy, and finally achieve energy efficiency improvement and emission reduction. LC clustering is a widely used analytic technology, which discovers electricity consumption patterns by grouping similar LCs into same sub-groups. However, previous clustering methods treat each LC in the data set as an individual time series, ignoring the inherent relationship among different LCs, restraining the performance of the clustering methods. What's more, due to the significant volatility and uncertainty of LCs, the previous LC clustering approaches inevitably result in either lager number of clusters or huge variances within a cluster, which is unacceptable for actual application needs. In this paper, we proposed an integrated approach to address this issue. First, we converted the LC clustering task into the community detection task in network. Second, we proposed a clustering approach incorporated with community detection to improve the performance of LC clustering, which includes network construction, community detection and typical load profile extraction. The method convert the data set into a network in which the inherent relationship among LCs is represented by the edges of the network. Third, we construct a multi-layer typical load profile directory to make the trade-off between variances within a cluster and the number of the clusters, enabling the researchers to assess the LCs and the customers in different layers according to practical application requirements. The experiments demonstrate that our integrated approach outperform the state-of-the-art methods.