Main point Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the theoretically optimal lower time bound for obtaining a single-linkage dendrogram. This improves upon the naive O(n 3) implementation of single linkage clustering. A single linkage dendrogram is a tree, where each level of the tree corresponds to a different threshold dissimilar...

In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed shape descriptor is based on a multiscale representation of the discrete set of points, sampled from the internal and external contour points of the query and the candidate shapes. In this approach, dissimilarity between ...

A novel method for classification of abnormality in anatomical tree structures is presented. A tree is classified based on direct comparisons with other trees in a dissimilarity-based classification scheme. The pair-wise dissimilarity measure between two trees is based on a linear assignment between the branch feature vectors representing those trees. Hereby, localized information in the branch...

Physical task stress is known to affect the fundamental frequency and other measurements of the speech signal. A corpus of physical task stress speech is analyzed using a spectrum F-ratio and frame score distribution divergences. The measurements differ between phone classes, and are greater for vowels and nasals than for plosives and fricatives. In further analysis, frame score distribution di...

Metric distances and the more general concept of dissimilarities are widely used tools in instance-based learning methods and very especially in the nearestneighbor classification technique. This paper contributes to the design of general dissimilarity measures to increase their utility. The ability to understand the main properties of a hand-crafted dissimilarity measure and to alter them if n...

A cyclic unary regular language is a regular language over a unary alphabet that is represented by a cyclic automaton. We propose a similarity measure for cyclic unary regular languages by modifying the Jaccard similarity coefficient and the Sørensen coefficient to measure the level of overlap between such languages. This measure computes the proportion of strings that are shared by two or more...

Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two important factors for comparing and mining processes based on distance similarity measure. Some existing work has done on comparing workflow designs based on their precedence graphs. However, there lacks of standard di...

As Similarity measure for fuzzy sets is one of the important research topics of fuzzy set theory, there are several methods to measure similarity between two fuzzy sets (FS), Intuitionistic fuzzy sets (IFS) and Intuitionistic fuzzy multi sets (IFMS). In this paper, the Normalized Hamming Similarity measure of Intuitionistic Fuzzy Multi sets (IFMS) is introduced. This new measure for IFMS is bas...