Sciweavers

3707 search results - page 86 / 742
» Clustering by Pattern Similarity
Sort
View
153
Voted
WIRN
2005
Springer
15 years 9 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
107
Voted
ENGL
2007
92views more  ENGL 2007»
15 years 3 months ago
K-Mutual Nearest Neighbour Approach for Clustering Two-Dimensional Shapes Described by Fuzzy-Symbolic Features
Abstract— In this paper, a new method of representing twodimensional shapes using fuzzy-symbolic features and a similarity measure defined over fuzzy-symbolic features useful for...
H. S. Nagendraswamy, D. S. Guru
113
Voted
PR
2007
84views more  PR 2007»
15 years 3 months ago
Attention-based similarity
A similarity measure is described that does not require the prior specification of features or the need for training sets of representative data. Instead large numbers of feature...
Fred Stentiford
117
Voted
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
15 years 1 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 7 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng