3068 search results - page 43 / 614 » Clustering with Multiple Graphs |
ICML
2010
IEEE
13 years 12 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
COMAD
2009
13 years 12 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
We present a novel, maximum likelihood framework for automatic spike-sorting based on a joint statistical model of action potential waveform shape and inter-spike interval duratio...
ASUNAM
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
IWPC
2000
IEEE
14 years 3 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...