Sparse Oblique Decision Tree for Power System Security Rules Extraction and Embedding
نویسندگان
چکیده
Increasing the penetration of variable generation has a substantial effect on operational reliability power systems. The higher level uncertainty that stems from this variability makes it more difficult to determine whether given operating condition will be secure or insecure. Data-driven techniques provide promising way identify security rules can embedded in economic dispatch model keep system states secure. This paper proposes using sparse weighted oblique decision tree learn accurate, understandable, and embeddable are linear extracted as matrices recursive algorithm. These matrix then easily constraints calculations Big-M method. Tests several large datasets with high renewable energy demonstrate effectiveness proposed In particular, outperforms state-of-art while keeping simple. When dispatch, these significantly increase percentage reduce average solution time.
منابع مشابه
HHCART: An Oblique Decision Tree
Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis parallel splits. When the true decision boundaries are not aligned with...
متن کاملInduction of LDA Oblique Decision Rules
This paper presents a new algorithm of decision rules with oblique conditions induction. It bases on the Fisher’s Linear Discriminant Analysis as a tool of finding an initial classes separation. This technique has a good ability of oblique dependencies generalisation what reduces the number of decision rules and their complexities. Keywords—classification, machine learning, Linear Discriminant ...
متن کاملA System for Induction of Oblique Decision
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good oblique split (in the form of a hyperplane) at each node of a decision tree. Oblique decision tree methods are tuned especially for domains in which the attributes are numeric, although they can be adapted to symbolic or...
متن کاملAn Evolutionary Algorithm for Oblique Decision Tree Induction
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to search for a splitting hyperplane. The feature selection is embedded into the algorithm, which allows to eliminate redundant and noisy features at each node. The experimental evaluation of the proposed approach is presente...
متن کاملBISTRO: Binary Component Extraction and Embedding for Software Security Applications
In software security and malware analysis, researchers often need to directly manipulate binary program – benign or malicious – without source code. A useful pair of binary manipulation primitives are binary functional component extraction and embedding, for extracting a functional component from a binary program and for embedding a functional component in a binary program, respec tively. Such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2021
ISSN: ['0885-8950', '1558-0679']
DOI: https://doi.org/10.1109/tpwrs.2020.3019383