Sciweavers

4791 search results - page 809 / 959
» Clustering with partial information
Sort
View
WWW
2009
ACM
16 years 7 months ago
The slashdot zoo: mining a social network with negative edges
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other use...
Andreas Lommatzsch, Christian Bauckhage, Jé...
176
Voted
WWW
2008
ACM
16 years 7 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta
203
Voted
WWW
2007
ACM
16 years 7 months ago
Google news personalization: scalable online collaborative filtering
Several approaches to collaborative filtering have been studied but seldom have studies been reported for large (several million users and items) and dynamic (the underlying item ...
Abhinandan Das, Mayur Datar, Ashutosh Garg, ShyamS...
204
Voted
WWW
2003
ACM
16 years 7 months ago
Application specific data replication for edge services
The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites. A key chal...
Lei Gao, Michael Dahlin, Amol Nayate, Jiandan Zhen...
176
Voted
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren