Sciweavers

692 search results - page 38 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 1 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICASSP
2011
IEEE
12 years 11 months ago
A mutual information based approach for evaluating the quality of clustering
In this paper, a new method for evaluating the quality of clustering of genes is proposed based on mutual information criterion. Instead of using the conventional histogram-based ...
Shaikh Anowarul Fattah, Chia-Chun Lin, Sun-Yuan Ku...
ICASSP
2008
IEEE
14 years 2 months ago
Probabilistic framework for gene expression clustering validation based on gene ontology and graph theory
Based on the correlation between expression and ontologydriven gene similarity, we incorporate functional annotations into gene expression clustering validation. A probabilistic f...
Yinyin Yuan, Chang-Tsun Li
MLDM
2005
Springer
14 years 1 months 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