快速近似计算Shapley值的归因解释方法

Shapley值归因解释方法虽然能更准确量化解释结果, 但过高的计算复杂度严重影响了该方法的实用性. 本文引入KD树重新整理待解释模型的预测数据, 通过在KD树上插入虚节点, 使之满足TreeSHAP算法的使用条件, 在此基础上提出了KDSHAP方法. 该方法解除了TreeSHAP算法仅能解释树结构模型的限制, 将该算法计算Shapley值的高效性放宽到对所有的黑盒模型的解释中, 同时保证了计算准确度. 通过实验对比分析, KDSHAP方法的可靠性, 以及在解释高维输入模型时的适用性.     

Development of Phospholipids Vesicular Nanocarrier for Topical Delivery of Tea Tree Oil in Management of Atopic Dermatitis Using BALB/c Mice Model

This work aims to develop and evaluate the efficacy of tea tree oil (TTO) ethosomal cream with improved deposition in skin layers for treatment of atopic dermatitis (AD). Ethosomes of TTO are developed using phosphatidylcholine (2% and 3% w/v) and ethanol (20%, 30%, and 40% w/v). Ethosomes are evaluated for percent entrapment efficiency (%EE), vesicle size, zeta potential, and in vitro drug diffusion. Ethosomal creams with optimized ethosomal dispersion are developed and evaluated for physicochemical parameters, thermal stability, ex vivo permeation, skin retention, and in vitro cytotoxicity using HaCat skin cell lines in comparison to conventional creams of TTO. In vivo investigations of optimized creams are performed using BALB/c mice model. The %EE, vesicle size, and zeta potential for optimized ethosomes are found to be 76.19 ± 3.26%, 333.6 nm, and –35.3 mV, respectively. Ethosomal creams showed higher deposition in the epidermis and dermis. The optimized creams are non-cytotoxic to HaCat cell lines. The creams significantly reduce the inflammatory response by decreasing the clinical score and infiltration of white blood cells, eosinophils, and IgE antibodies. Overall efficacy of ethosomal cream is higher than conventional cream. In conclusion, optimized ethosomal cream of TTO shows good efficacy for treatment of AD. Practical applications : The method used for the formulation of ethosomes is simple and can be easily scaled up on the industrial level. The loading of TTO within ethosomes can increase the efficiency by enhanced drug deposition in the epidermis and might also improve its stability against oxidative degradation. Topical ethosomal cream of TTO can improve patient compliance by avoidance of adverse effects linked with corticosteroids and could be a possible complementary or alternative therapy in management of AD.     

Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

H∞ control for uncertain one‐sided Lipschitz nonlinear systems in finite frequency domain

The current article discusses the H_∞ disturbance attenuation control design problem for one‐sided Lipschitz systems in finite frequency domain. Models containing norm‐bounded parameter uncertainties, disturbances, and input nonlinearities are considered. By contrast to existing full frequency methods, the H_∞ controller is computed depending on the frequency ranges of disturbances. The finite frequency disturbance attenuation index is initially defined. Thanks to Finsler's lemma, sufficient and less conservative analysis conditions are also derived for the closed‐loop system. Then, synthesis conditions in the low, middle, and high frequency ranges as well as the whole frequency range, are formulated in terms of linear matrix inequalities. At last, to prove the effectiveness and the superiority of the proposed approach, a physical example is used and a comparative study is done.     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

“电网一张图”时空信息管理系统

文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。     

Learning Association Rules and Tracking the Changing Concepts on Webpages: An Effective Pornographic Websites Filtering Approach

We applied the decision tree algorithm to learn association rules between webpage’s category (pornographic or normal) and the critical features. Based on these rules, we proposed an efficient method of filtering pornographic webpages with the following major advantages: 1) a weighted window-based technique was proposed to estimate for the condition of concept drift for the keywords found recently in pornographic webpages; 2) checking only contexts of webpages without scanning pictures; 3) an incremental learning mechanism was designed to incrementally update the pornographic keyword database.     

Hybrid self-inertia weight adaptive particle swarm optimisation with local search using C4.5 decision tree classifier for feature selection problems

ABSTRACT

Feature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets.     

Large neighborhood search for the bike request scheduling problem

This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds.