Sciweavers

291 search results - page 27 / 59
» Clustering and the Biclique Partition Problem
Sort
View
CSDA
2006
84views more  CSDA 2006»
13 years 9 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
EUROPAR
2009
Springer
14 years 1 months ago
Distributed Data Partitioning for Heterogeneous Processors Based on Partial Estimation of Their Functional Performance Models
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
Alexey L. Lastovetsky, Ravi Reddy
ALMOB
2006
89views more  ALMOB 2006»
13 years 9 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
COMAD
2008
13 years 10 months ago
An Experiment with Distance Measures for Clustering
Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study vario...
Ankita Vimal, Satyanarayana R. Valluri, Kamalakar ...
PAMI
2007
202views more  PAMI 2007»
13 years 8 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis