Sciweavers

2034 search results - page 33 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
14 years 7 days ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
ADBIS
2007
Springer
145views Database» more  ADBIS 2007»
14 years 2 months ago
A Method for Comparing Self-organizing Maps: Case Studies of Banking and Linguistic Data
The method of self-organizing maps (SOM) is a method of exploratory data analysis used for clustering and projecting multi-dimensional data into a lower-dimensional space to reveal...
Toomas Kirt, Ene Vainik, Leo Vohandu
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 1 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
14 years 1 months ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis