In this paper, we propose an approach for the recovery of service abstractions out of sets of available services that play the role of alternative design-decisions, which can be used in a service-oriented application. A service abstraction provides a uniform interface that hides differences in the interfaces of alternative services and consequently allows reducing the coupling between the appli...

A hierarchical multilevel preconditioner is constructed for an efficient solution of a first kind boundary integral equation with the single layer potential operator discretized by a boundary element method. This technique is based on a hierarchical clustering of all boundary elements as used in fast boundary element methods. This hierarchy is applied to define a sequence of nested boundary ele...

This paper studies the problem of learning human action attributes based on union-of-subspaces model. It puts forth an extension of the low-rank representation (LRR) model, termed the hierarchical clustering-aware structure-constrained low-rank representation (HCSLRR) model, for unsupervised learning of human action attributes from video data. The effectiveness of the proposed model is demonstr...

This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are pr...

A widely-used class of algorithms to understand data is hierarchical clustering, but it is often difficult to reconcile the results of these algorithms with hierarchies constructed by humans. Interaction, or querying humans for constraints on the data, is a popular solution for addressing this discrepancy. In this paper, we propose using leave-one-out interactions to achieve better hierarchies ...

We present an approach for the automatic induction of concept hierarchies from text collections. We propose a novel guided agglomerative hierarchical clustering algorithm exploiting a hypernym oracle to drive the clustering process. By inherently integrating the hypernym oracle into the clustering algorithm, we overcome two main problems of unsupervised clustering approaches relying on the dist...

An attempt is made to create some statistical tests for comparing results of hierarchical cluster analysis based on the uniform distribution over the set of all possible dendrograms. Three different uniform distributions are considered according to the degree of similarity of the dendrograms. Some distances between dendrograms are defined and The solutions proposed are computational and are bas...

For hierarchical clustering, dendrograms provide convenient and powerful visualization. Although many visualization methods have been suggested for partitional clustering, their usefulness deteriorates quickly with increasing dimensionality of the data and/or they fail to represent structure between and within clusters simultaneously. In this paper we extend (dissimilarity) matrix shading with ...

For hierarchical clustering, dendrograms provide convenient and powerful visualization. Although many visualization methods have been suggested for partitional clustering, their usefulness deteriorates quickly with increasing dimensionality of the data and/or they fail to represent structure between and within clusters simultaneously. In this paper we extend (dissimilarity) matrix shading with ...

Organizing data into hierarchies is natural for humans. However, there is little work in machine learning that explores human-machine mixed-initiative approaches to organizing data into hierarchical clusters. In this paper we consider mixed-initiative clustering of a user's email, in which the machine produces (initial and re-trained) hierarchical clusterings of email, and the user iteratively ...