node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
1,994 | 3 | Title: Constructive Belief and Rational Representation
Abstract: It is commonplace in artificial intelligence to divide an agent's explicit beliefs into two parts: the beliefs explicitly represented or manifest in memory, and the implicitly represented or constructive beliefs that are repeatedly reconstructed when ne... | [
1800,
1995,
2097,
2241
] | Validation |
1,995 | 3 | Title: Rationality and its Roles in Reasoning
Abstract: The economic theory of rationality promises to equal mathematical logic in its importance for the mechanization of reasoning. We survey the growing literature on how the basic notions of probability, utility, and rational choice, coupled with practical limitatio... | [
1800,
1907,
1994,
2097
] | Train |
1,996 | 2 | Title: A New Algorithm for DNA Sequence Assembly Running Title: A New Algorithm for DNA Sequence Assembly
Abstract: The economic theory of rationality promises to equal mathematical logic in its importance for the mechanization of reasoning. We survey the growing literature on how the basic notions of probability, u... | [
1997
] | Train |
1,997 | 2 | Title: AMASS: A Structured Pattern Matching Approach to Shotgun Sequence Assembly
Abstract: 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 matches of short... | [
1996
] | Train |
1,998 | 2 | Title: Programming Environment for a High Performance Parallel Supercomputer with Intelligent Communication
Abstract: At the Electronics Lab of the Swiss Federal Institute of Techology (ETH) in Zurich, the high performance Parallel Supercomputer MUSIC (MUlti processor System with Intelligent Communication) has beed d... | [
1873
] | Train |
1,999 | 1 | Title: Evolutionary Training of CLP-Constrained Neural Networks
Abstract: The paper is concerned with the integration of constraint logic programming systems (CLP) with systems based on genetic algorithms (GA). The resulting framework is tailored for applications that require a first phase in which a number of constr... | [
427,
2003,
2515
] | Train |
2,000 | 3 | Title: A LOGICAL APPROACH TO REASONING ABOUT UNCERTAINTY: A TUTORIAL
Abstract: fl This paper will appear in Discourse, Interaction, and Communication, X. Arrazola, K. Korta, and F. J. Pelletier, eds., Kluwer, 1997. Much of this work was performed while the author was at IBM Almaden Research Center. IBM's support is g... | [
467,
2115
] | Train |
2,001 | 1 | Title: Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring 1
Abstract: 1 This report is also available through http://www.wi.leidenuniv.nl/~gusz/ sawvsgga.ps.gz | [
833,
1796
] | Train |
2,002 | 3 | Title: Geometric Ergodicity of Gibbs and Block Gibbs Samplers for a Hierarchical Random Effects Model
Abstract: 1 This report is also available through http://www.wi.leidenuniv.nl/~gusz/ sawvsgga.ps.gz | [
1713,
2153,
2510
] | Validation |
2,003 | 1 | Title: Constraining of Weights using Regularities
Abstract: In this paper we study how global optimization methods (like genetic algorithms) can be used to train neural networks. We introduce the notion of regularity, for studying properties of the error function that expand the search space in an artificial way. Reg... | [
1999,
2515
] | Test |
2,004 | 6 | Title: On Learning Bounded-Width Branching Programs
Abstract: In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branching programs, and we investigate the influence of the width of the branching program on the difficulty of the lear... | [
672,
2040,
2360
] | Train |
2,005 | 6 | Title: The Parameterized Complexity of Sequence Alignment and Consensus
Abstract: The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several different ways in which parameters enter the problem, such as the number of sequences to be analyzed,... | [
2345
] | Train |
2,006 | 6 | Title: Constructing New Attributes for Decision Tree Learning
Abstract: The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several different ways in which parameters enter the problem, such as the number of sequences to be analyzed, the lengt... | [
1824
] | Test |
2,007 | 4 | Title: A Computer Scientist's View of Life, the Universe, and Everything
Abstract: Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible univ... | [
68,
1779,
1780
] | Validation |
2,008 | 3 | Title: Self-Targeting Candidates for Metropolis-Hastings Algorithms
Abstract: The Metropolis-Hastings algorithm for estimating a distribution is based on choosing a candidate Markov chain and then accepting or rejecting moves of the candidate to produce a chain known to have as the invariant measure. The traditional ... | [
2022,
2153,
2219
] | Test |
2,009 | 5 | Title: The Predictability of Data Values
Abstract: Copyright 1997 IEEE. Published in the Proceedings of Micro-30, December 1-3, 1997 in Research Triangle Park, North Carolina. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or ... | [
2534
] | Test |
2,010 | 0 | Title: Learning in design: From Characterizing Dimensions to Working Systems
Abstract: The application of machine learning (ML) to solve practical problems is complex. Only recently, due to the increased promise of ML in solving real problems and the experienced difficulty of their use, has this issue started to attr... | [
2447
] | Train |
2,011 | 6 | Title: An O(n log log n Learning Algorithm for DNF under the Uniform Distribution
Abstract: We show that a DNF with terms of size at most d can be approximated by a function with at most d O(d log1=") non zero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at m... | [
1835,
2182,
2633
] | Test |
2,012 | 6 | Title: Multivariate Decision Trees
Abstract: COINS Technical Report 92-82 December 1992 Abstract Multivariate decision trees overcome a representational limitation of univariate decision trees: univariate decision trees are restricted to splits of the instance space that are orthogonal to the feature's axis. This pap... | [
102,
378,
2135
] | Train |
2,013 | 2 | Title: Using the Stochastic Gradient Method to Fit Polychotomous Regression Models
Abstract: Technical Report No. 319 April 7, 1997 University of Washington Department of Statistics Seattle, Washington 98195-4322 Abstract Kooperberg, Bose, and Stone (1997) introduced polyclass, a methodology that uses adaptively sele... | [
74,
2382
] | Train |
2,014 | 4 | Title: Emergent Hierarchical Control Structures: Learning Reactive/Hierarchical Relationships in Reinforcement Environments
Abstract: The use of externally imposed hierarchical structures to reduce the complexity of learning control is common. However, it is acknowledged that learning the hierarchical structure itsel... | [
562,
1828,
2018
] | Train |
2,015 | 6 | Title: On-Line Portfolio Selection Using Multiplicative Updates
Abstract: We present an on-line investment algorithm which achieves almost the same wealth as the best constant-rebalanced portfolio determined in hindsight from the actual market outcomes. The algorithm employs a multiplicative update rule derived using... | [
2034,
2092,
2327
] | Train |
2,016 | 3 | Title: On the Semantics of Belief Revision Systems
Abstract: We consider belief revision operators that satisfy the Alchourron-Gardenfors-Makinson postulates, and present an epistemic logic in which, for any such revision operator, the result of a revision can be described by a sentence in the logic. In our logic, th... | [
342,
467,
1800
] | Train |
2,017 | 3 | Title: 28 Learning Bayesian Networks Using Feature Selection
Abstract: This paper introduces a novel enhancement for learning Bayesian networks with a bias for small, high-predictive-accuracy networks. The new approach selects a subset of features that maximizes predictive accuracy prior to the network learning phase... | [
1479,
1582,
2677
] | Train |
2,018 | 4 | Title: Learning Hierarchical Control Structures for Multiple Tasks and Changing Environments
Abstract: While the need for hierarchies within control systems is apparent, it is also clear to many researchers that such hierarchies should be learned. Learning both the structure and the component behaviors is a difficult... | [
562,
1828,
2014
] | Train |
2,019 | 2 | Title: Ensemble Training: Some Recent Experiments with Postal Zip Data
Abstract: Recent findings suggest that a classification scheme based on an ensemble of networks is an effective way to address overfitting. We study optimal methods for training an ensemble of networks. Some recent experiments on Postal Zip-code c... | [
157,
2147
] | Train |
2,020 | 2 | Title: Variational Gaussian Process Classifiers
Abstract: | [
1857
] | Train |
2,021 | 2 | Title: Best-First Model Merging for Dynamic Learning and Recognition
Abstract: Best-first model merging is a general technique for dynamically choosing the structure of a neural or related architecture while avoiding overfitting. It is applicable to both learning and recognition tasks and often generalizes significan... | [
87,
157,
2218,
2428
] | Test |
2,022 | 3 | Title: Geometric and Subgeometric Convergence of Diffusions with Given Stationary Distributions, and Their Discretizations
Abstract: We describe algorithms for estimating a given measure known up to a constant of proportionality, based on a large class of diffusions (extending the Langevin model) for which is invaria... | [
2008,
2153,
2219
] | Test |
2,023 | 2 | Title: Classification of EEG Signals Using a Sparse Polynomial Builder
Abstract: Edward S. Orosz and Charles W. Anderson Technical Report CS-94-111 April 27, 1994 | [
2135
] | Test |
2,024 | 2 | Title: Analysis of Linsker's application of Hebbian rules to Linear Networks
Abstract: Linsker has reported the development of structured receptive fields in simulations using a Hebb-type synaptic plasticity rule in a feed-forward linear network. The synapses develop under dynamics determined by a matrix that is clos... | [
427,
737,
1778,
1932
] | Test |
2,025 | 3 | Title: WEAK CONVERGENCE AND OPTIMAL SCALING OF RANDOM WALK METROPOLIS ALGORITHMS
Abstract: This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as... | [
2153,
2377,
2693
] | Train |
2,026 | 2 | Title: Learning overcomplete representations
Abstract: This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of targ... | [
570,
576,
1922,
2552
] | Train |
2,027 | 4 | Title: Coordinating Reactive Behaviors keywords: reactive systems, planning and learning
Abstract: Combinating reactivity with planning has been proposed as a means of compensating for potentially slow response times of planners while still making progress toward long term goals. The demands of rapid response and th... | [
465,
565,
636,
2409
] | Train |
2,028 | 6 | Title: Teaching a Smarter Learner
Abstract: We introduce a formal model of teaching in which the teacher is tailored to a particular learner, yet the teaching protocol is designed so that no collusion is possible. Not surprisingly, such a model remedies the non-intuitive aspects of other models in which the teacher m... | [
308,
1003,
2653
] | Train |
2,029 | 2 | Title: A Simple Randomized Quantization Algorithm for Neural Network Pattern Classifiers
Abstract: This paper explores some algorithms for automatic quantization of real-valued datasets using thermometer codes for pattern classification applications. Experimental results indicate that a relatively simple randomized t... | [
503,
1818,
1952,
2393
] | Train |
2,030 | 1 | Title: Using Modeling Knowledge to Guide Design Space Search
Abstract: Automated search of a space of candidate designs seems an attractive way to improve the traditional engineering design process. To make this approach work, however, the automated design system must include both knowledge of the modeling limitation... | [
743,
744,
2077,
2128,
2130,
2131,
2316,
2659
] | Train |
2,031 | 6 | Title: TOWARDS CONCEPT FORMATION GROUNDED ON PERCEPTION AND ACTION OF A MOBILE ROBOT
Abstract: The recognition of objects and, hence, their descriptions must be grounded in the environment in terms of sensor data. We argue, why the concepts, used to classify perceived objects and used to perform actions on these obje... | [
2171
] | Validation |
2,032 | 5 | Title: Learning Action-oriented Perceptual Features for Robot Navigation
Abstract: The recognition of objects and, hence, their descriptions must be grounded in the environment in terms of sensor data. We argue, why the concepts, used to classify perceived objects and used to perform actions on these objects, should ... | [
344,
2171
] | Train |
2,033 | 2 | Title: Improving RBF Networks by the Feature Selection Approach EUBAFES
Abstract: The curse of dimensionality is one of the severest problems concerning the application of RBF networks. The number of RBF nodes and therefore the number of training examples needed grows exponentially with the intrinsic dimensionality o... | [
430,
2622
] | Train |
2,034 | 3 | Title: Update rules for parameter estimation in Bayesian networks
Abstract: This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [12]. We provide a unified framework for parameter estimation tha... | [
453,
558,
577,
2015,
2327
] | Train |
2,035 | 0 | Title: Knowledge Compilation and Speedup Learning in Continuous Task Domains
Abstract: Many techniques for speedup learning and knowledge compilation focus on the learning and optimization of macro-operators or control rules in task domains that can be characterized using a problem-space search paradigm. However, suc... | [
858,
1084,
2303
] | Train |
2,036 | 6 | Title: Query, PACS and simple-PAC Learning
Abstract: We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron in [3], with the standard simple-PAC model and give a general technique t... | [
2696
] | Test |
2,037 | 0 | Title: Formalising the knowledge content of case memory systems
Abstract: Discussions of case-based reasoning often reflect an implicit assumption that a case memory system will become better informed, i.e. will increase in knowledge, as more cases are added to the case-base. This paper considers formalisations of th... | [
288,
1584,
2151
] | Validation |
2,038 | 0 | Title: Knowledge Based Systems
Abstract: Technical Report No. 95/2 | [
985,
2692
] | Train |
2,039 | 1 | Title: A Case Study on Tuning of Genetic Algorithms by Using Performance Evaluation Based on Experimental Design
Abstract: This paper proposes four performance measures of a genetic algorithm (GA) which enable us to compare different GAs for an op timization problem and different choices of their parameters' values. ... | [
163,
1060,
1890,
2254
] | Train |
2,040 | 6 | Title: On the Learnability and Usage of Acyclic Probabilistic Finite Automata
Abstract: We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishability property of the automata's states. Though hard... | [
574,
672,
1006,
1924,
2004,
2360
] | Test |
2,041 | 2 | Title: Natural Language Grammatical Inference with Recurrent Neural Networks
Abstract: This paper examines the inductive inference of a complex grammar with neural networks specifically, the task considered is that of training a network to classify natural language sentences as grammatical or ungrammatical, thereby e... | [
1744
] | Train |
2,042 | 2 | Title: Fast Bounded Smooth Regression with Lazy Neural Trees
Abstract: We propose the lazy neural tree (LNT) as the appropriate architecture for the realization of smooth regression systems. The LNT is a hybrid of a decision tree and a neural network. From the neural network it inherits smoothness of the generated fu... | [
378,
2428
] | Test |
2,043 | 2 | Title: Using Mixtures of Factor Analyzers for Segmentation and Pose Estimation Category: Visual Processing Preference: Oral
Abstract: To read a hand-written digit string, it is helpful to segment the image into separate digits. Bottom-up segmentation heuristics often fail when neighboring digits overlap substantiall... | [
2270
] | Train |
2,044 | 2 | Title: Neural Networks and Statistical Models Proceedings of the Nineteenth Annual SAS Users Group International Conference,
Abstract: | [
80,
427,
1149,
2683
] | Train |
2,045 | 5 | Title: The Arguments of Newly Invented Predicates in ILP
Abstract: In this paper we investigate the problem of choosing arguments for a new predicate. We identify the relevant terms to be considered as arguments, and propose methods to choose among them based on propositional minimisation. | [
638,
2550
] | Train |
2,046 | 2 | Title: A Method for Identifying Splice Sites and Translational Start Sites in
Abstract: This paper describes a new method for determining the consensus sequences that signal the start of translation and the boundaries between exons and introns (donor and acceptor sites) in eukaryotic mRNA. The method takes into accou... | [
268,
616,
2107
] | Test |
2,047 | 1 | Title: Evolutionary wanderlust: Sexual selection with directional mate preferences. Evolutionary wanderlust: Sexual selection with directional mate preferences
Abstract: In the pantheon of evolutionary forces, the optimizing Apollonian powers of natural selection are generally assumed to dominate the dark Dionysian ... | [
2111
] | Train |
2,048 | 0 | Title: Technical Diagnosis: Fallexperte-D of further knowledge sources (domain knowledge, common knowledge) is investigated in the
Abstract: Case based reasoning (CBR) uses the knowledge from former experiences ("known cases"). Since special knowledge of an expert is mainly subject to his experiences, the CBR technique... | [
1854
] | Train |
2,049 | 2 | Title: Learning Feature-based Semantics with Simple Recurrent Networks
Abstract: The paper investigates the possibilities for using simple recurrent networks as transducers which map sequential natural language input into non-sequential feature-based semantics. The networks perform well on sentences containing a sing... | [
2218,
2306,
2410
] | Train |
2,050 | 2 | Title: TABLE DES MATI ERES 1 Apprentissage et approximation les techniques de regularisation 3 1.1 Introduction
Abstract: The paper investigates the possibilities for using simple recurrent networks as transducers which map sequential natural language input into non-sequential feature-based semantics. The networks perf... | [
611,
2378
] | Validation |
2,051 | 4 | Title: Emergent Control and Planning in an Autonomous Vehicle
Abstract: We use a connectionist network trained with reinforcement to control both an autonomous robot vehicle and a simulated robot. We show that given appropriate sensory data and architectural structure, a network can learn to control the robot for a s... | [
1969
] | Test |
2,052 | 0 | Title: Applying Case-Based Reasoning to Control in Robotics
Abstract: The proposed architecture is experimentally evaluated on two real world domains and the results are compared to other machine learning algorithms applied to the same problem. | [
1483,
2062
] | Train |
2,053 | 6 | Title: On the Complexity of Learning from Drifting Distributions
Abstract: The proposed architecture is experimentally evaluated on two real world domains and the results are compared to other machine learning algorithms applied to the same problem. | [
109,
488,
2054,
2685,
2690
] | Validation |
2,054 | 6 | Title: Tracking Drifting Concepts By Minimizing Disagreements
Abstract: In this paper we consider the problem of tracking a subset of a domain (called the target) which changes gradually over time. A single (unknown) probability distribution over the domain is used to generate random examples for the learning algorit... | [
109,
591,
640,
2053,
2685
] | Train |
2,055 | 1 | Title: 1 FEATURE SUBSET SELECTION USING A GENETIC ALGORITHM time needed for learning a sufficiently accurate
Abstract: Practical pattern classification and knowledge discovery problems require selection of a subset of attributes or features (from a much larger set) to represent the patterns to be classified. This is du... | [
2352
] | Train |
2,056 | 2 | Title: PREDICTION WITH GAUSSIAN PROCESSES: FROM LINEAR REGRESSION TO LINEAR PREDICTION AND BEYOND To appear in
Abstract: The main aim of this paper is to provide a tutorial on regression with Gaussian processes. We start from Bayesian linear regression, and show how by a change of viewpoint one can see this method as a... | [
271,
2095
] | Validation |
2,057 | 0 | Title: Chunking in soar: The anatomy of a general learn ing mechanism. Machine Learning, 1(1). Learning
Abstract: gers University. Also appears as tech. report ML- TR-7. Minton, S. (1988). Quantitative results concerning the utility of explanation-based learning. In Proceedings of National Conference on Artificial Inte... | [
790,
1510,
2215,
2465,
2695
] | Train |
2,058 | 1 | Title: Challenges in Evolving Controllers for Physical Robots
Abstract: This paper discusses the feasibility of applying evolutionary methods to automatically generating controllers for physical mobile robots. We overview the state of the art in the field, describe some of the main approaches, discuss the key challen... | [
755,
757,
2232
] | Train |
2,059 | 6 | Title: Challenges in Evolving Controllers for Physical Robots
Abstract: General convergence results for linear discriminant updates Abstract The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Perc... | [
453,
2651
] | Test |
2,060 | 0 | Title: A Similarity-Based Retrieval Tool for Software Repositories
Abstract: In this paper we present a prototype of a flexible similarity-based retrieval system. Its flexibility is supported by allowing for an imprecisely specified query. Moreover, our algorithm allows for assessing if the retrieved items are releva... | [
857,
1483,
2062
] | Train |
2,061 | 0 | Title: Inductive Learning and Case-Based Reasoning
Abstract: This paper describes an application of an inductive learning techniques to case-based reasoning. We introduce two main forms of induction, define case-based reasoning and present a combination of both. The evaluation of the proposed system, called TA3, is c... | [
96,
215,
2062
] | Train |
2,062 | 0 | Title: A Case-Based Reasoning Approach
Abstract: The AAAI Fall Symposium; Flexible Computation in Intelligent Systems: Results, Issues, and Opportunities. Nov. 9-11, 1996, Cambridge, MA Abstract This paper presents a case-based reasoning system TA3. We address the flexibility of the case-based reasoning process, name... | [
2052,
2060,
2061,
2066
] | Train |
2,063 | 3 | Title: Planning Medical Therapy Using Partially Observable Markov Decision Processes.
Abstract: Diagnosis of a disease and its treatment are not separate, one-shot activities. Instead they are very often dependent and interleaved over time, mostly due to uncertainty about the underlying disease, uncertainty associate... | [
2494
] | Train |
2,064 | 3 | Title: A Market Framework for Pooling Opinions
Abstract: Consider a group of Bayesians, each with a subjective probability distribution over a set of uncertain events. An opinion pool derives a single consensus distribution over the events, representative of the group as a whole. Several pooling functions have been p... | [
1777,
1802
] | Train |
2,065 | 1 | Title: Performance Enhanced Genetic Programming
Abstract: Genetic Programming is increasing in popularity as the basis for a wide range of learning algorithms. However, the technique has to date only been successfully applied to modest tasks because of the performance overheads of evolving a large number of data stru... | [
1985,
2086
] | Train |
2,066 | 6 | Title: On the Informativeness of the DNA Promoter Sequences Domain Theory
Abstract: The DNA promoter sequences domain theory and database have become popular for testing systems that integrate empirical and analytical learning. This note reports a simple change and reinterpretation of the domain theory in terms of M-... | [
159,
985,
2062,
2674
] | Validation |
2,067 | 6 | Title: Classification by Pairwise Coupling
Abstract: We discuss a strategy for polychotomous classification that involves estimating class probabilities for each pair of classes, and then coupling the estimates together. The coupling model is similar to the Bradley-Terry method for paired comparisons. We study the na... | [
1792
] | Validation |
2,068 | 2 | Title: Rearrangement of receptive field topography after intracortical and peripheral stimulation: The role of plasticity in
Abstract: Intracortical microstimulation (ICMS) of a single site in the somatosensory cortex of rats and monkeys for 2-6 hours produces a large increase in the number of neurons responsive to the... | [
355,
2228
] | Validation |
2,069 | 3 | Title: A Note on Testing Exogeneity of Instrumental Variables (DRAFT PAPER)
Abstract: Intracortical microstimulation (ICMS) of a single site in the somatosensory cortex of rats and monkeys for 2-6 hours produces a large increase in the number of neurons responsive to the skin region corresponding to the ICMS-site rec... | [
260,
2434
] | Validation |
2,070 | 5 | Title: A Partial Memory Incremental Learning Methodology And Its Application To Computer Intrusion Detection
Abstract: Intracortical microstimulation (ICMS) of a single site in the somatosensory cortex of rats and monkeys for 2-6 hours produces a large increase in the number of neurons responsive to the skin region c... | [
2602,
2640
] | Validation |
2,071 | 0 | Title: LINNEO A Classification Methodology for Ill-structured Domains
Abstract: In this work we present a classification methodology (LINNEO + ) to discover concepts from ill-structured domains and to organize hierarchies with them. In order to achieve this aim LINNEO + uses conceptual learning techniques and classif... | [
1809
] | Test |
2,072 | 2 | Title: Data Mining for Association Rules with Unsupervised Neural Networks
Abstract: results for Gaussian mixture models and factor analysis are discussed. | [
36,
667,
2227
] | Train |
2,073 | 6 | Title: Classification Using -Machines and Constructive Function Approximation
Abstract: The classification algorithm CLEF combines a version of a linear machine known as a - machine with a non-linear function approxima-tor that constructs its own features. The algorithm finds non-linear decision boundaries by constru... | [
1818
] | Train |
2,074 | 0 | Title: The Management of Context-Sensitive Features: A Review of Strategies
Abstract: In this paper, we review five heuristic strategies for handling context-sensitive features in supervised machine learning from examples. We discuss two methods for recovering lost (implicit) contextual information. We mention some e... | [
1636,
1647,
2607,
2615
] | Train |
2,075 | 0 | Title: Case Retrieval Nets: Foundations, Properties,
Abstract: Implementation, and Results | [
1855
] | Train |
2,076 | 3 | Title: Automated Discovery of Linear Feedback Models 1
Abstract: Implementation, and Results | [
211,
772,
1324,
1527,
2559
] | Test |
2,077 | 1 | Title: An Adaptive Penalty Approach for Constrained Genetic-Algorithm Optimization
Abstract: In this paper we describe a new adaptive penalty approach for handling constraints in genetic algorithm optimization problems. The idea is to start with a relatively small penalty coefficient and then increase it or decrease ... | [
163,
743,
744,
2030
] | Validation |
2,078 | 3 | Title: Structured Reachability Analysis for Markov Decision Processes
Abstract: Recent research in decision theoretic planning has focussed on making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structured reachability analysis of MDPs that are suitable when an... | [
295,
1459,
1983,
2406,
2474
] | Validation |
2,079 | 5 | Title: Extraction of Meta-Knowledge to Restrict the Hypothesis Space for ILP Systems incorporating them in FOIL.
Abstract: Many ILP systems, such as GOLEM, FOIL, and MIS, take advantage of user supplied meta-knowledge to restrict the hypothesis space. This meta-knowledge can be in the form of type information about arg... | [
1428,
2609
] | Train |
2,080 | 6 | Title: Learning from positive data
Abstract: Gold showed in 1967 that not even regular grammars can be exactly identified from positive examples alone. Since it is known that children learn natural grammars almost exclusively from positives examples, Gold's result has been used as a theoretical support for Chomsky's ... | [
1290,
2329,
2609
] | Test |
2,081 | 3 | Title: DE-NOISING BY reconstruction f n is defined in the wavelet domain by translating all the
Abstract: p n. We prove two results about that estimator. [Smooth]: With high probability ^ f fl n is at least as smooth as f , in any of a wide variety of smoothness measures. [Adapt]: The estimator comes nearly as close in... | [
1910,
2159,
2366
] | Test |
2,082 | 1 | Title: %A L. Ingber %T Adaptive simulated annealing (ASA): Lessons learned %J Control and Cybernetics Annealing
Abstract: | [
1775,
1793,
1795,
2178,
2545
] | Train |
2,083 | 2 | Title: TREE CONTRACTIONS AND EVOLUTIONARY TREES
Abstract: An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species. An agreement... | [
299,
1827,
2511
] | Train |
2,084 | 2 | Title: Synthesize, Optimize, Analyze, Repeat (SOAR): Application of Neural Network Tools to ECG Patient Monitoring
Abstract: Results are reported from the application of tools for synthesizing, optimizing and analyzing neural networks to an ECG Patient Monitoring task. A neural network was synthesized from a rule-bas... | [
2615
] | Test |
2,085 | 2 | Title: Modeling dynamic receptive field changes produced by intracortical microstimulation
Abstract: Intracortical microstimulation (ICMS) of a localized site in the somatosensory cortex of rats and monkeys for 2-6 hours produces a large increase in the cortical representation of the skin region represented by the IC... | [
1093,
1094,
2228
] | Train |
2,086 | 1 | Title: ABSTRACT In general, the machine learning process can be accelerated through the use of additional
Abstract: Intracortical microstimulation (ICMS) of a localized site in the somatosensory cortex of rats and monkeys for 2-6 hours produces a large increase in the cortical representation of the skin region represen... | [
1231,
2065
] | Train |
2,087 | 1 | Title: Price's Theorem and the MAX Problem
Abstract: We present a detailed analysis of the evolution of GP populations using the problem of finding a program which returns the maximum possible value for a given terminal and function set and a depth limit on the program tree (known as the MAX problem). We confirm the ... | [
1257,
1911,
2175,
2261
] | Train |
2,088 | 3 | Title: A Probabilistic Calculus of Actions
Abstract: We present a symbolic machinery that admits both probabilistic and causal information about a given domain, and produces probabilistic statements about the effect of actions and the impact of observations. The calculus admits two types of conditioning operators: or... | [
248,
776,
1527,
2167,
2524,
2525
] | Train |
2,089 | 1 | Title: A Cooperative Coevolutionary Approach to Function Optimization
Abstract: A general model for the coevolution of cooperating species is presented. This model is instantiated and tested in the domain of function optimization, and compared with a traditional GA-based function optimizer. The results are encouragin... | [
357,
714,
1117,
1261,
1530,
1603,
1965
] | Test |
2,090 | 2 | Title: Is Learning The n-th Thing Any Easier Than Learning The First?
Abstract: This paper investigates learning in a lifelong context. Lifelong learning addresses situations in which a learner faces a whole stream of learning tasks. Such scenarios provide the opportunity to transfer knowledge across multiple learnin... | [
1260,
2530
] | Train |
2,091 | 0 | Title: The Utility of Knowledge in Inductive Learning Running Head: Knowledge in Inductive Learning
Abstract: This paper investigates learning in a lifelong context. Lifelong learning addresses situations in which a learner faces a whole stream of learning tasks. Such scenarios provide the opportunity to transfer kn... | [
303,
585,
1539,
1944,
2438,
2617
] | Test |
2,092 | 6 | Title: Universal Portfolios With and Without Transaction Costs
Abstract: A constant rebalanced portfolio is an investment strategy which keeps the same distribution of wealth among a set of stocks from period to period. Recently there has been work on on-line investment strategies that are competitive with the best c... | [
453,
2015
] | Train |
2,093 | 2 | Title: Locally Connected Recurrent Networks
Abstract: Lai-Wan CHAN and Evan Fung-Yu YOUNG Computer Science Department, The Chinese University of Hong Kong New Territories, Hong Kong Email : lwchan@cs.cuhk.hk Technical Report : CS-TR-95-10 Abstract The fully connected recurrent network (FRN) using the on-line training... | [
283,
1990
] | Train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.