The microwave plasma chemical vapor deposition (MPCVD) method is capable of synthesizing various forms of carbon allotropes such as diamond, carbon nanotubes (CNTs), and diamondlike carbon (DLC) while varying the grow...
详细信息
The WATERS Network (WATer and Environmental Research Systems Network) will be an integrated real-time distributed observing system which will enable academic and government scientists, engineers, educators, and practi...
详细信息
OBF (Orthonormal Basis Function) Fuzzy models have shown to be a promising approach to the areas of nonlinear system identification and control since they exhibit several advantages over those dynamic model topologies...
详细信息
We present an evolutionary algorithm for the inference of context-free grammars from positive and negative examples. The algorithm is based on genetic programming and uses a local optimization operator that is capable...
详细信息
This paper presents a Distributed Data Mining technique based on a multiagent environment, called SMAMDD (MultiAgent System for Distributed Data Mining), which uses model integration. Model Integration consists in the...
详细信息
We present a new method for learning to parse a bilingual sentence using Inversion Transduction Grammar trained on a parallel corpus and a monolingual treebank. The method produces a parse tree for a bilingual sentenc...
详细信息
We present a new method for learning to parse a bilingual sentence using Inversion Transduction Grammar trained on a parallel corpus and a monolingual treebank. The method produces a parse tree for a bilingual sentence, showing the shared syntactic structures of individual sentence and the differences of word order within a syntactic structure. The method involves estimating lexical translation probability based on a word-aligning strategy and inferring probabilities for CFG rules. At runtime, a bottom-up CYK-styled parser is employed to construct the most probable bilingual parse tree for any given sentence pair. We also describe an implementation of the proposed method. The experimental results indicate the proposed model produces word alignments better than those produced by Giza++, a state-of-the-art word alignment system, in terms of alignment error rate and F-measure. The bilingual parse trees produced for the parallel corpus can be exploited to extract bilingual phrases and train a decoder for statistical machine translation.
Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are purely top-down or bottom-up. Here, we pr...
详细信息
Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are purely top-down or bottom-up. Here, we propose a new model that combines both. The bottom-up component computes the visual salience of scene locations in different feature maps extracted at multiple spatial scales. The topdown component uses accumulated statistical knowledge of the visual features of the desired search target and background clutter, to optimally tune the bottom-up maps such that target detection speed is maximized. Testing on 750 artificial and natural scenes shows that the model’s predictions are consistent with a large body of available literature on human psychophysics of visual search. These results suggest that our model may provide good approximation of how humans combine bottom-up and top-down cues such as to optimize target detection speed.
Established statistical representations of data clusters employ up to second order statistics including mean, variance, and covariance. Strategies for merging clusters have been largely based on intra-and inter-cluste...
详细信息
Established statistical representations of data clusters employ up to second order statistics including mean, variance, and covariance. Strategies for merging clusters have been largely based on intra-and inter-cluster distance measures. The distance concept allows an intuitive interpretation, but it is not designed to merge from the viewpoint of probability distributions. We suggest an alternative strategy to compare clusters based on higher order statistics to capture the underlying probability distributions. Higher order statistics, such as multivariate skewness and kurtosis, enable a more accurate description of the shape of a cluster. Although the original definitions of kurtosis and skewness do require simultaneous involvement of all data points, our finding shows that their estimation can be decomposed into combinations of the cross moments of subsets of data. This decomposable property makes it possible to apply skewness and kurtosis to data stream clustering, where historical data are not accessible. We utilize tests for normality based on skewness and kurtosis to discover cluster pairs that can be merged to produce a less complex normal cluster even if they have different means or covariance structures.
This paper presents a distributed data mining technique based on a multiagent environment, called SMAMDD (multiagent system for distributed data mining), which uses model integration. Model integration consists in the...
详细信息
This paper presents a distributed data mining technique based on a multiagent environment, called SMAMDD (multiagent system for distributed data mining), which uses model integration. Model integration consists in the amalgamation of local models into a global, consistent one. In each subset, agents perform mining tasks locally and, afterwards, results are merged into a global model. In order to achieve that, agents cooperate by exchanging messages, aiming to improve the process of knowledge discover generating accurate results. The multiagent system for distributed data mining proposed in this paper has been compared with classical machine learning algorithms which are based on model integration as well, simulating a distributed environment. The results obtained show that SMAMDD can produce highly accurate data models
We present an evolutionary algorithm for the inference of context-free grammars from positive and negative examples. The algorithm is based on genetic programming and uses a local optimization operator that is capable...
详细信息
We present an evolutionary algorithm for the inference of context-free grammars from positive and negative examples. The algorithm is based on genetic programming and uses a local optimization operator that is capable of improving the learning task. Ordinary genetic operators are modified so as to bias the search. The system was evaluated using Tomitas language examples and results were compared with another similar approach. Results show that the proposed approach is promising and more robust than the other one.
暂无评论