We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
Fuzzy vectors were introduced as a description of imprecise quantities whose uncertainty originates from vagueness, not from a probabilistic model. Support functions are a classica...
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
Abstract. Most research works about ontology or schema matching are based on symmetric similarity measures. By transposing the association rules paradigm, we propose to use asymmet...
Abstract. Most classification methods assume that the samples are drawn independently and identically from an unknown data generating distribution, yet this assumption is violated ...