Sciweavers

2137 search results - page 40 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICCV
2007
IEEE
14 years 1 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
CCGRID
2006
IEEE
14 years 1 months ago
Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang
ALT
2008
Springer
14 years 4 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
RSCTC
2004
Springer
148views Fuzzy Logic» more  RSCTC 2004»
14 years 27 days ago
Towards Missing Data Imputation: A Study of Fuzzy K-means Clustering Method
In this paper, we present a missing data imputation method based on one of the most popular techniques in Knowledge Discovery in Databases (KDD), i.e. clustering technique. We comb...
Dan Li, Jitender S. Deogun, William Spaulding, Bil...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 2 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios