34 search results - page 3 / 7 » pakdd 2010 |
PAKDD
2010
ACM
14 years 11 days ago
2010
ACM
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
PAKDD
2010
ACM
14 years 11 days 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...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
PAKDD
2010
ACM
14 years 11 days ago
2010
ACM
Abstract. Consider the scenario where information about a large network is distributed across several different parties or commercial entities. Intuitively, we would expect that th...
PAKDD
2010
ACM
14 years 11 days ago
2010
ACM
The skyline operator is a well established database primitive which is traditionally applied in a way that only a single skyline is computed. In this paper we use multiple skylines...