A new nonparallel twin support vector machine is presented in this article which combine l 2,1 -norm minimizing on both loss function and regularization which called (TWSVM_21). Our TWSVM_21 is formulated aiming to s...
详细信息
ISBN:
(纸本)9781509037117
A new nonparallel twin support vector machine is presented in this article which combine l 2,1 -norm minimizing on both loss function and regularization which called (TWSVM_21). Our TWSVM_21 is formulated aiming to separate class more efficiently. Different from other nonparallel classifier, such as the presented TBSVM, the classifier we proposed in this paper joint l 2,1 -norm. Experiments on DDSM datasets show the feasibility and effectiveness of our TWSVM_21.
Erasure coding has been increasingly used by distributed storage systems to maintain fault tolerance with low storage redundancy. However, how to enhance the performance of degraded reads in erasure-coded storage has ...
详细信息
ISBN:
(纸本)9781509035144
Erasure coding has been increasingly used by distributed storage systems to maintain fault tolerance with low storage redundancy. However, how to enhance the performance of degraded reads in erasure-coded storage has been a critical issue. We revisit this problem from two different perspectives that are neglected by existing studies: data placement and encoding rules. To this end, we propose an encoding-aware data placement (EDP) approach that aims to reduce the number of I/Os in degraded reads during a single failure for general XOR-based erasure codes. EDP carefully places sequential data based on the encoding rules of the given erasure code. Trace-driven evaluation results show that compared to two baseline data placement methods, EDP reduces up to 37.4% of read data on the most loaded disk and shortens up to 15.4% of read time.
Sentiment analysis is an important task in the field of natural language processing. This paper has focus on opinion target extraction of sentiment extraction in the primary task of sentiment analysis. First, the feat...
详细信息
This paper proposes a relational aggregation algorithm based on Radio Frequency Identification (RFID) to achieve accurate indoor localization. The proposed algorithm is composed of three steps: (1) exploring the relat...
详细信息
This paper proposes a relational aggregation algorithm based on Radio Frequency Identification (RFID) to achieve accurate indoor localization. The proposed algorithm is composed of three steps: (1) exploring the relationship between reader received power and distance information then estimating Euclid distance of signal strength; (2) employing k-Nearest Neighbour algorithm to aggregate the relationship between nearest reference tag and target tag; (3) optimizing relational aggregation operator to obtain the coordinate of target tag. Simulated experiments show that the proposed algorithm can reduce mean localization error effectively and improve the accuracy of indoor localization.
In evolutionary algorithms, it is difficult to balance the exploration and exploitation. Usually, global search is utilized to find promising solutions, and local search is beneficial to the convergence of the solutio...
详细信息
ISBN:
(纸本)9781509042418
In evolutionary algorithms, it is difficult to balance the exploration and exploitation. Usually, global search is utilized to find promising solutions, and local search is beneficial to the convergence of the solutions in the population. Combing different search strategies is a promising way to take advantages of different methods. Following the idea of DE/EDA, this paper proposes another way to combine estimation of distribution algorithm and differential evolution for global optimization. The basic idea is to choose either differential evolution or estimation of distribution algorithm for generating new trial solutions. To improve the algorithm performance, a local search strategy is used as well. The new approach, named as EDA/DE-EIG, is systematically compared with two state-of-art algorithms, and the experimental results show the advantages of our method.
As indispensable solutions in classification problems, discrimination for samples has been employed in medicine, and it is performed subjectively by physicians at present, which hinders the diagnosis and treatment in ...
详细信息
Aiming at the shortcomings of clustering performance of many traditional text clustering methods, a clustering algorithm based on maximum entropy principle is proposed. The algorithm uses the cosine similarity measure...
Aiming at the shortcomings of clustering performance of many traditional text clustering methods, a clustering algorithm based on maximum entropy principle is proposed. The algorithm uses the cosine similarity measure cited in the traditional text clustering algorithm SP-Kmeans, and then introduces the maximal entropy theory to construct the maximal entropy objective function suitable for text clustering. The maximum entropy principle is introduced into the spherical K-mean text clustering Algorithm. The experimental results show that compared with DA-VMFS and SP-Kmeans algorithms, in addressing the large number of text clustering problem. The performance of CAMEP clustering algorithm is greatly improved, and has a good overall performance.
Crowd animation is a new and continuous challenge in computer animation. In tradition, crowd animation can be realized by key frame technology, and animators should set every character's expression, action, motion...
详细信息
Crowd animation is a new and continuous challenge in computer animation. In tradition, crowd animation can be realized by key frame technology, and animators should set every character's expression, action, motion, and behavior. Therefore animators' workload by hand will increase tremendously with characters growing, which lead to difficult to realize crowd animation for low efficiency and poor global controllability, especially in path planning by appointing a target position for each individuals. In order to overcome these, an improved artificial bee colony (IM-ABC) algorithm is proposed to apply on the path planning of crowd animation. The IM-ABC is fit to simulate the crowd motion in animation based on the following two merits over the others in crowd animation. One is the rule of role transformation, which can make the rapid convergence of the result and avoid getting trapped in the local optima. The other is the realization of multi-object optimization in the process of iteration, which reaches the uniformly distributed result of swarm motion and especially fits to realize the path plan. In this paper, we simply reviews classical ABC algorithm proposed by Karaboga at the beginning. Then, in order to speed the convergence and make individuals generate paths more realistic and natural, some measures are taken to modify the classical ABC (called IM-ABC) algorithm, which include initializing colony based on chaos sequence, self-adaptively selecting the follower bees, and adaptively controlling parameters, etc. After the experiments of benchmark functions, the results confirm that the IM-ABC have better performance than the classical ABC algorithm and others. Finally, the IM-ABC algorithm is used for path planning to generate the route from the initial to the destination without collision. Through simulation experiments based on four motion models it is showed that this method can succeed generating the optimum paths with efficiency, intelligence, and natural featu
暂无评论