Data of towed streamer acquiring suffer from influences of ocean currents and other environment factors. Variations in lateral and time positions of receivers will produce acquisition errors and reduce resolution of s...
详细信息
Data of towed streamer acquiring suffer from influences of ocean currents and other environment factors. Variations in lateral and time positions of receivers will produce acquisition errors and reduce resolution of stack sections. In this paper, we proposed a method to correct those variations in sub-pixel domain by interpolation and correlate calculation. We applied the method on an actual dataset acquired at an offshore field in China. Results demonstrate the method could correct variations effectively and enhance the consistence and the resolution of the acquired dataset.
A new bridge recognition method in Synthetic Aperture Radar (SAR) image using bridge model and SVM is presented in this paper. Firstly, water region is extracted from original SAR image by self-adapt segmentation and ...
详细信息
Chinese word segmentation (CWS) is the fundamental technology for many NLPrelated applications. It is reported that more than 60% of segmentation errors is caused by the out-of-vocabulary (OOV) words. Recent studies i...
详细信息
How many pages on the Web will be accessed by Web users? This is an interesting question for both Web scientists and industry engineers. To answer this question, User Access Web (UA Web) is described and studied in th...
详细信息
How many pages on the Web will be accessed by Web users? This is an interesting question for both Web scientists and industry engineers. To answer this question, User Access Web (UA Web) is described and studied in this paper. With analysis on large scale Web users’ access logs, a sampling procedure is proposed to reduce the bias, and the near-uniform random pages are sampled from the UA Web applying search engine interface and Monte Carlo methods. Experimental results on about 675 million user log entries reveal some properties of the UA Web and the indices of four search engines, e.g. power law distribution, average length of pages, index size of search engines, properties of static and dynamic pages, etc.
Error criteria (or error cost functions) play significant roles in statistical estimation problems. In this paper, we study error criteria from the viewpoint of information theory. The relationships between error crit...
详细信息
Error criteria (or error cost functions) play significant roles in statistical estimation problems. In this paper, we study error criteria from the viewpoint of information theory. The relationships between error criteria and error's entropy criterion are investigated. It is shown that an error criterion is equivalent to the error's entropy criterion plus a Kullback-Leibler information divergence (KL-divergence). Based on this result, two important properties of the error criteria are proved. Particularly, the optimum error criterion can be interpreted via the meanings of entropy and KL-divergence. Furthermore, a novel approach is proposed for the choice of p-power error criteria, in which a KL-divergence based cost is minimized. The proposed method is verified by Monte Carlo simulation experiments.
In this paper, a combined method is proposed for providing a new sufficient condition for linear T-S fuzzy systems as an universal approximator in MISO case. Such work extends existing methods in SISO case and is supe...
详细信息
ISBN:
(纸本)9781424437740
In this paper, a combined method is proposed for providing a new sufficient condition for linear T-S fuzzy systems as an universal approximator in MISO case. Such work extends existing methods in SISO case and is superior to the existing results in MISO case by combining the statically and dynamically constructive methods. After comparing with some other typical methods, detailed theoretical reasoning and numerical example both confirm that the method in this paper will reduce the fuzzy rules number dramatically. At last, some conclusions and discussion on further work are also given.
Task scheduling still remains one of the most challenging problems to achieve high performance in heterogeneous computing environments in spite of numerous efforts. This paper presents a novel scheduling algorithm bas...
详细信息
Task scheduling still remains one of the most challenging problems to achieve high performance in heterogeneous computing environments in spite of numerous efforts. This paper presents a novel scheduling algorithm based on learning classifier system for heterogeneous computing environment. In the presented algorithm, XCS classifier system is used to find the optimal task assignment on different processors, and the execution sequence of tasks on the same processor is set by the heuristic used in list scheduling approach. Empirical studies on benchmark task graphs show that the proposed algorithm is able to produce higher speedup compared with the related algorithms. Further experiments also indicate that the proposed algorithm maintains almost the same performance with different parameter settings.
Stock price forecasting has aroused great concern in research of economy, machine learning and other fields. Time series analysis methods are usually utilized to deal with this task. In this paper, we propose to combi...
详细信息
Stock price forecasting has aroused great concern in research of economy, machine learning and other fields. Time series analysis methods are usually utilized to deal with this task. In this paper, we propose to combine news mining and time series analysis to forecast inter-day stock prices. News reports are automatically analyzed with text mining techniques, and then the mining results are used to improve the accuracy of time series analysis algorithms. The experimental result on a half year Chinese stock market data indicates that the proposed algorithm can help to improve the performance of normal time series analysis in stock price forecasting significantly. Moreover, the proposed algorithm also performs well in stock price trend forecasting.
Semi-supervised learning has been paid increasing attention and is widely used in many fields such as data mining, information retrieval and knowledge management as it can utilize both labeled and unlabeled data. Lapl...
详细信息
Semi-supervised learning has been paid increasing attention and is widely used in many fields such as data mining, information retrieval and knowledge management as it can utilize both labeled and unlabeled data. Laplacian SVM (LapSVM) is a very classical method whose effectiveness has been validated by large number of experiments. However, LapSVM is sensitive to labeled data and it exposes to cubic computation complexity which limit its application in large scale scenario. In this paper, we propose a multi-class method called Probabilistic labeled Semi-supervised SVM (PLSVM) in which the optimal decision surface is taught by probabilistic labels of all the training data including the labeled and unlabeled data. Then we propose a kernel version dual coordinate descent method to efficiently solve the dual problems of our Probabilistic labeled Semi-supervised SVM and decrease its requirement of memory. Synthetic data and several benchmark real world datasets show that PLSVM is less sensitive to labeling and has better performance over traditional methods like SVM, LapSVM (LapSVM) and Transductive SVM (TSVM).
Maximum Margin Criterion is a well-known method for feature extraction and dimensionality reduction. In this paper, we propose a novel feature extraction method, namely Two Dimensional Maximum Margin Criterion (2DMMC)...
详细信息
Maximum Margin Criterion is a well-known method for feature extraction and dimensionality reduction. In this paper, we propose a novel feature extraction method, namely Two Dimensional Maximum Margin Criterion (2DMMC), specifically for matrix representation data, e.g. images. 2DMMC aims to find two orthogonal projection matrices to project the original matrices to a low dimensional matrix subspace, in which a sample is close to those in the same class but far from those in different classes. Both theoretical analysis and experiments on benchmark face recognition data sets illustrate that the proposed method is very effective and efficient.
暂无评论