521 search results - page 2 / 105 » Coring method for clustering a graph |
APWEB
2009
Springer
13 years 3 months ago
2009
Springer
Along with the development of Web2.0, folksonomy has become a hot topic related to data mining, information retrieval and social network. The tag semantic is the key for deep under...
DDECS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
DEXAW
2009
IEEE
14 years 1 days ago
2009
IEEE
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
GD
2004
Springer
13 years 10 months ago
2004
Springer
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
IJON
2010
13 years 3 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...