40,520 research outputs found
Recommended from our members
A survey of induction algorithms for machine learning
Central to all systems for machine learning from examples is an induction algorithm. The purpose of the algorithm is to generalize from a finite set of training examples a description consistent with the examples seen, and, hopefully, with the potentially infinite set of examples not seen. This paper surveys four machine learning induction algorithms. The knowledge representation schemes and a PDL description of algorithm control are emphasized. System characteristics that are peculiar to a domain of application are de-emphasized. Finally, a comparative summary of the learning algorithms is presented
On Objective Measures of Rule Surprisingness
Most of the literature argues that surprisingness is an inherently subjective aspect of the discovered knowledge, which cannot be measured in objective terms. This paper departs from this view, and it has a twofold goal: (1) showing that it is indeed possible to define objective (rather than subjective) measures of discovered rule surprisingness; (2) proposing new ideas and methods for defining objective rule surprisingness measures
Darboux Transformations for (2+1)-Dimensional Extensions of the KP Hierarchy
New extensions of the KP and modified KP hierarchies with self-consistent
sources are proposed. The latter provide new generalizations of
-dimensional integrable equations, including the DS-III equation and the
-wave problem. Furthermore, we recover a system that contains two types of
the KP equation with self-consistent sources as special cases. Darboux and
binary Darboux transformations are applied to generate solutions of the
proposed hierarchies
Iterated LD-Problem in non-associative key establishment
We construct new non-associative key establishment protocols for all left
self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these
protocols relies on variations of the (simultaneous) iterated LD-problem and
its generalizations. We discuss instantiations of these protocols using
generalized shifted conjugacy in braid groups and their quotients, LD-conjugacy
and -symmetric conjugacy in groups. We suggest parameter choices for
instantiations in braid groups, symmetric groups and several matrix groups.Comment: 30 pages, 5 figures. arXiv admin note: substantial text overlap with
arXiv:1305.440
Generalized Network Psychometrics: Combining Network and Latent Variable Models
We introduce the network model as a formal psychometric model,
conceptualizing the covariance between psychometric indicators as resulting
from pairwise interactions between observable variables in a network structure.
This contrasts with standard psychometric models, in which the covariance
between test items arises from the influence of one or more common latent
variables. Here, we present two generalizations of the network model that
encompass latent variable structures, establishing network modeling as parts of
the more general framework of Structural Equation Modeling (SEM). In the first
generalization, we model the covariance structure of latent variables as a
network. We term this framework Latent Network Modeling (LNM) and show that,
with LNM, a unique structure of conditional independence relationships between
latent variables can be obtained in an explorative manner. In the second
generalization, the residual variance-covariance structure of indicators is
modeled as a network. We term this generalization Residual Network Modeling
(RNM) and show that, within this framework, identifiable models can be obtained
in which local independence is structurally violated. These generalizations
allow for a general modeling framework that can be used to fit, and compare,
SEM models, network models, and the RNM and LNM generalizations. This
methodology has been implemented in the free-to-use software package lvnet,
which contains confirmatory model testing as well as two exploratory search
algorithms: stepwise search algorithms for low-dimensional datasets and
penalized maximum likelihood estimation for larger datasets. We show in
simulation studies that these search algorithms performs adequately in
identifying the structure of the relevant residual or latent networks. We
further demonstrate the utility of these generalizations in an empirical
example on a personality inventory dataset.Comment: Published in Psychometrik
- …