text stringlengths 0 4.09k |
|---|
Title: Segmentation of the mean of heteroscedastic data via cross-validation |
Abstract: This paper tackles the problem of detecting abrupt changes in the mean of a heteroscedastic signal by model selection, without knowledge on the variations of the noise. A new family of change-point detection procedures is proposed, showing that cross-validation methods can be successful in the heteroscedastic... |
Title: Network of two-Chinese-character compound words in Japanese language |
Abstract: Some statistical properties of a network of two-Chinese-character compound words in Japanese language are reported. In this network, a node represents a Chinese character and an edge represents a two-Chinese-character compound word. It is found that this network has properties of "small-world" and "scale-free... |
Title: Dipole and Quadrupole Moments in Image Processing |
Abstract: This paper proposes an algorithm for image processing, obtained by adapting to image maps the definitions of two well-known physical quantities. These quantities are the dipole and quadrupole moments of a charge distribution. We will see how it is possible to define dipole and quadrupole moments for the gray-... |
Title: Bivariate Instantaneous Frequency and Bandwidth |
Abstract: The generalizations of instantaneous frequency and instantaneous bandwidth to a bivariate signal are derived. These are uniquely defined whether the signal is represented as a pair of real-valued signals, or as one analytic and one anti-analytic signal. A nonstationary but oscillatory bivariate signal has a n... |
Title: A Gibbs Sampling Alternative to Reversible Jump MCMC |
Abstract: This note presents a simple and elegant sampler which could be used as an alternative to the reversible jump MCMC methodology. |
Title: Prediction with expert evaluators' advice |
Abstract: We introduce a new protocol for prediction with expert advice in which each expert evaluates the learner's and his own performance using a loss function that may change over time and may be different from the loss functions used by the other experts. The learner's goal is to perform better or not much worse t... |
Title: A mixture model for unsupervised tail estimation |
Abstract: This paper proposes a new method to combine several densities such that each density dominates a separate part of a joint distribution. The method is fully unsupervised, i.e. the parameters in the densities and the thresholds are simultaneously estimated. The approach uses cdf functions in the mixing. This ma... |
Title: Multiplicative updates For Non-Negative Kernel SVM |
Abstract: We present multiplicative updates for solving hard and soft margin support vector machines (SVM) with non-negative kernels. They follow as a natural extension of the updates for non-negative matrix factorization. No additional param- eter setting, such as choosing learning, rate is required. Ex- periments dem... |
Title: Kernel Partial Least Squares is Universally Consistent |
Abstract: We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Least Squares stands out of well-known classical approaches as e.g. Ridge Regression or Principal Components Regression, as it is not ... |
Title: Dimension reduction in representation of the data |
Abstract: Suppose the data consist of a set $S$ of points $x_j$, $1\leq j \leq J$, distributed in a bounded domain $D\subset R^N$, where $N$ is a large number. An algorithm is given for finding the sets $L_k$ of dimension $k\ll N$, $k=1,2,...K$, in a neighborhood of which maximal amount of points $x_j\in S$ lie. The al... |
Title: Are Tensor Decomposition Solutions Unique? On the global convergence of HOSVD and ParaFac algorithms |
Abstract: For tensor decompositions such as HOSVD and ParaFac, the objective functions are nonconvex. This implies, theoretically, there exists a large number of local optimas: starting from different starting point, the iteratively improved solution will converge to different local solutions. This non-uniqueness prese... |
Title: Dipole Vectors in Images Processing |
Abstract: Instead of evaluating the gradient field of the brightness map of an image, we propose the use of dipole vectors. This approach is obtained by adapting to the image gray-tone distribution the definition of the dipole moment of charge distributions. We will show how to evaluate the dipoles and obtain a vector ... |
Title: Lectures on Jacques Herbrand as a Logician |
Abstract: We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem proving. The intended audience ranges from students interested in logic over historians to logicians. Besides the well-known correction of Herbrand's False Lemma by Goedel and Dreb... |
Title: ADIS - A robust pursuit algorithm for probabilistic, constrained and non-square blind source separation with application to fMRI |
Abstract: In this article, we develop an algorithm for probabilistic and constrained projection pursuit. Our algorithm called ADIS (automated decomposition into sources) accepts arbitrary non-linear contrast functions and constraints from the user and performs non-square blind source separation (BSS). In the first stag... |
Title: Estimation in nonstationary random coefficient autoregressive models |
Abstract: We investigate the estimation of parameters in the random coefficient autoregressive model. We consider a nonstationary RCA process and show that the innovation variance parameter cannot be estimated by the quasi-maximum likelihood method. The asymptotic normality of the quasi-maximum likelihood estimator for... |
Title: Learning DTW Global Constraint for Time Series Classification |
Abstract: 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the most effective classifiers on time series domain. Since the global constraint has been introduced in speech community, many global constraint models have been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and Rat... |
Title: Manipulation Robustness of Collaborative Filtering Systems |
Abstract: A collaborative filtering system recommends to users products that similar users like. Collaborative filtering systems influence purchase decisions, and hence have become targets of manipulation by unscrupulous vendors. We provide theoretical and empirical results demonstrating that while common nearest neigh... |
Title: Recognition of Regular Shapes in Satelite Images |
Abstract: This paper has been withdrawn by the author ali pourmohammad. |
Title: Accelerating and Evaluation of Syntactic Parsing in Natural Language Question Answering Systems |
Abstract: With the development of Natural Language Processing (NLP), more and more systems want to adopt NLP in User Interface Module to process user input, in order to communicate with user in a natural way. However, this raises a speed problem. That is, if NLP module can not process sentences in durable time delay, u... |
Title: A Graph Analysis of the Linked Data Cloud |
Abstract: The Linked Data community is focused on integrating Resource Description Framework (RDF) data sets into a single unified representation known as the Web of Data. The Web of Data can be traversed by both man and machine and shows promise as the standard for integrating data world wide much like the World Wide ... |
Title: Faith in the Algorithm, Part 1: Beyond the Turing Test |
Abstract: Since the Turing test was first proposed by Alan Turing in 1950, the primary goal of artificial intelligence has been predicated on the ability for computers to imitate human behavior. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly ou... |
Title: Bayesian testing of many hypotheses $\times$ many genes: A study of sleep apnea |
Abstract: Substantial statistical research has recently been devoted to the analysis of large-scale microarray experiments which provide a measure of the simultaneous expression of thousands of genes in a particular condition. A typical goal is the comparison of gene expression between two conditions (e.g., diseased vs... |
Title: Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints |
Abstract: We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algori... |
Title: Impact of Cognitive Radio on Future Management of Spectrum |
Abstract: Cognitive radio is a breakthrough technology which is expected to have a profound impact on the way radio spectrum will be accessed, managed and shared in the future. In this paper I examine some of the implications of cognitive radio for future management of spectrum. Both a near-term view involving the oppo... |
Title: An introduction to DSmT |
Abstract: The management and combination of uncertain, imprecise, fuzzy and even paradoxical or high conflicting sources of information has always been, and still remains today, of primal importance for the development of reliable modern information systems involving artificial reasoning. In this introduction, we prese... |
Title: Granularity-Adaptive Proof Presentation |
Abstract: When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem provers, in contrast, present proofs usually at a fixed level of detail (also called granularity). Often these presentations are neither... |
Title: Deductive Inference for the Interiors and Exteriors of Horn Theories |
Abstract: In this paper, we investigate the deductive inference for the interiors and exteriors of Horn knowledge bases, where the interiors and exteriors were introduced by Makino and Ibaraki to study stability properties of knowledge bases. We present a linear time algorithm for the deduction for the interiors and sh... |
Title: Filtering Algorithms for the Multiset Ordering Constraint |
Abstract: Constraint programming (CP) has been used with great success to tackle a wide variety of constraint satisfaction problems which are computationally intractable in general. Global constraints are one of the important factors behind the success of CP. In this paper, we study a new global constraint, the multise... |
Title: Breaking Value Symmetry |
Abstract: Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries. Our results identify computational limits on eliminating value symmetry. For instance... |
Title: The Parameterized Complexity of Global Constraints |
Abstract: We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them fixed-parameter tractable and which are easy to compute. This tractability t... |
Title: Decompositions of Grammar Constraints |
Abstract: A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive constraints. We can then, for instance, use state of the art SAT solvers and p... |
Title: SLIDE: A Useful Special Case of the CARDPATH Constraint |
Abstract: We study the CardPath constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CardPath where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CardPath itself. We co... |
Title: Reformulating Global Grammar Constraints |
Abstract: An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a context-free grammar respectively. Taking advantage of the fixed length o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.