1385 search results - page 4 / 277 » Clustering by Random Projections |
101
click to vote
ECML
2004
Springer
15 years 5 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
108
click to vote
CIBB
2008
2008
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
15 years 1 months ago
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
123
click to vote
KDD
2009
ACM
16 years 4 days ago
2009
ACM
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-s...
120
click to vote
KAIS
2011
14 years 6 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...