Sciweavers

387 search results - page 16 / 78
» Beyond Pairwise Clustering
Sort
View
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
14 years 4 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
ICML
2010
IEEE
13 years 8 months ago
Power Iteration Clustering
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
Frank Lin, William W. Cohen
RECOMB
2008
Springer
14 years 7 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
DIS
2005
Springer
14 years 27 days ago
Active Constrained Clustering by Examining Spectral Eigenvectors
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...
Qianjun Xu, Marie desJardins, Kiri Wagstaff