3474 search results - page 644 / 695 » Data Management in RFID Applications |
128
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...
120
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
143
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
142
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
140
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...