In order to improve the performance of classifiers in subjective domains, this paper defines a metric to measure the quality of the subjectively labelled training data (QoSTD) by means of K-means clustering. Then, the...In order to improve the performance of classifiers in subjective domains, this paper defines a metric to measure the quality of the subjectively labelled training data (QoSTD) by means of K-means clustering. Then, the QoSTD is used as a weight of the predicted class scores to adjust the likelihoods of instances. Moreover, two measurements are defined to assess the performance of the classifiers trained by the subjective labelled data. The binary classifiers of Traditional Chinese Medicine (TCM) Zhengs are trained and retrained by the real-world data set, utilizing the support vector machine (SVM) and the discrimination analysis (DA) models, so as to verify the effectiveness of the proposed method. The experimental results show that the consistency of likelihoods of instances with the corresponding observations is increased notable for the classes, especially in the cases with the relatively low QoSTD training data set. The experimental results also indicate the solution how to eliminate the miss-labelled instances from the training data set to re-train the classifiers in the subjective domains.展开更多
In this paper a novel coupled attribute similarity learning method is proposed with the basis on the multi-label categorical data（CASonMLCD）.The CASonMLCD method not only computes the correlations between different ...In this paper a novel coupled attribute similarity learning method is proposed with the basis on the multi-label categorical data（CASonMLCD）.The CASonMLCD method not only computes the correlations between different attributes and multi-label sets using information gain,which can be regarded as the important degree of each attribute in the attribute learning method,but also further analyzes the intra-coupled and inter-coupled interactions between an attribute value pair for different attributes and multiple labels.The paper compared the CASonMLCD method with the OF distance and Jaccard similarity,which is based on the MLKNN algorithm according to 5common evaluation criteria.The experiment results demonstrated that the CASonMLCD method can mine the similarity relationship more accurately and comprehensively,it can obtain better performance than compared methods.展开更多
个性化联邦学习因其在应对数据异质性和隐私保护方面的优势而备受关注。现有算法专注于平衡全局信息和个性化信息之间的矛盾,忽视了全局信息中的不同标签信息带来的干扰,尤其在维护单一全局头部的算法中,容易出现标签间特征冲突导致的...个性化联邦学习因其在应对数据异质性和隐私保护方面的优势而备受关注。现有算法专注于平衡全局信息和个性化信息之间的矛盾,忽视了全局信息中的不同标签信息带来的干扰,尤其在维护单一全局头部的算法中,容易出现标签间特征冲突导致的收敛困难。为此,提出一种新的算法——全局多头部联邦学习(federated learning with global multi-head,FedGMH)算法,该算法在服务器创建多个全局头部,每个头部专门处理一种标签信息,而客户端下载与本地标签相关的全局头部,从而避免无关标签信息的干扰。此外,FedGMH引入参数级聚合机制:评估头部参数重要性,并将关键参数更新为全局多头部的加权参数,以加快收敛速度并且提高准确率。在3个视觉数据集上的大量实验表明,FedGMH优于现有的先进算法。展开更多
The extraction of entity relationship triples is very important to build a knowledge graph(KG),meanwhile,various entity relationship extraction algorithms are mostly based on data-driven,especially for the current pop...The extraction of entity relationship triples is very important to build a knowledge graph(KG),meanwhile,various entity relationship extraction algorithms are mostly based on data-driven,especially for the current popular deep learning algorithms.Therefore,obtaining a large number of accurate triples is the key to build a good KG as well as train a good entity relationship extraction algorithm.Because of business requirements,this KG’s application field is determined and the experts’opinions also must be satisfied.Considering these factors we adopt the top-down method which refers to determining the data schema firstly,then filling the specific data according to the schema.The design of data schema is the top-level design of KG,and determining the data schema according to the characteristics of KG is equivalent to determining the scope of data’s collection and the mode of data’s organization.This method is generally suitable for the construction of domain KG.This article proposes a fast and efficient method to extract the topdown type KG’s triples in social media with the help of structured data in the information box on the right side of the related encyclopedia webpage.At the same time,based on the obtained triples,a data labeling method is proposed to obtain sufficiently high-quality training data,using in various Natural Language Processing(NLP)information extraction algorithms’training.展开更多
Virtual data center is a new form of cloud computing concept applied to data center. As one of the most important challenges, virtual data center embedding problem has attracted much attention from researchers. In dat...Virtual data center is a new form of cloud computing concept applied to data center. As one of the most important challenges, virtual data center embedding problem has attracted much attention from researchers. In data centers, energy issue is very important for the reality that data center energy consumption has increased by dozens of times in the last decade. In this paper, we are concerned about the cost-aware multi-domain virtual data center embedding problem. In order to solve this problem, this paper first addresses the energy consumption model. The model includes the energy consumption model of the virtual machine node and the virtual switch node, to quantify the energy consumption in the virtual data center embedding process. Based on the energy consumption model above, this paper presents a heuristic algorithm for cost-aware multi-domain virtual data center embedding. The algorithm consists of two steps: inter-domain embedding and intra-domain embedding. Inter-domain virtual data center embedding refers to dividing virtual data center requests into several slices to select the appropriate single data center. Intra-domain virtual data center refers to embedding virtual data center requests in each data center. We first propose an inter-domain virtual data center embedding algorithm based on label propagation to select the appropriate single data center. We then propose a cost-aware virtual data center embedding algorithm to perform the intra-domain data center embedding. Extensive simulation results show that our proposed algorithm in this paper can effectively reduce the energy consumption while ensuring the success ratio of embedding.展开更多
文摘In order to improve the performance of classifiers in subjective domains, this paper defines a metric to measure the quality of the subjectively labelled training data (QoSTD) by means of K-means clustering. Then, the QoSTD is used as a weight of the predicted class scores to adjust the likelihoods of instances. Moreover, two measurements are defined to assess the performance of the classifiers trained by the subjective labelled data. The binary classifiers of Traditional Chinese Medicine (TCM) Zhengs are trained and retrained by the real-world data set, utilizing the support vector machine (SVM) and the discrimination analysis (DA) models, so as to verify the effectiveness of the proposed method. The experimental results show that the consistency of likelihoods of instances with the corresponding observations is increased notable for the classes, especially in the cases with the relatively low QoSTD training data set. The experimental results also indicate the solution how to eliminate the miss-labelled instances from the training data set to re-train the classifiers in the subjective domains.
基金Supported by Australian Research Council Discovery(DP130102691)the National Science Foundation of China(61302157)+1 种基金China National 863 Project(2012AA12A308)China Pre-research Project of Nuclear Industry(FZ1402-08)
文摘In this paper a novel coupled attribute similarity learning method is proposed with the basis on the multi-label categorical data（CASonMLCD）.The CASonMLCD method not only computes the correlations between different attributes and multi-label sets using information gain,which can be regarded as the important degree of each attribute in the attribute learning method,but also further analyzes the intra-coupled and inter-coupled interactions between an attribute value pair for different attributes and multiple labels.The paper compared the CASonMLCD method with the OF distance and Jaccard similarity,which is based on the MLKNN algorithm according to 5common evaluation criteria.The experiment results demonstrated that the CASonMLCD method can mine the similarity relationship more accurately and comprehensively,it can obtain better performance than compared methods.
文摘个性化联邦学习因其在应对数据异质性和隐私保护方面的优势而备受关注。现有算法专注于平衡全局信息和个性化信息之间的矛盾,忽视了全局信息中的不同标签信息带来的干扰,尤其在维护单一全局头部的算法中,容易出现标签间特征冲突导致的收敛困难。为此,提出一种新的算法——全局多头部联邦学习(federated learning with global multi-head,FedGMH)算法,该算法在服务器创建多个全局头部,每个头部专门处理一种标签信息,而客户端下载与本地标签相关的全局头部,从而避免无关标签信息的干扰。此外,FedGMH引入参数级聚合机制:评估头部参数重要性,并将关键参数更新为全局多头部的加权参数,以加快收敛速度并且提高准确率。在3个视觉数据集上的大量实验表明,FedGMH优于现有的先进算法。
文摘The extraction of entity relationship triples is very important to build a knowledge graph(KG),meanwhile,various entity relationship extraction algorithms are mostly based on data-driven,especially for the current popular deep learning algorithms.Therefore,obtaining a large number of accurate triples is the key to build a good KG as well as train a good entity relationship extraction algorithm.Because of business requirements,this KG’s application field is determined and the experts’opinions also must be satisfied.Considering these factors we adopt the top-down method which refers to determining the data schema firstly,then filling the specific data according to the schema.The design of data schema is the top-level design of KG,and determining the data schema according to the characteristics of KG is equivalent to determining the scope of data’s collection and the mode of data’s organization.This method is generally suitable for the construction of domain KG.This article proposes a fast and efficient method to extract the topdown type KG’s triples in social media with the help of structured data in the information box on the right side of the related encyclopedia webpage.At the same time,based on the obtained triples,a data labeling method is proposed to obtain sufficiently high-quality training data,using in various Natural Language Processing(NLP)information extraction algorithms’training.
基金supported in part by the following funding agencies of China:National Natural Science Foundation under Grant 61602050 and U1534201National Key Research and Development Program of China under Grant 2016QY01W0200
文摘Virtual data center is a new form of cloud computing concept applied to data center. As one of the most important challenges, virtual data center embedding problem has attracted much attention from researchers. In data centers, energy issue is very important for the reality that data center energy consumption has increased by dozens of times in the last decade. In this paper, we are concerned about the cost-aware multi-domain virtual data center embedding problem. In order to solve this problem, this paper first addresses the energy consumption model. The model includes the energy consumption model of the virtual machine node and the virtual switch node, to quantify the energy consumption in the virtual data center embedding process. Based on the energy consumption model above, this paper presents a heuristic algorithm for cost-aware multi-domain virtual data center embedding. The algorithm consists of two steps: inter-domain embedding and intra-domain embedding. Inter-domain virtual data center embedding refers to dividing virtual data center requests into several slices to select the appropriate single data center. Intra-domain virtual data center refers to embedding virtual data center requests in each data center. We first propose an inter-domain virtual data center embedding algorithm based on label propagation to select the appropriate single data center. We then propose a cost-aware virtual data center embedding algorithm to perform the intra-domain data center embedding. Extensive simulation results show that our proposed algorithm in this paper can effectively reduce the energy consumption while ensuring the success ratio of embedding.
