Perhaps the most straightforward classifier in arsenal or Machine Learning techniques is Nearest Neighbour Classifier—classification achieved by identifying nearest neighbours to a query example and using those determine class of query. This approach classification particular importance, because issues poor runtime performance not such problem these days with computational power that available....

In alphabetic languages, prior exposure to a target word's orthographic neighbour influences word recognition in masked priming experiments and the process of word identification that occurs during normal reading. We investigated whether similar neighbour priming effects are observed in Chinese in 4 masked priming experiments (employing a forward mask and 33-ms, 50-ms, and 67-ms prime durations...

In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

In this paper, the problem of clustering data points that lie near or on a union independent low-dimensional subspaces is addressed. To end, popular spectral clustering-based algorithms usually follow two-stage strategy initially builds an affinity matrix and then applies clustering. However, inappropriate does not sufficiently connect lying same subspace will easily lead to issue over-segmenta...

We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neigh...

In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...