2137 search results - page 198 / 428 » Experiments on Graph Clustering Algorithms |
DAGM
2007
Springer
14 years 3 months ago
2007
Springer
We present an approach for estimating the 3D position and in case of articulated objects also the joint configuration from segmented 2D images. The pose estimation without initial...
FSKD
2008
Springer
13 years 10 months ago
2008
Springer
Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasiidentifier is a key co...
TKDE
2010
13 years 8 months ago
2010
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
IICS
2003
Springer
14 years 2 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
PAKDD
2010
ACM
14 years 2 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...