Sciweavers

521 search results - page 33 / 105
» Coring method for clustering a graph
Sort
View
NIPS
2001
15 years 5 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
ICCSA
2004
Springer
15 years 9 months ago
A Cluster Based Hierarchical Routing Protocol for Mobile Networks
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Kayhan Erciyes, Geoffrey Marshall
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 1 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
127
Voted
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 10 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
BMCBI
2008
179views more  BMCBI 2008»
15 years 4 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao