1000 resultados para random projection


Relevância:

20.00% 20.00%

Publicador:

Resumo:

© The Author, 2014. Most studies of the predictability of returns are based on time series data, and whenever panel data are used, the testing is almost always conducted in an unrestricted unit-by-unit fashion, which makes for a very heavy parametrization of the model. On the other hand, the few panel tests that exist are too restrictive in the sense that they are based on homogeneity assumptions that might not be true. As a response to this, the current study proposes new predictability tests in the context of a random coefficient panel data model, in which the null of no predictability corresponds to the joint restriction that the predictive slope has zero mean and variance. The tests are applied to a large panel of stocks listed at the New York Stock Exchange. The results suggest that while the predictive slopes tend to average to zero, in case of book-to-market and cash flow-to-price the variance of the slopes is positive, which we take as evidence of predictability.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A preference relation-based Top-N recommendation approach, PrefMRF, is proposed to capture both the second-order and the higher-order interactions among users and items. Traditionally Top-N recommendation was achieved by predicting the item ratings fi rst, and then inferring the item rankings, based on the assumption of availability of explicit feed-backs such as ratings, and the assumption that optimizing the ratings is equivalent to optimizing the item rankings. Nevertheless, both assumptions are not always true in real world applications. The proposed PrefMRF approach drops these assumptions by explicitly exploiting the preference relations, a more practical user feedback. Comparing to related work, the proposed PrefMRF approach has the unique property of modeling both the second-order and the higher-order interactions among users and items. To the best of our knowledge, this is the first time both types of interactions have been captured in preference relation-based method. Experiment results on public datasets demonstrate that both types of interactions have been properly captured, and signifi cantly improved Top-N recommendation performance has been achieved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Privacy-preserving data mining has become an active focus of the research community in the domains where data are sensitive and personal in nature. For example, highly sensitive digital repositories of medical or financial records offer enormous values for risk prediction and decision making. However, prediction models derived from such repositories should maintain strict privacy of individuals. We propose a novel random forest algorithm under the framework of differential privacy. Unlike previous works that strictly follow differential privacy and keep the complete data distribution approximately invariant to change in one data instance, we only keep the necessary statistics (e.g. variance of the estimate) invariant. This relaxation results in significantly higher utility. To realize our approach, we propose a novel differentially private decision tree induction algorithm and use them to create an ensemble of decision trees. We also propose feasible adversary models to infer about the attribute and class label of unknown data in presence of the knowledge of all other data. Under these adversary models, we derive bounds on the maximum number of trees that are allowed in the ensemble while maintaining privacy. We focus on binary classification problem and demonstrate our approach on four real-world datasets. Compared to the existing privacy preserving approaches we achieve significantly higher utility.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An analytic solution to the multi-target Bayes recursion known as the δ-Generalized Labeled Multi-Bernoulli ( δ-GLMB) filter has been recently proposed by Vo and Vo in [“Labeled Random Finite Sets and Multi-Object Conjugate Priors,” IEEE Trans. Signal Process., vol. 61, no. 13, pp. 3460-3475, 2014]. As a sequel to that paper, the present paper details efficient implementations of the δ-GLMB multi-target tracking filter. Each iteration of this filter involves an update operation and a prediction operation, both of which result in weighted sums of multi-target exponentials with intractably large number of terms. To truncate these sums, the ranked assignment and K-th shortest path algorithms are used in the update and prediction, respectively, to determine the most significant terms without exhaustively computing all of the terms. In addition, using tools derived from the same framework, such as probability hypothesis density filtering, we present inexpensive (relative to the δ-GLMB filter) look-ahead strategies to reduce the number of computations. Characterization of the L1-error in the multi-target density arising from the truncation is presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A person is shown demonstrating projection of an image at the Lithographic Technical Forum. Black and white photograph.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

None

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Durante muitos anos uma controversa questão tem ocupado tanto os discursos acadêmicos quanto os financeiros. O problema a ser resolvido diz respeito à evolução passada dos preços das ações e se tal evolução poderia ser utilizada para prever o comportamento dos preços futuros dessas ações.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Estimation of demand and supply in differentiated products markets is a central issue in Empirical Industrial Organization and has been used to study the effects of taxes, merges, introduction of new goods, market power, among others. Logit and Random Coefficients Logit are examples of demand models used to study these effects. For the supply side it is generally supposed a Nash equilibrium in prices. This work presents a detailed discussion of these models of demand and supply as well as the procedure for estimation. Lastly, is made an application to the Brazilian fixed income fund market.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Transaction costs have a random component in the bid-ask spread. Facing a high bid-ask spread, the consumer has the option to wait for better terms oI' trade, but only by carrying an undesirable portfolio balance. We present the best policy in this case. We pose the control problem and show that the value function is the uni que viscosity solution of the relevant variational inequality. Next, a numerical procedure for the problem is presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Trabalho apresentado no Congresso Nacional de Matemática Aplicada à Indústria, 18 a 21 de novembro de 2014, Caldas Novas - Goiás

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Trabalho apresentado no International Conference on Scientific Computation And Differential Equations 2015

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The power-law size distributions obtained experimentally for neuronal avalanches are an important evidence of criticality in the brain. This evidence is supported by the fact that a critical branching process exhibits the same exponent t~3=2. Models at criticality have been employed to mimic avalanche propagation and explain the statistics observed experimentally. However, a crucial aspect of neuronal recordings has been almost completely neglected in the models: undersampling. While in a typical multielectrode array hundreds of neurons are recorded, in the same area of neuronal tissue tens of thousands of neurons can be found. Here we investigate the consequences of undersampling in models with three different topologies (two-dimensional, small-world and random network) and three different dynamical regimes (subcritical, critical and supercritical). We found that undersampling modifies avalanche size distributions, extinguishing the power laws observed in critical systems. Distributions from subcritical systems are also modified, but the shape of the undersampled distributions is more similar to that of a fully sampled system. Undersampled supercritical systems can recover the general characteristics of the fully sampled version, provided that enough neurons are measured. Undersampling in two-dimensional and small-world networks leads to similar effects, while the random network is insensitive to sampling density due to the lack of a well-defined neighborhood. We conjecture that neuronal avalanches recorded from local field potentials avoid undersampling effects due to the nature of this signal, but the same does not hold for spike avalanches. We conclude that undersampled branching-process-like models in these topologies fail to reproduce the statistics of spike avalanches.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)