76
Voted
AMAI
2015
Springer
9 years 8 months ago
2015
Springer
We present a Java implementation of Lang’s Universal Molecule algorithm, alongside with a visualization of its interconnected structures: the input metric tree and compatible co...
84
Voted
AMAI
2015
Springer
9 years 8 months ago
2015
Springer
89
Voted
AMAI
2015
Springer
9 years 8 months ago
2015
Springer
Abstract Formal concept analysis associates a lattice of formal concepts to a binary relation. The structure of the relation can then be described in terms of lattice theory. On th...
451
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
Weighted automata (WFAs) provide a general framework for the representation of functions mapping strings to real numbers. They include as special instances deterministic finite au...
458
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
Abstract. We introduce a broad learning model formed by cascades of predictors, Deep Cascades, that is structured as general decision trees in which leaf predictors or node questio...
337
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
We consider smoothed versions of geometric range spaces, so an element of the ground set (e.g. a point) can be contained in a range with a non-binary value in [0, 1]. Similar noti...
347
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
Kolmogorov complexity measures the amount of information in data, but does not distinguish structure from noise. Kolmogorov’s definition of the structure function was the firs...
358
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In t...
352
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
Dimensionality reduction is a very common preprocessing approach in many machine learning tasks. The goal is to design data representations that on one hand reduce the dimension of...
370
Voted
ALT
2015
Springer
9 years 8 months ago
2015
Springer
We consider an online job scheduling problem on a single machine with precedence constraints under uncertainty. In this problem, for each trial t = 1, . . . , T, the player chooses...