This paper introduces a variant of agglomerative hierarchical clustering techniques. The new technique is used for categorizing character shapes (allographs) in large data sets of handwriting into a hierarchical structure. Such a technique may be used as the basis for a systematic naming scheme of character shapes. Problems with existing methods are described and the proposed method is explaine...

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

This paper examines the problem of clustering a sequence of objects that cannot be described with a predeened list of attributes (or variables). In many applications, such a crisp representation cannot be determined. An extension of the traditionnal propositionnal formalism is thus proposed, which allows objects to be represented as a set of components. The algorithm used for clustering is brie...

The graded possibilistic clustering paradigm includes as the two extreme cases the “probabilistic” assumption and the “possibilistic” assumption adopted by many clustering algorithms. We propose an implementation of a graded possibilistic clustering algorithm based on an interval equality constraint enforcing both the normality condition and the required graded possibilistic condition. Experime...

We propose a method for segmentation of ex-pository texts based on hierarchical agglomera-tive clustering. The method uses paragraphs as the basic segments for identifying hierarchical discourse structure in the text, applying lexical similarity between them as the proximity test. Linear segmentation can be induced from the identified structure through application of two simple rules. However t...

The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the 3 (

This paper presents the fourth participation of the SINAI group, University of Jaén, in the Photo Retrieval task at Image CLEF 2009. Our system uses only the text of the queries, and a clustering system (based on kmeans) that combines different approaches based on a different use of the cluster data of the queries. The official results shown that the combination between the title of each query ...

We propose a simple clustering framework on graphs encoding pairwise data similarities. Unlike usual similarity-based methods, the approach softly assigns data to clusters in a probabilistic way. More importantly, a hierarchical clustering is naturally derived in this framework to gradually merge lower-level clusters into higher-level ones. A random walk analysis indicates that the algorithm ex...

This paper presents a method for classifying Japanese polysemous verbs using an algorithm to identify overlapping nodes with more than one cluster. The algorithm is a graph-based unsupervised clustering algorithm, which combines a generalized modularity function, spectral mapping, and fuzzy clustering technique. The modularity function for measuring cluster structure is calculated based on the ...

—In this paper, a clustering algorithm based on the cooperative transmission technology is proposed with respect to uneven energy consumption in large scope wireless sensor network. In this algorithm, to ensure the even distribution of the cluster head nodes in large scope wireless sensor network which has even clusters, the cooperative transmission technology is applied in data transmission a...