In many machine learning applications,data are not free,and there is a test cost for each data item. For the economical reason,some existing works try to minimize the test cost and at the same time,preserve a particul...In many machine learning applications,data are not free,and there is a test cost for each data item. For the economical reason,some existing works try to minimize the test cost and at the same time,preserve a particular property of a given decision system. In this paper,we point out that the test cost one can afford is limited in some applications. Hence,one has to sacrifice respective properties to keep the test cost under a budget. To formalize this issue,we define the test cost constraint attribute reduction problem,where the optimization objective is to minimize the conditional information entropy. This problem is an essential generalization of both the test-cost-sensitive attribute reduction problem and the 0-1 knapsack problem,therefore it is more challenging. We propose a heuristic algorithm based on the information gain and test costs to deal with the new problem. The algorithm is tested on four UCI（University of California-Irvine） datasets with various test cost settings. Experimental results indicate the appropriate setting of the only user-specified parameter λ.展开更多
For face detection under complex background and illumination, a detection method that combines the skin color segmentation and cost-sensitive Adaboost algorithm is proposed in this paper. First, by using the character...For face detection under complex background and illumination, a detection method that combines the skin color segmentation and cost-sensitive Adaboost algorithm is proposed in this paper. First, by using the characteristic of human skin color clustering in the color space, the skin color area in YC b C r color space is extracted and a large number of irrelevant backgrounds are excluded; then for remedying the deficiencies of Adaboost algorithm, the cost-sensitive function is introduced into the Adaboost algorithm; finally the skin color segmentation and cost-sensitive Adaboost algorithm are combined for the face detection. Experimental results show that the proposed detection method has a higher detection rate and detection speed, which can more adapt to the actual field environment.展开更多
To secure power system operations,practical dispatches in industries place a steady power transfer limit on critical inter-corridors,rather than high-dimensional and strong nonlinear stability constraints.However,comp...To secure power system operations,practical dispatches in industries place a steady power transfer limit on critical inter-corridors,rather than high-dimensional and strong nonlinear stability constraints.However,computational complexities lead to over-conservative pre-settings of transfer limit,which further induce undesirable and non-technical congestion of power transfer.To conquer this barrier,a scenario-classification hybrid-based banding method is proposed.A cluster technique is adopted to separate similarities from historical and generated operating condition dataset.With a practical rule,transfer limits are approximated for each operating cluster.Then,toward an interpretable online transfer limit decision,costsensitive learning is applied to identify cluster affiliation to assign a transfer limit for a given operation.In this stage,critical variables that affect the transfer limit are also picked out via mean impact value.This enables us to construct low-complexity and dispatcher-friendly rules for fast determination of transfer limit.The numerical case studies on the IEEE 39-bus system and a real-world regional power system in China illustrate the effectiveness and conservativeness of the proposed method.展开更多
基金supported by the National Natural Science Foundation of China under Grant No. 60873077/F020107
文摘In many machine learning applications,data are not free,and there is a test cost for each data item. For the economical reason,some existing works try to minimize the test cost and at the same time,preserve a particular property of a given decision system. In this paper,we point out that the test cost one can afford is limited in some applications. Hence,one has to sacrifice respective properties to keep the test cost under a budget. To formalize this issue,we define the test cost constraint attribute reduction problem,where the optimization objective is to minimize the conditional information entropy. This problem is an essential generalization of both the test-cost-sensitive attribute reduction problem and the 0-1 knapsack problem,therefore it is more challenging. We propose a heuristic algorithm based on the information gain and test costs to deal with the new problem. The algorithm is tested on four UCI（University of California-Irvine） datasets with various test cost settings. Experimental results indicate the appropriate setting of the only user-specified parameter λ.
基金supported by the National Basic Research Program of China(973 Program)under Grant No.2012CB215202the National Natural Science Foundation of China under Grant No.51205046
文摘For face detection under complex background and illumination, a detection method that combines the skin color segmentation and cost-sensitive Adaboost algorithm is proposed in this paper. First, by using the characteristic of human skin color clustering in the color space, the skin color area in YC b C r color space is extracted and a large number of irrelevant backgrounds are excluded; then for remedying the deficiencies of Adaboost algorithm, the cost-sensitive function is introduced into the Adaboost algorithm; finally the skin color segmentation and cost-sensitive Adaboost algorithm are combined for the face detection. Experimental results show that the proposed detection method has a higher detection rate and detection speed, which can more adapt to the actual field environment.
基金supported in part by State Grid Corporation of China Project“Research on high penetrated renewable energy oriented intelligent identification for curtailment impacts and aid decision-making for promoting consumption in regional power grids”(No.5108-202135035A-0-0-00).
文摘To secure power system operations,practical dispatches in industries place a steady power transfer limit on critical inter-corridors,rather than high-dimensional and strong nonlinear stability constraints.However,computational complexities lead to over-conservative pre-settings of transfer limit,which further induce undesirable and non-technical congestion of power transfer.To conquer this barrier,a scenario-classification hybrid-based banding method is proposed.A cluster technique is adopted to separate similarities from historical and generated operating condition dataset.With a practical rule,transfer limits are approximated for each operating cluster.Then,toward an interpretable online transfer limit decision,costsensitive learning is applied to identify cluster affiliation to assign a transfer limit for a given operation.In this stage,critical variables that affect the transfer limit are also picked out via mean impact value.This enables us to construct low-complexity and dispatcher-friendly rules for fast determination of transfer limit.The numerical case studies on the IEEE 39-bus system and a real-world regional power system in China illustrate the effectiveness and conservativeness of the proposed method.
