Abstract Recently, matrix factorization-based hashing has gained wide attention because of its strong subspace learning ability and high search efficiency. However, some problems need to be further addressed. First, uniform hash codes can generated by collective factorization, but they often cause serious loss, degrading the quality codes. Second, most them preserve absolute similarity simply i...

In this paper, we investigate the technique for clustering objects with intuitionistic fuzzy information. We first propose a formula to derive the intuitionistic fuzzy similarity degree between two intuitionistic fuzzy sets and develop an approach to constructing an intuitionistic fuzzy similarity matrix. Then, we present a netting method to make clustering analysis of intuitionistic fuzzy sets...

Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors at a time so that each sensory information yields different similarity matrix derived from the same objects. In such a case, manifold integration is a desirable task, combining these similarity matrices into a comprom...

Abstract Let K be a number field, let A finite-dimensional -algebra, $\operatorname {\mathrm {J}}(A)$ denote the Jacobson radical of and $\Lambda $ an $\mathcal {O}_{K}$ -order in . Suppose that each simple component semisimple -algebra $A/{\operatorname {J}}(A)}$ is isomorphic to matrix ring over field. Under this hypothesis on , we give algorithm that, given two -lattices X Y determines wheth...