Sciweavers

90 search results - page 10 / 18
» Spectral Clustering by Recursive Partitioning
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 6 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
ENTCS
2008
90views more  ENTCS 2008»
13 years 7 months ago
A Database Approach to Distributed State Space Generation
We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain...
Stefan Blom, Bert Lisser, Jaco van de Pol, Michael...
MLDM
2005
Springer
14 years 27 days ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
BMCBI
2008
142views more  BMCBI 2008»
13 years 7 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 7 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni