In this paper we address the problem of high-dimensionality for data that lies on complex manifolds. In high-dimensional spaces, distances between the nearest and farthest neighbour tend to become equal. This behaviour hardens data analysis, such as clustering. We show that distance transformation can be used in an effective way to obtain an embedding space of lower-dimensionality than the orig...

In this paper, we present an effective method to writer identification that is carried out using single Chinese character as script, which is very flexible and very easy to be used in practice. The directional element features are first extracted from the handwriting character scripts, then the dimensions of the features is reduced using PCA in order to cope with the small sample size problem. ...

This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method employs a trainable edit distance function to find pairs that have a high probability of being equivalent. These pairs can then be used to further bootstrap training of the edit distance function, ...

Combination of multiple segmentations has recently been introduced as an effective method to obtain segmentations that are more accurate than any of the individual input segmentations. This paper introduces a new way to combine multiple segmentations using a novel shape-based averaging method. Individual segmentations are combined based on the signed Euclidean distance maps of the labels in eac...

A new Self-Organizing Map algorithm, called the probabilistic polar self-organizing map (PPoSOM), is proposed. PPoSOM is a new variant of PolSOM, which is constructed on 2-D polar coordinates. Two variables: radius and angle are used to reflect the data characteristics. PPoSOM, developed to enhance the visualization performance, provides more data characteristics compared with the traditional m...

Let G be a connected graph and k ≥ 1 an integer. The open k-neighborhood Nk G(v) of v ∈ V (G) is the set = {u \ {v}: dG(u, v) ≤ k}. A S vertices called distance k-cost effective if for every vertex u in S, |Nk G(u) ∩ (V S)| − S| 0. maximum cardinality upper number G. In this paper, we characterized sets corona lexicographic product two graphs. Consequently, bounds or exact values numbers these ...

Abstract Background Connectivity is an important landscape attribute in ecological studies and conservation practices often expressed terms of effective distance. If the cost movement organism over a effectively represented by raster surface, distances can be equated with cost-weighted distance least-cost paths. It generally recognized that this measure sensitive to grid’s cell size, but little...