961 search results - page 74 / 193 » Significance-Driven Graph Clustering |
156
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
170
click to vote
TDSC
2010
15 years 2 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
127
click to vote
LWA
2007
15 years 5 months ago
2007
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
117
click to vote
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
159
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...