Sciweavers

4560 search results - page 789 / 912
» Finding Data in the Neighborhood
Sort
View
MOBISYS
2009
ACM
14 years 9 months ago
xShare: supporting impromptu sharing of mobile phones
Loaded with personal data, e.g. photos, contacts, and call history, mobile phones are truly personal devices. Yet it is often necessary or desirable to share our phones with other...
Yunxin Liu, Ahmad Rahmati, Yuanhe Huang, Hyukjae J...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 9 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
KDD
2008
ACM
164views Data Mining» more  KDD 2008»
14 years 9 months ago
Microscopic evolution of social networks
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 ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 9 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
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...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...