2137 search results - page 130 / 428 » Experiments on Graph Clustering Algorithms |
NIPS
2003
14 years 5 days ago
2003
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
JMLR
2010
13 years 5 months ago
2010
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA is designed to deal...
ECCV
2010
Springer
14 years 4 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
ACMSE
2005
ACM
14 years 4 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
ICCAD
2005
IEEE
14 years 7 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...