text stringlengths 0 4.09k |
|---|
Abstract: We first pursue the study of how hierarchy provides a well-adapted tool for the analysis of change. Then, using a time sequence-constrained hierarchical clustering, we develop the practical aspects of a new approach to wavelet regression. This provides a new way to link hierarchical relationships in a multiva... |
Title: The Semantics of Kalah Game |
Abstract: The present work consisted in developing a plateau game. There are the traditional ones (monopoly, cluedo, ect.) but those which interest us leave less place at the chance (luck) than to the strategy such that the chess game. Kallah is an old African game, its rules are simple but the strategies to be used ar... |
Title: Model selection for weakly dependent time series forecasting |
Abstract: Observing a stationary time series, we propose a two-step procedure for the prediction of the next value of the time series. The first step follows machine learning theory paradigm and consists in determining a set of possible predictors as randomized estimators in (possibly numerous) different predictive mod... |
Title: Ptarithmetic |
Abstract: The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see http://www.cis.upenn.edu/ giorgi/cl.html) instead of classical logic. The formulas of ptarithmetic ... |
Title: Writing Positive/Negative-Conditional Equations Conveniently |
Abstract: We present a convenient notation for positive/negative-conditional equations. The idea is to merge rules specifying the same function by using case-, if-, match-, and let-expressions. Based on the presented macro-rule-construct, positive/negative-conditional equational specifications can be written on a highe... |
Title: Bayesian inference of a negative quantity from positive measurement results |
Abstract: In this paper the Bayesian analysis is applied to assign a probability density to the value of a quantity having a definite sign. This analysis is logically consistent with the results, positive or negative, of repeated measurements. Results are used to estimate the atom density shift in a caesium fountain cl... |
Title: ASF+ --- eine ASF-aehnliche Spezifikationssprache |
Abstract: Maintaining the main aspects of the algebraic specification language ASF as presented in [Bergstra&al.89] we have extend ASF with the following concepts: While once exported names in ASF must stay visible up to the top the module hierarchy, ASF+ permits a more sophisticated hiding of signature names. The erro... |
Title: Likelihood-based inference for max-stable processes |
Abstract: The last decade has seen max-stable processes emerge as a common tool for the statistical modeling of spatial extremes. However, their application is complicated due to the unavailability of the multivariate density function, and so likelihood-based methods remain far from providing a complete and flexible fr... |
Title: Syntactic variation of support verb constructions |
Abstract: We report experiments about the syntactic variations of support verb constructions, a special type of multiword expressions (MWEs) containing predicative nouns. In these expressions, the noun can occur with or without the verb, with no clear-cut semantic difference. We extracted from a large French corpus a s... |
Title: Risk Bounds for CART Classifiers under a Margin Condition |
Abstract: Risk bounds for Classification and Regression Trees (CART, Breiman et. al. 1984) classifiers are obtained under a margin condition in the binary supervised classification framework. These risk bounds are obtained conditionally on the construction of the maximal deep binary tree and permit to prove that the li... |
Title: Error-Correcting Tournaments |
Abstract: We present a family of pairwise tournaments reducing $k$-class classification to binary classification. These reductions are provably robust against a constant fraction of binary errors. The results improve on the PECOC construction with an exponential improvement in computation, from $O(k)$ to $O(\log_2 k)$,... |
Title: Symbolic Computing with Incremental Mindmaps to Manage and Mine Data Streams - Some Applications |
Abstract: In our understanding, a mind-map is an adaptive engine that basically works incrementally on the fundament of existing transactional streams. Generally, mind-maps consist of symbolic cells that are connected with each other and that become either stronger or weaker depending on the transactional stream. Based... |
Title: An Exact Algorithm for the Stratification Problem with Proportional Allocation |
Abstract: We report a new optimal resolution for the statistical stratification problem under proportional sampling allocation among strata. Consider a finite population of N units, a random sample of n units selected from this population and a number L of strata. Thus, we have to define which units belong to each stra... |
Title: Progress in Computer-Assisted Inductive Theorem Proving by Human-Orientedness and Descente Infinie? |
Abstract: In this short position paper we briefly review the development history of automated inductive theorem proving and computer-assisted mathematical induction. We think that the current low expectations on progress in this field result from a faulty narrow-scope historical projection. Our main motivation is to ex... |
Title: Weighted least squares methods for prediction in the functional data linear model |
Abstract: The problem of prediction in functional linear regression is conventionally addressed by reducing dimension via the standard principal component basis. In this paper we show that an alternative basis chosen through weighted least-squares, or weighted least-squares itself, can be more effective when the experi... |
Title: On calibration of design weights |
Abstract: In the present investigation, we build a bridge between the generalized regression (GREG) estimator due to Deville and Sarndal (1992) and the linear regression estimator due to Hansen, Hurwitz and Madow (1953) in the presence of single auxiliary variable. The bridge confirms that the sum of calibrated weights... |
Title: Lanczos Approximations for the Speedup of Kernel Partial Least Squares Regression |
Abstract: The runtime for Kernel Partial Least Squares (KPLS) to compute the fit is quadratic in the number of examples. However, the necessity of obtaining sensitivity measures as degrees of freedom for model selection or confidence intervals for more detailed analysis requires cubic runtime, and thus constitutes a co... |
Title: Learning rules from multisource data for cardiac monitoring |
Abstract: This paper formalises the concept of learning symbolic rules from multisource data in a cardiac monitoring context. Our sources, electrocardiograms and arterial blood pressure measures, describe cardiac behaviours from different viewpoints. To learn interpretable rules, we use an Inductive Logic Programming (... |
Title: Domain Adaptation: Learning Bounds and Algorithms |
Abstract: This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data. Building on previous work by Ben-David et al. (2007), we introduce a novel distance between distributions,... |
Title: Escaping the curse of dimensionality with a tree-based regressor |
Abstract: We present the first tree-based regressor whose convergence rate depends only on the intrinsic dimension of the data, namely its Assouad dimension. The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees. |
Title: A Systematic Approach to Artificial Agents |
Abstract: Agents and agent systems are becoming more and more important in the development of a variety of fields such as ubiquitous computing, ambient intelligence, autonomous computing, intelligent systems and intelligent robotics. The need for improvement of our basic knowledge on agents is very essential. We take a... |
Title: Online Multi-task Learning with Hard Constraints |
Abstract: We discuss multi-task online learning when a decision maker has to deal simultaneously with M tasks. The tasks are related, which is modeled by imposing that the M-tuple of actions taken by the decision maker needs to satisfy certain constraints. We give natural examples of such restrictions and then discuss ... |
Title: Syntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems |
Abstract: We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactical separation into constructor and non-constructor symbols, Huet's introduction and... |
Title: Context tree selection and linguistic rhythm retrieval from written texts |
Abstract: The starting point of this article is the question "How to retrieve fingerprints of rhythm in written texts?" We address this problem in the case of Brazilian and European Portuguese. These two dialects of Modern Portuguese share the same lexicon and most of the sentences they produce are superficially identi... |
Title: A Self-Contained and Easily Accessible Discussion of the Method of Descente Infinie and Fermat's Only Explicitly Known Proof by Descente Infinie |
Abstract: We present the only proof of Pierre Fermat by descente infinie that is known to exist today. As the text of its Latin original requires active mathematical interpretation, it is more a proof sketch than a proper mathematical proof. We discuss descente infinie from the mathematical, logical, historical, lingui... |
Title: lim+, delta+, and Non-Permutability of beta-Steps |
Abstract: Using a human-oriented formal example proof of the (lim+) theorem, i.e. that the sum of limits is the limit of the sum, which is of value for reference on its own, we exhibit a non-permutability of beta-steps and delta+-steps (according to Smullyan's classification), which is not visible with non-liberalized ... |
Title: An Algebraic Dexter-Based Hypertext Reference Model |
Abstract: We present the first formal algebraic specification of a hypertext reference model. It is based on the well-known Dexter Hypertext Reference Model and includes modifications with respect to the development of hypertext since the WWW came up. Our hypertext model was developed as a product model with the aim to... |
Title: Space-time covariance functions with compact support |
Abstract: We characterize completely the Gneiting class of space-time covariance functions and give more relaxed conditions on the involved functions. We then show necessary conditions for the construction of compactly supported functions of the Gneiting type. These conditions are very general since they do not depend ... |
Title: Target Detection via Network Filtering |
Abstract: A method of `network filtering' has been proposed recently to detect the effects of certain external perturbations on the interacting members in a network. However, with large networks, the goal of detection seems a priori difficult to achieve, especially since the number of observations available often is mu... |
Title: Statistical Inference of Functional Connectivity in Neuronal Networks using Frequent Episodes |
Abstract: Identifying the spatio-temporal network structure of brain activity from multi-neuronal data streams is one of the biggest challenges in neuroscience. Repeating patterns of precisely timed activity across a group of neurons is potentially indicative of a microcircuit in the underlying neural tissue. Frequent ... |
Title: Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization |
Abstract: We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our work on inductive theorem proving, where the preservation of solutions... |
Title: Hilbert's epsilon as an Operator of Indefinite Committed Choice |
Abstract: Paul Bernays and David Hilbert carefully avoided overspecification of Hilbert's epsilon-operator and axiomatized only what was relevant for their proof-theoretic investigations. Semantically, this left the epsilon-operator underspecified. In the meanwhile, there have been several suggestions for semantics of ... |
Title: Innovated higher criticism for detecting sparse signals in correlated noise |
Abstract: Higher criticism is a method for detecting signals that are both sparse and weak. Although first proposed in cases where the noise variables are independent, higher criticism also has reasonable performance in settings where those variables are correlated. In this paper we show that, by exploiting the nature ... |
Title: Uniqueness of Low-Rank Matrix Completion by Rigidity Theory |
Abstract: The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision and control. Most recent work had been focused on constructing efficient alg... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.