Sciweavers

113 search results - page 19 / 23
» Biased Cost Pathfinding
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 8 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 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...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
WWW
2010
ACM
14 years 2 months ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...
CHI
2010
ACM
14 years 2 months ago
Where there's a will there's a way: mobile media sharing in urban india
We present the results of a qualitative study of the sharing and consumption of entertainment media on low-cost mobile phones in urban India, a practice which has evolved into a v...
Thomas N. Smyth, Satish Kumar, Indrani Medhi, Kent...