One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in which non-weighting algorithm adaptGWSAT+ selects a variable to flip, as heuristic adaptGWSAT+, the way in which clause weighting algorithm RSAPS selects a variable to flip, as heuristic RSAPS, and the way in which v...

Supervised term weighting could improve the performance of text categorization. A way proven to be effective is to give more weight to terms with more imbalanced distributions across categories. This paper shows that supervised term weighting should not just assign large weights to imbalanced terms, but should also control the trade-off between over-weighting and under-weighting. Overweighting,...

Many case-based reasoning algorithms employ derivatives of the k-nearest neighbor (k-NN) classiier for case retrieval. Several studies have shown that its similarity function is sensitive to imperfect feature sets (i.e., containing irrelevant, redundant, interacting, or noisy features). Many proposed methods attempt to reduce this sensitivity by parameterizing k-NN's similarity function with fe...

An interesting scheme for estimating and adapting distributions in real-time for non-stationary data has recently been the focus of study for several different tasks relating to time series and data mining, namely change point detection, outlier detection and online compression/ sequence prediction. An appealing feature is that unlike more sophisticated procedures, it is as fast as the related ...

We present a way to make environmental recordings controllable again by the use of continuous annotations of the high-level semantic parameter one wishes to control, e.g. wind strength or crowd excitation level. A partial annotation can be propagated to cover the entire recording via cross-modal analysis between gesture and sound by canonical time warping (CTW). The annotations serve as a descr...

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

I am grateful to Scott Soames, Jason Turner, and Mark Wilson for their comments on Constructing the World. Soames andWilson are two of the primary opponents I had in mind in writing the book, and it is useful to see just where our disagreements lie. Both of them raise central issues about the semantic applications of the epistemological framework in the book, especially the use of the scrutabil...

We demonstrate – using linear scattering theory and an idealized, stratified, rotating ocean domain, with a flat bottom deep ocean and a straight continental slope and shelf – that a high-mode (mode 3) Poincare wave incident on the coastal margin can excite large amplitude leaky coastal trapped waves (CTWs) or leaky edge waves along the coastal margin dependent on the frequency and alongshore w...

Redundancy is de ned as the excess of the code length over the optimal (ideal) code length. We study the average redundancy of an idealized arithmetic coding (for memoryless sources with unknown distributions) in which the Krichevsky and Tro mov estimator is followed by the Shannon{Fano code. We shall ignore here important practical implementation issues such as nite precisions and nite bu er s...

Most of the previous research on term weighting for information retrieval has focused on developing specialized parametric term weighting functions. Examples include TF.IDF vector-space formulations, BM25, and language modeling weighting. Each of these term weighting functions takes on a specific parametric form. While these weighting functions have proven to be highly effective, they impose st...