Sciweavers

2034 search results - page 40 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
BIOCOMP
2010
13 years 5 months ago
Extraction of Protein Sequence Motifs Information by Bi-Clustering Algorithm
- The activities and function of proteins can potentially be determined by protein sequence motifs. Therefore, obtaining the universally conserved and crossed protein family bounda...
Vincent Yip, Bernard Chen, Sinan Kockara
PRL
2007
150views more  PRL 2007»
13 years 7 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 8 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
GECCO
2004
Springer
160views Optimization» more  GECCO 2004»
14 years 1 months ago
Finding Effective Software Metrics to Classify Maintainability Using a Parallel Genetic Algorithm
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
Rodrigo A. Vivanco, Nicolino J. Pizzi