Sciweavers

4009 search results - page 105 / 802
» Clustering on Complex Graphs
Sort
View
170
Voted
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 3 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
133
Voted
ICIP
2001
IEEE
16 years 5 months ago
Video similarity detection with video signature clustering
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
Sen-Ching S. Cheung, Avideh Zakhor
149
Voted
PAMI
2008
197views more  PAMI 2008»
15 years 3 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
121
Voted
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
15 years 2 months ago
CET: A Tool for Creative Exploration of Graphs
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
Stefan Haun, Andreas Nürnberger, Tobias K&oum...
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 1 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima