Related papers: Hyperspace Selections Avoiding Points
Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of…
The existence and uniqueness of fixed points of both the cyclic self-mapping and its associate composite self-mappings on each of the subsets are investigated if the subsets in the cyclic disposal are nonempty, bounded and of nonempty…
It is proved that, if $(P_n)$ is a sequence of polynomials with complex coefficients having unbounded valences and tending to infinity at sufficiently many points, then there is an infinite dimensional closed subspace of entire functions,…
In this paper we study the property of separability of functional space with the open-point and bi-point-open topologies.
We provide a sufficient condition for an operator $T$ on a non-metrizable and sequentially separable topological vector space $X$ to be sequentially hypercyclic. This condition is applied to some particular examples, namely, a composition…
Given a set of data, biclustering aims at finding simultaneous partitions in biclusters of its samples and of the features which are used for representing the samples. Consistent biclusterings allow to obtain correct classifications of the…
We study two classes of spaces whose points are filters on partially ordered sets. Points in MF spaces are maximal filters, while points in UF spaces are unbounded filters. We give a thorough account of the topological properties of these…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
Finitely many hypersurfaces are removed from unordered configuration spaces of $n$ points in $\mathbb{C}$ to obtain a fibration over unordered configuration spaces of $n-1$ complex points. Fundamental groups of these restricted…
Semi-supervised clustering methods incorporate a limited amount of supervision into the clustering process. Typically, this supervision is provided by the user in the form of pairwise constraints. Existing methods use such constraints in…
When a data set has significant differences in its class and cluster structure, selecting features aiming only at the discrimination of classes would lead to poor clustering performance, and similarly, feature selection aiming only at…
The aim of this paper is introduce and initiate the study of extremally $T_1$-spaces, i.e., the spaces where all hereditarily compact $C_2$-subspaces are closed. A $C_2$-space is a space whose nowhere dense sets are finite.
Characterizations of paracompact finite $C$-spaces via continuous selections are given. We apply these results to obtain some properties of finite $C$-spaces. Factorization theorems and a completion theorem for finite $C$- spaces are also…
We study $n$-flimsy spaces, which are the topological spaces that remain connected when removing fewer than $n$ points but become disconnected when removing exactly $n$ points. We show that no such space exists for $n \geq 3$, and that the…
A space $X$ is strongly $Y$-selective (resp., $Y$-selective) if every lower semicontinuous mapping from $Y$ to the nonempty subsets (resp., nonempty closed subsets) of $X$ has a continuous selection. We also call $X$ (strongly)…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
In this paper, we exhibit the tradeoffs between the (training) sample, computation and storage complexity for the problem of supervised classification using signal subspace estimation. Our main tool is the use of tensor subspaces, i.e.…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
Two selection games from the literature, $G_c(\mathcal O,\mathcal O)$ and $G_1(\mathcal O_{zd},\mathcal O)$, are known to characterize countable dimension among certain spaces. This paper studies their perfect- and limited-information…
The feature-selection problem is formulated from an information-theoretic perspective. We show that the problem can be efficiently solved by an extension of the recently proposed info-clustering paradigm. This reveals the fundamental…