In this paper, we address the problem of the usefulness of the set of discovered association rules. This problem is important since real-life databases yield most of the time several thousands of rules with high confidence. We propose new algorithms based on Galois closed sets to reduce the extraction to small covers (or bases) for exact and approximate rules, adapted from lattice theory and da...

In this study, closed-set, text-independent speaker identi cation is considered and the problem of improving the reliability of the decisions made by available algorithms is addressed. The work presented here is based on the idea of combining the evidences from di erent algorithms or decision strategies to improve the recognition performance and the reliability. For this purpose, the models gen...

In studying the enumerative theory of super characters of the group of upper triangular matrices over a finite field we found that the moments (mean, variance and higher moments) of novel statistics on set partitions of [n] = {1, 2, · · · , n} have simple closed expressions as linear combinations of shifted bell numbers. It is shown here that families of other statistics have similar moments. T...

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskĭı, Tsĕıtin, Kreisel, and Lacombe assert the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are even ‘large’ in the sense of positive Lebesgue measure. We observe that a certain size is in fact necessary : every non-empty co-r.e. closed real set without ...

Today, huge volumes of sensor data are collected from many different sources. One of the most crucial data mining tasks considering this data is the ability to predict and classify data to anticipate trends or failures and take adequate steps. While the initial data might be of limited interest itself, the use of additional information, e.g., latent attributes, spatio-temporal details, etc., ca...

In this paper, we define and study fuzzy generalized α-closed sets and r-open sets of a given L-fuzzy topological space and prime element r ∈ P (L) and coprime element α ∈ M(L). The concept of L-fuzzy ropen sets was introduced in [10], and it was proved that all r-open sets for L-fuzzy topological space form a new L-fuzzy topology, which is called stratiform L-fuzzy topology. Making use of the ...

Abstract. The purpose of the paper is to introduce and study the concepts of fuzzy generalized γ closed sets and study their basic properties in fuzzy topological spaces. Moreover, in this paper we define fuzzy γT1⁄2 spaces in which every fuzzy generalized γ continuous is fuzzy γ continuous. In addition, we have also introduced and studied fuzzy generalized γ connectedness and fuzzy generalized...

In this paper we present a novel approach to mobile robot navigation in natural unstructured environments. Natural scenes can be considered as random fields where a large number of individual objects of random shape appear randomly scattered in space. In this paper we use Random Closed Sets (RCS) to model the random scattering and shape of the objects observed, and base the navigation of a robo...

The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350–359) for mining representative rules. We show that its output is sometimes incomplet...