Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In ...

In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by D ij = F ii +F jj −2F ij. When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interes...

One of important components in an image retrieval system is selecting a distance measure to compute rank between two objects. In this paper, several distance measures were researched to implement a foliage plant retrieval system. Sixty kinds of foliage plants with various leaf color and shape were used to test the performance of 7 different kinds of distance measures: city block distance, Eucli...

Distances in the well known fuzzy c-means algorithm of Bezdek (1973) are measured by the squared Euclidean distance. Other distances have been used as well in fuzzy clustering. For example, Jajuga (1991) proposed to use the L1-distance and Bobrowski and Bezdek (1991) also used the L∞-distance. For the more general case of Minkowski distance and the case of using a root of the squared Minkowski ...

A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN). The representation of distance measure can be one of the various measures available (e.g. Euclidean distance, Manhattan distance, Mahalanobis distance or other specific distance measures). In this paper, we propose ...

In this paper a range of methods for measuring the phonetic distance between dialectal variants are described. It concerns variants of the frequency method, the frequency per word method and Levenshtein distance, both simple (based on atomic characters) and complex (based on feature bundles). The measurements between feature bundles used Manhattan distance, Euclidean distance or (a measure usin...

This paper proposes a model of a cruising taxicab industry under laissez faire pricing and free entry, and compares it with alternative regimes including collusive fare setting, collusive restrictions on entry, or both. In the model, under laissez faire, prices are determined by Nash bargaining with complete information and lie above marginal costs. Under laissez faire pricing and free entry th...

Texture can be observed in many natural and synthetic images from multispectral satellite images to the microscopic images of cell or tissue samples. Texture is an innate property of virtually all surfaces, the grain of wood, the weave of fabric, the pattern of crop in fields etc It contains important information about the structural arrangement of surfaces and their relationship to the surroun...