Sciweavers

2229 search results - page 258 / 446
» Comparative analysis of biclustering algorithms
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 11 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 11 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
14 years 11 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
14 years 11 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
KBSE
2010
IEEE
13 years 9 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer