text stringlengths 0 4.09k |
|---|
Title: Sequential anomaly detection in the presence of noise and limited feedback |
Abstract: This paper describes a methodology for detecting anomalies from sequentially observed and potentially noisy data. The proposed approach consists of two main elements: (1) \em filtering, or assigning a belief or likelihood to each successive measurement based upon our ability to predict it from previous noisy ... |
Title: Kullback-Leibler aggregation and misspecified generalized linear models |
Abstract: In a regression setup with deterministic design, we study the pure aggregation problem and introduce a natural extension from the Gaussian distribution to distributions in the exponential family. While this extension bears strong connections with generalized linear models, it does not require identifiability ... |
Title: Spatial Analysis of Opportunistic Downlink Relaying in a Two-Hop Cellular System |
Abstract: We consider a two-hop cellular system in which the mobile nodes help the base station by relaying information to the dead spots. While two-hop cellular schemes have been analyzed previously, the distribution of the node locations has not been explicitly taken into account. In this paper, we model the node loc... |
Title: A Dynamic Near-Optimal Algorithm for Online Linear Programming |
Abstract: A natural optimization model that formulates many online resource allocation and revenue management problems is the online linear program (LP) in which the constraint matrix is revealed column by column along with the corresponding objective coefficient. In such a model, a decision variable has to be set each... |
Title: On game psychology: an experiment on the chess board/screen, should you always "do your best", and why the programs with prescribed weaknesses cannot be our good friends? |
Abstract: It is noted that some unusual moves against a strong chess program greatly weaken its ability to see the serious targets of the game, and its whole level of play... It is suggested to create programs with different weaknesses in order to analyze similar human behavior. Finally, a new version of chess, "Chess ... |
Title: Apply Ant Colony Algorithm to Search All Extreme Points of Function |
Abstract: To find all extreme points of multimodal functions is called extremum problem, which is a well known difficult issue in optimization fields. Applying ant colony optimization (ACO) to solve this problem is rarely reported. The method of applying ACO to solve extremum problem is explored in this paper. Experime... |
Title: Automated languages phylogeny from Levenshtein distance |
Abstract: Languages evolve over time in a process in which reproduction, mutation and extinction are all possible, similar to what happens to living organisms. Using this similarity it is possible, in principle, to build family trees which show the degree of relatedness between languages. The method used by modern glot... |
Title: Automated words stability and languages phylogeny |
Abstract: The idea of measuring distance between languages seems to have its roots in the work of the French explorer Dumont D'Urville (D'Urville 1832). He collected comparative words lists of various languages during his voyages aboard the Astrolabe from 1826 to1829 and, in his work about the geographical division of ... |
Title: Understanding the Principles of Recursive Neural networks: A Generative Approach to Tackle Model Complexity |
Abstract: Recursive Neural Networks are non-linear adaptive models that are able to learn deep structured information. However, these models have not yet been broadly accepted. This fact is mainly due to its inherent complexity. In particular, not only for being extremely complex information processing models, but also... |
Title: Keystroke Dynamics Authentication For Collaborative Systems |
Abstract: We present in this paper a study on the ability and the benefits of using a keystroke dynamics authentication method for collaborative systems. Authentication is a challenging issue in order to guarantee the security of use of collaborative systems during the access control step. Many solutions exist in the s... |
Title: Seeing Science |
Abstract: The ability to represent scientific data and concepts visually is becoming increasingly important due to the unprecedented exponential growth of computational power during the present digital age. The data sets and simulations scientists in all fields can now create are literally thousands of times as large a... |
Title: Measuring the Meaning of Words in Contexts: An automated analysis of controversies about Monarch butterflies, Frankenfoods, and stem cells |
Abstract: Co-words have been considered as carriers of meaning across different domains in studies of science, technology, and society. Words and co-words, however, obtain meaning in sentences, and sentences obtain meaning in their contexts of use. At the science/society interface, words can be expected to have differe... |
Title: A random-projection based procedure to test if a stationary process is Gaussian |
Abstract: In this paper we address the statistical problem of testing if a stationary process is Gaussian. The observation consists in a finite sample path of the process. Using a random projection technique introduced and studied in Cuesta-Albertos et al. 2007 in the frame of goodness of fit test for functional data, ... |
Title: A Geometric Approach to Sample Compression |
Abstract: The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of hyperplanes in Hyperbolic space, and Piecewise-Linear hyperplane arrangem... |
Title: Manipulability of Single Transferable Vote |
Abstract: For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically the cost of manipulating the single transferable vote (STV) rule. This... |
Title: Comments on "Particle Markov Chain Monte Carlo" by C. Andrieu, A. Doucet and R. Hollenstein |
Abstract: We merge in this note our two discussions about the Read Paper "Particle Markov chain Monte Carlo" (Andrieu, Doucet, and Holenstein, 2010) presented on October 16th 2009 at the Royal Statistical Society, appearing in the Journal of the Royal Statistical Society Series B. We also present a more detailed versio... |
Title: Likelihood-based semi-supervised model selection with applications to speech processing |
Abstract: In conventional supervised pattern recognition tasks, model selection is typically accomplished by minimizing the classification error rate on a set of so-called development data, subject to ground-truth labeling by human experts or some other means. In the context of speech processing systems and other large... |
Title: Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for Sparsity Regularized Estimation |
Abstract: We analyze the convergence behaviour of a recently proposed algorithm for regularized estimation called Dual Augmented Lagrangian (DAL). Our analysis is based on a new interpretation of DAL as a proximal minimization algorithm. We theoretically show under some conditions that DAL converges super-linearly in a... |
Title: Towards Industrialized Conception and Production of Serious Games |
Abstract: Serious Games (SGs) have experienced a tremendous outburst these last years. Video game companies have been producing fun, user-friendly SGs, but their educational value has yet to be proven. Meanwhile, cognition research scientist have been developing SGs in such a way as to guarantee an educational gain, bu... |
Title: Bio-inspired speed detection and discrimination |
Abstract: In the field of computer vision, a crucial task is the detection of motion (also called optical flow extraction). This operation allows analysis such as 3D reconstruction, feature tracking, time-to-collision and novelty detection among others. Most of the optical flow extraction techniques work within a finit... |
Title: How slow is slow? SFA detects signals that are slower than the driving force |
Abstract: Slow feature analysis (SFA) is a method for extracting slowly varying driving forces from quickly varying nonstationary time series. We show here that it is possible for SFA to detect a component which is even slower than the driving force itself (e.g. the envelope of a modulated sine wave). It is shown that ... |
Title: Designing fuzzy rule based classifier using self-organizing feature map for analysis of multispectral satellite images |
Abstract: We propose a novel scheme for designing fuzzy rule based classifier. An SOFM based method is used for generating a set of prototypes which is used to generate a set of fuzzy rules. Each rule represents a region in the feature space that we call the context of the rule. The rules are tuned with respect to thei... |
Title: Land cover classification using fuzzy rules and aggregation of contextual information through evidence theory |
Abstract: Land cover classification using multispectral satellite image is a very challenging task with numerous practical applications. We propose a multi-stage classifier that involves fuzzy rule extraction from the training data and then generation of a possibilistic label vector for each pixel using the fuzzy rule ... |
Title: Group-based Query Learning for rapid diagnosis in time-critical situations |
Abstract: In query learning, the goal is to identify an unknown object while minimizing the number of "yes or no" questions (queries) posed about that object. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as... |
Title: Improving the Convergence Properties of the Data Augmentation Algorithm with an Application to Bayesian Mixture Modeling |
Abstract: The reversible Markov chains that drive the data augmentation (DA) and sandwich algorithms define self-adjoint operators whose spectra encode the convergence properties of the algorithms. When the target distribution has uncountable support, as is nearly always the case in practice, it is generally quite diff... |
Title: CanICA: Model-based extraction of reproducible group-level ICA patterns from fMRI time series |
Abstract: Spatial Independent Component Analysis (ICA) is an increasingly used data-driven method to analyze functional Magnetic Resonance Imaging (fMRI) data. To date, it has been used to extract meaningful patterns without prior information. However, ICA is not robust to mild data variation and remains a parameter-se... |
Title: Exchangeability and sets of desirable gambles |
Abstract: Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments for them, and prove counterparts of de Finetti's finite and infinite r... |
Title: A test for second order stationarity of a time series based on the Discrete Fourier Transform (Technical Report) |
Abstract: We consider a zero mean discrete time series, and define its discrete Fourier transform at the canonical frequencies. It is well known that the discrete Fourier transform is asymptotically uncorrelated at the canonical frequencies if and if only the time series is second order stationary. Exploiting this impo... |
Title: Statistical exponential families: A digest with flash cards |
Abstract: This document describes concisely the ubiquitous class of exponential family distributions met in statistics. The first part recalls definitions and summarizes main properties and duality with Bregman divergences (all proofs are skipped). The second part lists decompositions and related formula of common expo... |
Title: Non-photorealistic image processing: an Impressionist rendering |
Abstract: The paper describes an image processing for a non-photorealistic rendering. The algorithm is based on a random choice of a set of pixels from those ot the original image and substitution of them with colour spots. An iterative procedure is applied to cover, at a desired level, the canvas. The resulting effect... |
Title: On $\ell_1$-regularized estimation for nonlinear models that have sparse underlying linear structures |
Abstract: In a recent work (arXiv:0910.2517), for nonlinear models with sparse underlying linear structures, we studied the error bounds of $\ell_0$-regularized estimation. In this note, we show that $\ell_1$-regularized estimation in some important cases can achieve the same order of error bounds as those in the afore... |
Title: A Semantic Similarity Measure for Expressive Description Logics |
Abstract: A totally semantic measure is presented which is able to calculate a similarity value between concept descriptions and also between concept description and individual or between individuals expressed in an expressive description logic. It is applicable on symbolic descriptions although it uses a numeric appro... |
Title: A Bayesian Rule for Adaptive Control based on Causal Interventions |
Abstract: Explaining adaptive behavior is a central problem in artificial intelligence research. Here we formalize adaptive agents as mixture distributions over sequences of inputs and outputs (I/O). Each distribution of the mixture constitutes a `possible world', but the agent does not know which of the possible world... |
Title: A conversion between utility and information |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.