5606 search results - page 429 / 1122 » Randomization Techniques for Graphs. |
171
click to vote
FLAIRS
2000
15 years 8 months ago
2000
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
207
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
170
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
202
click to vote
PKDD
2007
Springer
16 years 26 days 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...
162
click to vote
WINE
2007
Springer
16 years 25 days ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...