Search results for "Intelligence"
showing 10 items of 6959 documents
Approximated overlap error for the evaluation of feature descriptors on 3D scenes
2013
This paper presents a new framework to evaluate feature descriptors on 3D datasets. The proposed method employs the approximated overlap error in order to conform with the reference planar evaluation case of the Oxford dataset based on the overlap error. The method takes into account not only the keypoint centre but also the feature shape and it does not require complex data setups, depth maps or an accurate camera calibration. Only a ground-truth fundamental matrix should be computed, so that the dataset can be freely extended by adding further images. The proposed approach is robust to false positives occurring in the evaluation process, which do not introduce any relevant changes in the …
On the Online Classification of Data Streams Using Weak Estimators
2016
In this paper, we propose a novel online classifier for complex data streams which are generated from non-stationary stochastic properties. Instead of using a single training model and counters to keep important data statistics, the introduced online classifier scheme provides a real-time self-adjusting learning model. The learning model utilizes the multiplication-based update algorithm of the Stochastic Learning Weak Estimator (SLWE) at each time instant as a new labeled instance arrives. In this way, the data statistics are updated every time a new element is inserted, without requiring that we have to rebuild its model when changes occur in the data distributions. Finally, and most impo…
On the inductive inference of recursive real-valued functions
1999
AbstractWe combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions.
Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems
1997
In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.
Day-ahead forecasting for photovoltaic power using artificial neural networks ensembles
2016
Solar photovoltaic plants power output forecasting using machine learning techniques can be of a great advantage to energy producers when they are implemented with day-ahead energy market data. In this work a model was developed using a supervised learning algorithm of multilayer perceptron feedforward artificial neural network to predict the next twenty-four hours (day-ahead) power of a solar facility using fetched weather forecast of the following day. Each set of tested network configuration was trained by the historical power output of the plant as a target. For each configuration, one hundred networks ensembles was averaged to give the ability to generalize a better forecast. The train…
Comment on: A critical analysis of the internal logic in the Life-Space Assessment (LSA) composite score and suggested solutions
2016
Background:An individual’s ability to live independently is commonly measured in health research interested in identifying risk factors associated with disablement processes. In order to inform clinical practice, population research has attempted to identify the contraction of “lived-space” by using various survey instruments.Problem:Studies assessing habitual movements over the environment with the Life-Space Assessment (LSA) survey instrument should carefully consider how the LSA Composite Score (LSA-CS) is computed. Until now, no publication has carefully delineated the assumptions guiding the internal logic used in the computation of the LSA-CS.Core argument:Because the internal logic o…
Search and Comprehension Processes in Learning from Text
2008
We analyzed the relationships between comprehension skill and search strategies in instructional text. In two experiments, college-level readers were asked to search a computer-presented science text in order to answer different types of questions. High level questions required the integration of information across paragraphs, whereas low level questions requested the localization of information within a single paragraph. High level questions were re-read more often and they resulted in broader text search patterns. Furthermore, students who were diagnosed as good comprehenders located relevant sections of the text faster and spent more time on those sections. Poor comprehenders, on the oth…
Manipulatable Models for Investigating Processing of Dynamic Diagrams
2010
Existing approaches for collecting process data on human diagram comprehension have limited effectiveness. Analogue models that allow participants to manipulate diagram components offer powerful ways to capture the non-verbal and dynamic aspects of processing that are not available with some other approaches. Examples drawn from a variety of different domains illustrate the utility of model manipulation for revealing otherwise inaccessible aspects of how people process animated diagrams of complex content.
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Local operators to detect regions of interest
1997
The performance of a visual system is strongly influenced by the information processing that is done in the early vision phase. The need exists to limit the computation on areas of interest to reduce the total amount of data and their redundancy. This paper describes a new method to drive the attention during the analysis of complex scenes. Two new local operators, based on the computation of local moments and symmetries, are combined to drive the selection. Experimental results on real data are also reported. © 1997 Elsevier Science B.V.