content stringlengths 633 9.91k | label stringclasses 7
values | category stringclasses 7
values | dataset stringclasses 1
value | node_id int64 0 2.71k | split stringclasses 3
values |
|---|---|---|---|---|---|
1-hop neighbor's text information: Self-Organization and Associative Memory, : Selective suppression of transmission at feedback synapses during learning is proposed as a mechanism for combining associative feedback with self-organization of feedforward synapses. Experimental data demonstrates cholinergic suppression ... | 1 | Neural Networks | cora | 1,044 | val |
1-hop neighbor's text information: Instance-based learning algorithms. :
1-hop neighbor's text information: Flexible metric nearest neighbor classification. : The K-nearest-neighbor decision rule assigns an object of unknown class to the plurality class among the K labeled "training" objects that are closest to it. ... | 4 | Theory | cora | 439 | test |
1-hop neighbor's text information: A Computational Account of Movement Learning and its Impact on the Speed-Accuracy Tradeoff: We present a computational model of movement skill learning. The types of skills addressed are a class of trajectory following movements involving multiple accelerations, decelerations and chan... | 2 | Case Based | cora | 1,729 | test |
1-hop neighbor's text information: Classification of underwater mammals using feature extraction based on time-frequency analysis and bcm theory. : Underwater mammal sound classification is demonstrated using a novel application of wavelet time/frequency decomposition and feature extraction using a BCM unsupervised ne... | 1 | Neural Networks | cora | 296 | val |
1-hop neighbor's text information: An Information Maximization Approach to Blind Separation and Blind Deconvolution. : We derive a new self-organising learning algorithm which maximises the information transferred in a network of non-linear units. The algorithm does not assume any knowledge of the input distributions,... | 1 | Neural Networks | cora | 2,211 | test |
1-hop neighbor's text information: Integrated Architectures for Learning, Planning and Reacting Based on Approximating Dynamic Programming, : This paper extends previous work with Dyna, a class of architectures for intelligent systems based on approximating dynamic programming methods. Dyna architectures integrate tri... | 5 | Reinforcement Learning | cora | 479 | test |
1-hop neighbor's text information: Walsh Functions and Predicting Problem Complexity:
1-hop neighbor's text information: 3 Representation Issues in Neighborhood Search and Evolutionary Algorithms: Evolutionary Algorithms are often presented as general purpose search methods. Yet, we also know that no search method is ... | 3 | Genetic Algorithms | cora | 1,084 | test |
1-hop neighbor's text information: A Theory of Networks for Approximation and Learning, : Learning an input-output mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multi-dimensional function, that is solving th... | 1 | Neural Networks | cora | 2,080 | test |
1-hop neighbor's text information: Learning to predict by the methods of temporal differences. : This article introduces a class of incremental learning procedures specialized for prediction|that is, for using past experience with an incompletely known system to predict its future behavior. Whereas conventional predic... | 5 | Reinforcement Learning | cora | 2,204 | test |
1-hop neighbor's text information: On convergence properties of the em algorithm for gaussian mixtures. : We build up the mathematical connection between the "Expectation-Maximization" (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in ... | 6 | Probabilistic Methods | cora | 318 | test |
1-hop neighbor's text information: Coupled hidden markov models for modeling interacting processes. : c flMIT Media Lab Perceptual Computing / Learning and Common Sense Technical Report 405 3nov96, revised 3jun97 Abstract We present methods for coupling hidden Markov models (hmms) to model systems of multiple interact... | 6 | Probabilistic Methods | cora | 1,575 | test |
1-hop neighbor's text information: Irrelevant features and the subset selection problem. : We address the problem of finding a subset of features that allows a supervised induction algorithm to induce small high-accuracy concepts. We examine notions of relevance and irrelevance, and show that the definitions used in t... | 2 | Case Based | cora | 80 | val |
1-hop neighbor's text information: An Empirical Analysis of the Benefit of Decision Tree Size Biases as a Function of Concept Distribution. : The results reported here empirically show the benefit of decision tree size biases as a function of concept distribution. First, it is shown how concept distribution complexity... | 4 | Theory | cora | 507 | train |
1-hop neighbor's text information: Estimating attributes: Analysis and extension of relief. : In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called REL... | 0 | Rule Learning | cora | 527 | val |
1-hop neighbor's text information: Learning to Act using Real- Time Dynamic Programming. : fl The authors thank Rich Yee, Vijay Gullapalli, Brian Pinette, and Jonathan Bachrach for helping to clarify the relationships between heuristic search and control. We thank Rich Sutton, Chris Watkins, Paul Werbos, and Ron Willi... | 5 | Reinforcement Learning | cora | 368 | test |
1-hop neighbor's text information: Boolean Functions Fitness Spaces: We investigate the distribution of performance of the Boolean functions of 3 Boolean inputs (particularly that of the parity functions), the always-on-6 and even-6 parity functions. We us enumeration, uniform Monte-Carlo random sampling and sampling r... | 3 | Genetic Algorithms | cora | 2,120 | test |
1-hop neighbor's text information: van der Minimisation methods for training feed-forward neural networks. : DIMACS Technical Report 95-35 August 1995
Target text information: Constructive methods for designing compact feedforward networks of threshold units. : We propose two algorithms for constructing and training ... | 1 | Neural Networks | cora | 2,548 | test |
1-hop neighbor's text information: Rule induction and instance-based learning: A unified approach. : This paper presents a new approach to inductive learning that combines aspects of instance-based learning and rule induction in a single simple algorithm. The RISE system searches for rules in a specific-to-general fas... | 2 | Case Based | cora | 422 | test |
1-hop neighbor's text information: Training methods for adaptive boosting of neural networks for character recognition. : Technical Report #1072, D epartement d'Informatique et Recherche Op erationnelle, Universit e de Montr eal Abstract Boosting is a general method for improving the performance of any learning algori... | 1 | Neural Networks | cora | 1,326 | test |
1-hop neighbor's text information: Perfect simulation of Harris recurrent Markov chains. : We develop an algorithm for simulating "perfect" random samples from the invariant measure of a Harris recurrent Markov chain. The method uses backward coupling of embedded regeneration times, and works most effectively for fini... | 6 | Probabilistic Methods | cora | 2,284 | test |
1-hop neighbor's text information: : Figure 9: Results for various optimizations. Figure 10: Results with and without markov boundary scoring.
Target text information: A collection of algorithms for belief networks. : Portions of this report have been published in the Proceedings of the Fifteenth Annual Symposium on C... | 6 | Probabilistic Methods | cora | 1,795 | test |
1-hop neighbor's text information: Self-organized formation of typologically correct feature maps. : 2] D. E. Rumelhart, G. E. Hinton and R. J. Williams, "Learning Internal Representations by Error Propagation", in D. E. Rumelhart and J. L. McClelland (eds.) Parallel Distributed Processing: Explorations in the Microst... | 1 | Neural Networks | cora | 1,377 | test |
1-hop neighbor's text information: Applying Case Retrieval Nets to diagnostic tasks in technical domains. accepted for: : This paper presents Objectdirected Case Retrieval Nets, a memory model developed for an application of Case-Based Reasoning to the task of technical diagnosis. The key idea is to store cases, i.e. ... | 2 | Case Based | cora | 1,505 | test |
1-hop neighbor's text information: Dietterich (1991). Learning with Many Irrelevant Features. : In many domains, an appropriate inductive bias is the MIN-FEATURES bias, which prefers consistent hypotheses definable over as few features as possible. This paper defines and studies this bias. First, it is shown that any ... | 2 | Case Based | cora | 2,229 | test |
1-hop neighbor's text information: Average-case analysis of a nearest neighbour algorithm. : In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by many researchers. Our analysis assumes a conjunctive target concept, noise-free Boolean at... | 4 | Theory | cora | 1,965 | val |
1-hop neighbor's text information: Keeping neural networks simple by minimizing the description length of the weights. : Supervised neural networks generalize well if there is much less information in the weights than there is in the output vectors of the training cases. So during learning, it is important to keep the... | 4 | Theory | cora | 2,681 | test |
1-hop neighbor's text information: Representing aggregate belief through the competitive equilibrium of a securities market. : We consider the problem of belief aggregation: given a group of individual agents with probabilistic beliefs over a set of of uncertain events, formulate a sensible consensus or aggregate prob... | 6 | Probabilistic Methods | cora | 679 | test |
1-hop neighbor's text information: Real-time Interactive Neuro-evolution: In standard neuro-evolution, a population of networks is evolved in the task, and the network that best solves the task is found. This network is then fixed and used to solve future instances of the problem. Networks evolved in this way do not ha... | 3 | Genetic Algorithms | cora | 1,904 | test |
1-hop neighbor's text information: Local error bars for nonlinear regression and time series prediction. : We present a new method for obtaining local error bars for nonlinear regression, i.e., estimates of the confidence in predicted values that depend on the input. We approach this problem by applying a maximum-like... | 1 | Neural Networks | cora | 2,367 | test |
1-hop neighbor's text information: Evaluating and improving steady state evolutionary algorithms on constraint satisfaction problems. :
1-hop neighbor's text information: Graph coloring with adaptive evolutionary algorithms. : This technical report summarizes our results on solving graph coloring problems with Genet... | 3 | Genetic Algorithms | cora | 632 | test |
1-hop neighbor's text information: (1997) Perfect Simulation of some Point Processes for the Impatient User, Advances in Applied Probability, Stochastic Geometry and Statistical Applications, : Recently Propp and Wilson [14] have proposed an algorithm, called Coupling from the Past (CFTP), which allows not only an app... | 6 | Probabilistic Methods | cora | 620 | test |
1-hop neighbor's text information: Experiments with a regression-based causal induction algorithm. EKSL memo number 94-33, : Covariance information can help an algorithm search for predictive causal models and estimate the strengths of causal relationships. This information should not be discarded after conditional in... | 6 | Probabilistic Methods | cora | 1,943 | test |
1-hop neighbor's text information: "Space-frequency localized basis function networks for nonlinear system estimation and control," : Stable neural network control and estimation may be viewed formally as a merging of concepts from nonlinear dynamic systems theory with tools from multivariate approximation theory. Thi... | 1 | Neural Networks | cora | 1,987 | test |
1-hop neighbor's text information: Predicting probability distributions: A connectionist approach. : Most traditional prediction techniques deliver the mean of the probability distribution (a single point). For multimodal processes, instead of predicting the mean of the probability distribution, it is important to pre... | 1 | Neural Networks | cora | 867 | test |
1-hop neighbor's text information: Genetic Algorithms in Search, Optimization and Machine Learning. : Angeline, P., Saunders, G. and Pollack, J. (1993) An evolutionary algorithm that constructs recurrent neural networks, LAIR Technical Report #93-PA-GNARLY, Submitted to IEEE Transactions on Neural Networks Special Iss... | 3 | Genetic Algorithms | cora | 393 | test |
1-hop neighbor's text information: Soft Computing: the Convergence of Emerging Reasoning Technologies: The term Soft Computing (SC) represents the combination of emerging problem-solving technologies such as Fuzzy Logic (FL), Probabilistic Reasoning (PR), Neural Networks (NNs), and Genetic Algorithms (GAs). Each of the... | 1 | Neural Networks | cora | 1,449 | val |
1-hop neighbor's text information: TD models: modeling the world at a mixture of time scales. : Temporal-difference (TD) learning can be used not just to predict rewards, as is commonly done in reinforcement learning, but also to predict states, i.e., to learn a model of the world's dynamics. We present theory and alg... | 5 | Reinforcement Learning | cora | 1,716 | test |
1-hop neighbor's text information: A Structured Pattern Matching Approach to Shotgun Sequence Assembly, : In this paper, we propose an efficient, reliable shotgun sequence assembly algorithm based on a fingerprinting scheme that is robust to both noise and repetitive sequences in the data. Our algorithm uses exact mat... | 1 | Neural Networks | cora | 1,361 | test |
1-hop neighbor's text information: Exploiting Choice: Instruction Fetch and Issue on an implementable Simultaneous Multithread-ing Processor. : Simultaneous multithreading is a technique that permits multiple independent threads to issue multiple instructions each cycle. In previous work we demonstrated the performanc... | 0 | Rule Learning | cora | 1,251 | test |
1-hop neighbor's text information: GA-RBF: A Self-Optimising RBF Network: The effects of a neural network's topology on its performance are well known, yet the question of finding optimal configurations automatically remains largely open. This paper proposes a solution to this problem for RBF networks. A self- optimisi... | 1 | Neural Networks | cora | 1,822 | test |
1-hop neighbor's text information: On the convergence properties of the EM algorithm. : In this article we investigate the relationship between the two popular algorithms, the EM algorithm and the Gibbs sampler. We show that the approximate rate of convergence of the Gibbs sampler by Gaussian approximation is equal to... | 6 | Probabilistic Methods | cora | 802 | test |
1-hop neighbor's text information: Back propagation is sensitive to initial conditions. : This paper explores the effect of initial weight selection on feed-forward networks learning simple functions with the back-propagation technique. We first demonstrate, through the use of Monte Carlo techniques, that the magnitud... | 1 | Neural Networks | cora | 291 | test |
1-hop neighbor's text information: DART/HYESS Users Guide recursive covering approach to local learning:
1-hop neighbor's text information: Adaptive noise injection for input relevance determination. : In this paper we consider the application of training with noise in multi-layer perceptron to input variables relev... | 1 | Neural Networks | cora | 1,437 | test |
1-hop neighbor's text information: Construction of phylogenetic trees. : 6] Farach, M. and Thorup, M. 1993. Fast Comparison of Evolutionary Trees, Technical Report 93-46, DIMACS, Rutgers University, Piscataway, NJ.
1-hop neighbor's text information: A polynomial-time algorithm for the phylogeny problem when the numbe... | 4 | Theory | cora | 744 | test |
1-hop neighbor's text information: A connectionist architecture for learning to parse. : We present a connectionist architecture and demonstrate that it can learn syntactic parsing from a corpus of parsed text. The architecture can represent syntactic constituents, and can learn generalizations over syntactic constitu... | 1 | Neural Networks | cora | 2,258 | test |
1-hop neighbor's text information: Baird (1995). Residual algorithms: Reinforcement learning with function approximation. : A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that these algorithms... | 5 | Reinforcement Learning | cora | 2,177 | val |
1-hop neighbor's text information: Representation and evolution of neural networks. : An evolutionary approach for developing improved neural network architectures is presented. It is shown that it is possible to use genetic algorithms for the construction of backpropagation networks for real world tasks. Therefore a ... | 3 | Genetic Algorithms | cora | 748 | test |
1-hop neighbor's text information: Learning conjunctions of Horn clauses. :
1-hop neighbor's text information: Statistical queries and faulty PAC oracles. : In this paper we study learning in the PAC model of Valiant [18] in which the example oracle used for learning may be faulty in one of two ways: either by miscl... | 4 | Theory | cora | 945 | test |
1-hop neighbor's text information: "Adaptive source separation without prewhitening," : Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptiv... | 1 | Neural Networks | cora | 755 | test |
1-hop neighbor's text information: A Decision-theoretic Generalization of On-line Learning and an Application to Boosting. : We consider the problem of dynamically apportioning resources among a set of options in a worst-case on-line framework. The model we study can be interpreted as a broad, abstract extension of th... | 1 | Neural Networks | cora | 1,274 | val |
1-hop neighbor's text information: Exploring the decision forest: An empirical investigation of Occam\'s razor in decision tree induction. : We report on a series of experiments in which all decision trees consistent with the training data are constructed. These experiments were run to gain an understanding of the pro... | 4 | Theory | cora | 1,855 | test |
1-hop neighbor's text information: Extensions of Fill\'s algorithm for perfect simulation. : Fill's algorithm for perfect simulation for attractive finite state space models, unbiased for user impatience, is presented in terms of stochastic recursive sequences and extended in two ways. Repulsive discrete Markov random... | 6 | Probabilistic Methods | cora | 2,289 | test |
1-hop neighbor's text information: A global unified resource requirements represen-tations. : Technical Report 94-10
1-hop neighbor's text information: Efficient superscalar performance through boosting. : The foremost goal of superscalar processor design is to increase performance through the exploitation of instruc... | 0 | Rule Learning | cora | 2,604 | test |
1-hop neighbor's text information: and P.M. Long. Characterizations of learnability for classes of f0; :::; ng-valued functions. To appear, :
Target text information: Long. A generalization of Sauer\'s lemma. :
I provide the content of the target node and its neighbors' information. The relation between the target ... | 4 | Theory | cora | 1,102 | test |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 11