Vector Quantization (VQ) is a useful tool for data compression and can be applied to compress the data vectors in the database. The quality of the recovered data vector depends on a good codebook. Mean/residual vector...
详细信息
Vector Quantization (VQ) is a useful tool for data compression and can be applied to compress the data vectors in the database. The quality of the recovered data vector depends on a good codebook. Mean/residual vector quantization (M/RVQ) has been shown to be efficient in the encoding time and it only needs a little storage. In this paper, Clonal Selection Algorithm for Image Compression (CSAIC) is proposed. In CSAIC, Based on M/RVQ algorithm, an improved clonal selection algorithm is used to cluster the data of compressed images in order to obtain the optimal codebook. The proposed method has been extensively compared with Linde-Buzo-Gray(LBG), Self-Organizing Mapping (SOM) and Modified K-means(Mod-KM) over a test suit of seven natural images. The experimental results show that CSAIC outperforms other three algorithms in terms of image compression performance.
As the Cloud computing appears to be part of the mainstream computing in a few years, the number of the services it provides, its users, and the requests of these services will be on the rise accordingly. To deliver s...
详细信息
Network Boosting (NB) is an ensemble learning method which combines weak learners together based on a network and can learn the target hypothesis asymptotically. NB has higher generalization ability compared to Baggin...
详细信息
Network Boosting (NB) is an ensemble learning method which combines weak learners together based on a network and can learn the target hypothesis asymptotically. NB has higher generalization ability compared to Bagging and AdaBoost. But, when datasets are class-imbalanced, the performance of NB will decrease quickly. In order to solve this problem, we present a Partition based Network Boosting method (PNB) to classify imbalanced data. For PNB method, every classifier node of the classifier network is provided with the same number of training data which are all of same weights. The classifier in the network is built by the balanced training set sampled from the training data according to the weights record of the training data it holds. And then, the weights of the instances of every node classifier are updated based on the classification results of self-node and its neighbor nodes. The classifier network is trained repeatedly in such a way. Weight factor of hypothesis in the training progress is introduced to improve the performance. The final classification is formed by all the hypotheses of the classifier network learned during the training progress so that the label of new instances can be decided by the weight voting. The experimental results on UCI data and imbalanced biomedical data show that the PNB algorithm has better AUC and recall performance compared with NB learning machine.
Learning to rank is designed to determine a ranking for the target objects according to some rule. Specifically, the problem about learning to rank is to learn a ranking function from a training set whose data has bee...
详细信息
ISBN:
(纸本)9787894631046
Learning to rank is designed to determine a ranking for the target objects according to some rule. Specifically, the problem about learning to rank is to learn a ranking function from a training set whose data has been ranked. It is most applied to the social sciences and information retrieval. Learning to rank is a hot issue in the field of information retrieval and machine learning at present. This paper analyses the process of Ranking Support Vector machine (RSVM) from a theoretical point of view from the classification and regression respectively, and sets up the two basic mathematical models about RSVM. The general introduction about RSVM in the application, training speed and generalization ability is also given. In the end, we come to a conclusion.
In the process of power load forecasting, electricity experts always divide the forecasting situation into several categories, and the same category uses the same forecasting model. There exists such a situation that ...
详细信息
The rapid growth in the development of Internet-based information systems increases the demand for natural language interfaces that are easy to set up and maintain. Unfortunately, the problem of deep understanding nat...
详细信息
Video event detection is an important research area *** the video event is a key problem in video event *** this paper,we combine dynamic description logic with linear time temporal logic to build a logic system for v...
详细信息
Video event detection is an important research area *** the video event is a key problem in video event *** this paper,we combine dynamic description logic with linear time temporal logic to build a logic system for video event *** proposed logic system is named as LTD_(ALCO)which can represent and inference the static,dynamic and temporal knowledge in one uniform logic *** on the LTD_(ALCO),a framework for video event detection is *** video event detection framework can automatically obtain the logic description of video content with the help of ontology-based computer vision techniques and detect the specified video event based on satisfiability checking on LTD_(ALCO)formulas.
The dynamic description logic DDL provides a kind of action theories based on description logics (DLs). Compared with another important DL-based action formalism constructed by Baader ***., a shortcoming of DDL is the...
详细信息
Based on the concepts and principles of quantum computing, a novel clustering algorithm, called a quantum-inspired immune clonal clustering algorithm based on watershed (QICW), is proposed to deal with the problem of ...
详细信息
Based on the concepts and principles of quantum computing, a novel clustering algorithm, called a quantum-inspired immune clonal clustering algorithm based on watershed (QICW), is proposed to deal with the problem of image segmentation. In QICW, antibody is proliferated and divided into a set of subpopulation groups. Antibodies in a subpopulation group are represented by multi-state gene quantum bits. In the antibody's updating, the quantum mutation operator is applied to accelerate convergence. The quantum recombination realizes the information communication between the subpopulation groups so as to avoid premature convergences. In this paper, the segmentation problem is viewed as a combinatorial optimization problem, the original image is partitioned into small blocks by watershed algorithm, and the quantum-inspired immune clonal algorithm is used to search the optimal clustering centre, and make the sequence of maximum affinity function as clustering result, and finally obtain the segmentation result. Experimental results show that the proposed method is effective for texture image and SAR image segmentation, compared with the genetic clustering algorithm based on watershed (W-GAC), and the k-means algorithm based on watershed (W-KM).
Data indexing is common in data mining when working with high-dimensional, large-scale data sets. Hadoop, a cloud computing project using the MapReduce framework in Java, has become of significant interest in distribu...
详细信息
暂无评论