Graph-based semi-supervised classification heavily depends on a well-structured graph. In this paper, we investigate a mixture graph and propose a method called semi-supervised classification based on mixture graph (SSCMG). SSCMG first constructs multiple k nearest neighborhood (kNN) graphs in different random subspaces of the samples. Then, it combines these graphs into a mixture graph and inc...

In this note we prove an explicit formula for the lower semicontinuous envelope of some functionals defined on real polyhedral chains. More precisely, denoting by H : R → [0,∞) an even, subadditive, and lower semicontinuous function with H(0) = 0, and by ΦH the functional induced by H on polyhedral m-chains, namely

Abstract In this paper, fixed point and coincidence results are presented for multivalued generalized φ-weak contractive mappings on complete metric spaces, where φ : [0, +∞) −→ [0, +∞) is a lower semicontinuous function with φ(0) = 0 and φ(t) > 0 for all t > 0. Our results extend previous results by Zhang and Song (2009), as well as by Rhoades (2001), Nadler (1969), and Daffer and Kaneko (1995).

We prove a fixed-point result for compact upper semicontinuous compact-convex-valued multifunctions satisfying antipodal boundary conditions on bounded symmetric subsets of a normed space. Two types or antipodal conditions are considered.

A graph is semi-symmetric if it is regular and edge transitive but not vertex transitive. The 3and 4-valent semi-symmetric graphs are wellstudied. Several papers describe infinite families of such graphs and their properties. 3-valent semi-symmetric graphs have been completely classified up to 768 vertices. The goal of this project is to extend this work to 5-valent semi-symmetric graphs. In th...

In this paper, we present a novel semi-supervised learning framework based on `1 graph. The `1 graph is motivated by that each datum can be reconstructed by the sparse linear superposition of the training data. The sparse reconstruction coefficients, used to deduce the weights of the directed `1 graph, are derived by solving an `1 optimization problem on sparse representation. Different from co...

We provide some new Caratheodory-type selection theorems. i.e.. selections for correspondences of two variables which are continuous with respect to one variable and measurable with respect to the other. These results generalize simultaneously Michael’s [2l] continuous selection theorem for lower-semicontinuous correspondences as well as a Caratheodory-type selection theorem of Fryszkowski [IO]...

In this paper, a new deep learning network named as graph-based point tracker (GPT) is proposed for 3D object tracking in clouds. GPT not based on Siamese applied to template and search area, but it the transfer of target clue from area. end-to-end trainable. has two modules: graph feature augmentation (GFA) improved (ITC) module. The key idea GFA exploit one-to-many relationship between area p...

We show that a nite graph that is the inverse limit with a single surjective upper semi-continuous set valued function f : [0, 1] → 2[0,1] is either an arc or a simple triod. It is not known if there is such a simple triod.