Many processes experience abrupt changes in their dynamics. this causes problems for some prediction algorithms which assume that the dynamics of the sequence to be predicted are constant, or at least only change slow...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
Many processes experience abrupt changes in their dynamics. this causes problems for some prediction algorithms which assume that the dynamics of the sequence to be predicted are constant, or at least only change slowly over time. In this paper the problem of predicting sequences with sudden changes in dynamics is considered. For a model of multivariate Gaussian data we derive expected generalization error of standard linear Fisher classifier in situation where after unexpected task change, the classification algorithm learns on a mixture of old and new data. We show both analytically and by an experiment that optimal length of learning sequence depends on complexity of the task, input dimensionality, on the power and periodicity of. the changes. the proposed solution is to consider a collection of agents, in this case non-linear single layer perceptrons (agents), trained by a memetic like learning algorithm. T e most successful agents are voting for predictions. A grouped structure of the agent population assists in obtaining favorable diversity in the agent population. Efficiency of socially organized evolving multi-agent system is demonstrated on an artificial problem.
this paper presents an error protection method for embedded wavelet codec by combining data hiding with error concealment. For the lowest frequency coefficients, a prolection scheine based data hiding is peifol-ined. ...
详细信息
ISBN:
(纸本)9781424410651
this paper presents an error protection method for embedded wavelet codec by combining data hiding with error concealment. For the lowest frequency coefficients, a prolection scheine based data hiding is peifol-ined. the lowest frequency coefficients, which are taken as the hidden data, are extracted from the compressed bilstream, and embedded back into the same bitstream. the restored hidden data is used to conceal errors. the coefficients that cannot be recovered in other high frequency coefficients reconstruction are predicted through linear interpolation based oil inter-subband correlation. Experimental results show that the proposed method achieves good and stable error performance with minimal additional redundancy.
there are some general procedures to generate the clusterings in clustering ensembles. One can apply different algorithms to create different clusterings of the data. Some clustering algorithms like k-means require in...
详细信息
ISBN:
(纸本)9781424410651
there are some general procedures to generate the clusterings in clustering ensembles. One can apply different algorithms to create different clusterings of the data. Some clustering algorithms like k-means require initialization Of parameters. Different initializations can lead to different clustering results. the parameters of a clustering algorithm, such as the number of clusters, can be altered to create different data clusterings. Different versions of the data can also be used as the input to the clustering algorithm, leading to different partitions. In this paper, we propose a new scheme for constructing multiple independent clusterings using additional artificially generated data. then, we compare our new method with seven general clustering ensemble constructing methods. the experiments show that our approach can achieve higher or comparable performance than the other methods.
We propose a novel approach which extracts consistent (100% confident) rules and builds a classifier withthem. Recently, associative classifiers which utilize association rules have been widely studied. Indeed, the a...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
We propose a novel approach which extracts consistent (100% confident) rules and builds a classifier withthem. Recently, associative classifiers which utilize association rules have been widely studied. Indeed, the associative classifiers often outperform the traditional classifiers. In this case, it is important to collect high quality (association) rules. Many algorithms find only high support rules, because decreasing the minimum support to be satisfied is computationally demanding. However, it may be effective to collect low support but high confidence rules. therefore, we propose an algorithm that produces a wide variety of 100% confident rules including low support rules. To achieve this goal, we adopt a specific-to-general rule searching strategy, in contrast to the previous many approaches. Our experimental results show that the proposed method achieves higher accuracies in several datasets taken from UCI machinelearning repository.
this paper presents a data preprocessing procedure to select support vector (SV) candidates. We select decision boundary region vectors (BRVs) as SV candidates. Without the need to use the decision boundary, BRVs can ...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
this paper presents a data preprocessing procedure to select support vector (SV) candidates. We select decision boundary region vectors (BRVs) as SV candidates. Without the need to use the decision boundary, BRVs can be selected based on a vector's nearest neighbor of opposite class (NNO). To speed up the process, two spatial approximation sample hierarchical (SASH) trees are used for estimating the BRVs. Empirical results show that our data selection procedure can reduce a full dataset to the number of SVs or only slightly higher. Training withthe selected subset gives performance comparable to that of the full dataset. For large datasets, overall time spent in selecting and training on the smaller dataset is significantly lower than the time used in training on the full dataset.
In this paper, a reinforcement learning method called DAQL is proposed to solve the problem of seeking and homing onto a fast maneuvering target, within the context of mobile robots. this Q-learning based method consi...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
In this paper, a reinforcement learning method called DAQL is proposed to solve the problem of seeking and homing onto a fast maneuvering target, within the context of mobile robots. this Q-learning based method considers both target and obstacle actions when determining its own action decisions, which enables the agent to learn more effectively in a dynamically changing environment. It particularly suits fast-maneuvering target cases, in which maneuvers of the target are unknown a priori. Simulation result depicts that the proposed method is able to choose a less convoluted path to reach the target when compared to the ideal proportional navigation (IPN) method in handling fast maneuvering and randomly moving target. Furthermore, it can learn to adapt to the physical limitation of the system and do not require specific initial conditions to be satisfied for successful navigation towards the moving target.
A kind of trading off algorithm off target classification combined with double mode intelligent fusion is presented, Applying neuron-fuzzy technique to the synthesis of the complementary information between radar and ...
详细信息
ISBN:
(纸本)9781424410651
A kind of trading off algorithm off target classification combined with double mode intelligent fusion is presented, Applying neuron-fuzzy technique to the synthesis of the complementary information between radar and infrared, through combining neuron-fuzzy, technique with D-S evidence fusion theory, the ability, of target classification could be improved At the same time, according to the effective defection range of sensors, reasonably select the target features that can ensure the accurate target classification so that the computation load of the algorithm can be largely decreased compared to the infrared single model fusion. Simulalion results illustrate that the trading off algorithm is effective.
this paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed with positive and negative documents. ...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
this paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed with positive and negative documents. this problem is also called PU-learning. the key feature of PU-learning is that there is no negative document for training. Recently, several approaches have been proposed for solving this problem. Most of them are based on the same idea, which builds a classifier in two steps. Each existing technique uses a different method for each step. Generally speaking, these existing approaches do not perform well when the size of P is small. In this paper, we propose a new approach aiming at improving the system when the size of P is small. this approach combines the graph-based semi-supervised learning method withthe two-step method. Experiments indicate that our proposed method performs well especially when the size of P is small.
In this paper we consider multiclass learning tasks based on Support Vector machines (SVMs). In this regard, currently used methods are One-Against-All or One-Against-One, but there is much need for improvements in th...
详细信息
ISBN:
(数字)9783540734994
ISBN:
(纸本)9783540734987
In this paper we consider multiclass learning tasks based on Support Vector machines (SVMs). In this regard, currently used methods are One-Against-All or One-Against-One, but there is much need for improvements in the field of multiclass learning. We developed a novel combination algorithm called Comb-ECOC, which is based on posterior class probabilities. It assigns, according to the Bayesian rule, the respective instance to the class withthe highest posterior probability. A problem withthe usage of a multiclass method is the proper choice of parameters. Many users only take the default parameters of the respective learning algorithms (e.g. the regularization parameter C and the kernel parameter gamma). We tested different parameter optimization methods on different learning algorithms and confirmed the better performance of One-Against-One versus One-Against-All, which can be explained by the maximum margin approach of SVMs.
Most of the existing studies on myocardial infraction (MI) feature extraction are based on certain important components. the subjective significance based method was introduced into the feature extraction from an enti...
详细信息
ISBN:
(纸本)9781424410651
Most of the existing studies on myocardial infraction (MI) feature extraction are based on certain important components. the subjective significance based method was introduced into the feature extraction from an entire ECG segment for the classification in the paper. the method was employed to discriminate the assumed prior class from the other classes and separate each of the classes at the same time. the data in the analysis including healthy control (HC), myocardial infraction in early stage and acute myocardial infraction (AMI) was collected from PTB diagnostic ECG database which is the latest public database for various research purposes. the results show that the proposed method can obtain the effective features from the ECGs with 12-leads for the classification purpose.
暂无评论