Sciweavers

2137 search results - page 199 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu
CIKM
2011
Springer
12 years 9 months ago
Detecting anomalies in graphs with numeric labels
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
Michael Davis, Weiru Liu, Paul Miller, George Redp...
NIPS
2003
13 years 11 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
CVPR
2005
IEEE
14 years 11 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ICML
2005
IEEE
14 years 10 months ago
Identifying useful subgoals in reinforcement learning by local graph partitioning
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
Özgür Simsek, Alicia P. Wolfe, Andrew G....